惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Stack Overflow Blog
Stack Overflow Blog
Vercel News
Vercel News
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
J
Java Code Geeks
M
MIT News - Artificial intelligence
Microsoft Azure Blog
Microsoft Azure Blog
B
Blog RSS Feed
MongoDB | Blog
MongoDB | Blog
G
Google Developers Blog
Engineering at Meta
Engineering at Meta
量子位
S
SegmentFault 最新的问题
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
A
About on SuperTechFans
P
Proofpoint News Feed
Last Week in AI
Last Week in AI
Recent Announcements
Recent Announcements
腾讯CDC
I
InfoQ
F
Fortinet All Blogs
Hugging Face - Blog
Hugging Face - Blog
Blog — PlanetScale
Blog — PlanetScale
H
Help Net Security
爱范儿
爱范儿

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Infinite-dimensional $q$-Jacobi Markov processes
Grigori Olshanski · 2025-02-28 · via math.CO updates on arXiv.org

The classical Jacobi polynomials on the interval $[-1,1]$ are eigenfunctions of a second order differential operator. It is well known that this operator generates a diffusion process on $[-1,1]$. Further, this fact admits an extension to $N$ dimensions (Demni (2010), Remling-Rösler (2011)) leading to a $3$-parameter family of diffusion processes $X_N$ on the space of $N$-particle configurations in $[-1,1]$. The generators of the processes $X_N$ are related to Heckman-Opdam's Jacobi polynomials attached to the root system $BC_N$. The first result of the paper shows that the processes $X_N$ have a $q$-analog, the $N$-dimensional $q$-Jacobi processes. These are Feller Markov processes related to the $N$-variate symmetric big $q$-Jacobi polynomials. The later polynomials were introduced and studied by Stokman (1997) and Stokman-Koornwinder (1997); they depend on two Macdonald parameters $(q,t)$ and $4$ extra continuous parameters. The $N$-dimensional $q$-Jacobi processes are still defined on a space of $N$-particle configurations, only now the particles live not on $[-1,1]$ but on certain one-dimensional $q$-grids. The second result (the main one) asserts that the $N$-dimensional $q$-Jacobi processes survive a limit transition as $N$ goes to infinity and two of the extra parameters vary together with $N$ in a certain way. In the limit, one obtains a family of Feller Markov processes which are infinite-dimensional in the sense that they live on configurations with infinitely many particles. The proof uses a lifting of the multivariate big $q$-Jacobi polynomials to the algebra of symmetric functions -- a construction that does not hold for the Heckman-Opdam's Jacobi polynomials. Note also that the large-$N$ limit transition is carried out without any space scaling, which would be impossible in the continuous case.