Related papers: Macdonald polynomials and extended Gelfand-Tsetlin…
A sequence of real numbers (x_n) is Benford if the significands, i.e. the fraction parts in the floating-point representation of (x_n) are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov…
Markov chains are a class of probabilistic models that have achieved widespread application in the quantitative sciences. This is in part due to their versatility, but is compounded by the ease with which they can be probed analytically.…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
About two dozens of exactly solvable Markov chains on one-dimensional finite and semi-infinite integer lattices are constructed in terms of convolutions of orthogonality measures of the Krawtchouk, Hahn, Meixner, Charlier, $q$-Hahn,…
We consider the decomposition into irreducible components of the exterior algebra $\bigwedge\left(\mathbb{C}^{n}\otimes \left(\mathbb{C}^{k}\right)^{*}\right)$ regarded as a $GL_{n}\times GL_{k}$ module. Irreducible $GL_{n}\times GL_{k}$…
Upon introducing a one-parameter quadratic deformation of the q-boson algebra and a diagonal perturbation at the end point, we arrive at a semi-infinite q-boson system with a two-parameter boundary interaction. The eigenfunctions are shown…
We introduce the random graph $\mathcal{P}(n,q)$ which results from taking the union of two paths of length $n\geq 1$, where the vertices of one of the paths have been relabelled according to a Mallows permutation with parameter $0<q(n)\leq…
We investigate the homogeneous symmetric Macdonald polynomials $P_\lambda(\X;q,t)$ for the specialization $t=q^k$. We show an identity relying the polynomials $P_\lambda(\X;q,q^k)$ and $P_\lambda(\frac{1-q}{1-q^k}\X;q,q^k)$. As a…
We give an explicit formula for an operator that sends a wreath Macdonald polynomial to the delta function at a character associated to its partition. This allows us to prove many new results for wreath Macdonald polynomials, especially…
We prove the existence of an upper bound on the asymptotic dimension of tree amalgamations of locally finite quasi-transitive connected graphs. This generalises a result of Dranishnikov for free products with amalgamation and a result of…
We consider a finite family of invertible $2 \times 2$ real matrices and a transitive Markov shift on the index set. Let $\lambda$ be the top Lyapunov exponent for random matrix products driven by the Markov shift. We prove that, if the…
We construct generic Gelfand-Tsetlin representations of the $\imath$quantum groups $U_q^{\text{tw}}(\mathfrak{so}_3)$ and $U_q^{\text{tw}}(\mathfrak{so}_4)$. These representations are infinite-dimensional analogs to the finite-dimensional…
The $SL(2,\mathbb Z)$-symmetry of Cherednik's spherical double affine Hecke algebras in Macdonald theory includes a distinguished generator which acts as a discrete time evolution of Macdonald operators, which can also be interpreted as a…
Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…
The family of q-Gaussian and q-exponential probability densities fit the statistical behavior of diverse complex self-similar non-equilibrium systems. These distributions, independently of the underlying dynamics, can rigorously be obtained…
For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is…
Quantum analogues of the homogeneous spaces $\GL(n)/\SO(n)$ and $\GL(2n)/\Sp(2n)$ are introduced. The zonal spherical functions on these quantum homogeneous spaces are represented by Macdonald's symmetric polynomials…
We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
In this paper we determine the percolation threshold for an arbitrary sequence of dense graphs $(G_n)$. Let $\lambda_n$ be the largest eigenvalue of the adjacency matrix of $G_n$, and let $G_n(p_n)$ be the random subgraph of $G_n$ obtained…