Related papers: Macdonald polynomials and extended Gelfand-Tsetlin…
We study the ergodic theory of a one-parameter family of interval maps T_alpha arising from generalized continued fraction algorithms. First of all, we prove the dependence of the metric entropy of T_alpha to be Hoelder-continuous in the…
We introduce a probability distribution Q on the group of permutations of the set Z of integers. Distribution Q is a natural extension of the Mallows distribution on the finite symmetric group. A one-sided infinite counterpart of Q,…
We study the nonsymmetric Macdonald polynomials specialized at infinity from various points of view. First, we define a family of modules of the Iwahori algebra whose characters are equal to the nonsymmetric Macdonald polynomials…
We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…
Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…
Gaudin algebras form a family of maximal commutative subalgebras in the tensor product of $n$ copies of the universal enveloping algebra $U(\g)$ of a semisimple Lie algebra $\g$. This family is parameterized by collections of pairwise…
Given an undirected $n$-vertex graph $G(V,E)$ and an integer $k$, let $T_k(G)$ denote the random vertex induced subgraph of $G$ generated by ordering $V$ according to a random permutation $\pi$ and including in $T_k(G)$ those vertices with…
We show that stochastic processes with linear conditional expectations and quadratic conditional variances are Markov, and their transition probabilities are related to a three-parameter family of orthogonal polynomials which generalize the…
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…
We introduce a conjectural construction for an extension to superspace of the Macdonald polynomials. The construction, which depends on certain orthogonality and triangularity relations, is tested for high degrees. We conjecture a simple…
We prove pairwise disjointness of representations T_{z,w} of the infinite-dimensional unitary group. These representations provide a natural generalization of the regular representation for the case of "big" group U(\infty). They were…
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
We describe some recently discovered connections between one-dimensional interacting particle models and Macdonald polynomials. The first such model is the multispecies asymmetric simple exclusion process (ASEP) on a ring, linked to the…
We will introduce the notion of inductive limits of compact quantum groups as $W^*$-bialgebras equipped with some additional structures. We also formulate their unitary representation theories. Those give a more explicit…
The super-Macdonald polynomials, introduced by Sergeev and Veselov, generalise the Macdonald polynomials to (arbitrary numbers of) two kinds of variables, and they are eigenfunctions of the deformed Macdonald-Ruijsenaars operators…
Rosengren and Schlosser introduced notions of ${\it R}_N$-theta functions for the seven types of irreducible reduced affine root systems, ${\it R}_N={\it A}_{N-1}$, ${\it B}_{N}$, ${\it B}^{\vee}_N$, ${\it C}_{N}$, ${\it C}^{\vee}_N$, ${\it…
We establish a central limit theorem for the sum of $\epsilon$-independent random variables, extending both the classical and free probability setting. Central to our approach is the use of graphon limits to characterize the limiting…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
We extend our previous study of Markov chains on finite commutative rings (arXiv:1605.05089) to arbitrary finite rings with identity. At each step, we either add or multiply by a randomly chosen element of the ring, where the addition…
In this note we give a short proof of Cherednik's generalization of Macdonald-Mehta identities for the root system $A_{n-1}$ using the representation theory of quantum groups. These identities, suggested and proved by Cherednik, give an…