Related papers: (-1)-Enumerations of arrowed Gelfand-Tsetlin patte…
The classical Gelfand-Tsetlin formulas provide a basis in terms of tableaux and an explicit action of the generators of $\mathfrak{gl} (n)$ for every irreducible finite-dimensional $\mathfrak{gl} (n)$-module. These formulas can be used to…
We study the statistical distribution of primitive sublattices in the space of lattices $\mathrm{SL}(n,\mathbb Z)\backslash\mathrm{SL}(n,\mathbb R)$. A central difficulty in this area is that the second moment of the counting function for…
The Gelfand-Tsetlin graph is an infinite graded graph that encodes branching of irreducible characters of the unitary groups. The boundary of the Gelfand-Tsetlin graph has at least three incarnations --- as a discrete potential theory…
The alternating-runs polynomial enumerates alternating runs in the symmetric group. There are three formulae for the number of permutations, $R_{n,k}$ in $\mathfrak{S}_n$ with $k$ alternating runs, but all of them are complicated. We show…
Mills, Robbins, and Rumsey conjectured, and Zeilberger proved, that the number of alternating sign matrices of order $n$ equals $A(n):={{1!4!7! ... (3n-2)!} \over {n!(n+1)! ... (2n-1)!}}$. Mills, Robbins, and Rumsey also made the stronger…
The Regression Tsetlin Machine (RTM) addresses the lack of interpretability impeding state-of-the-art nonlinear regression models. It does this by using conjunctive clauses in propositional logic to capture the underlying non-linear…
The approximation of a multiple isolated root is a difficult problem. In fact the root can even be a repulsive root for a fixed point method like the Newton method. However there exists a huge literature on this topic but the answers given…
MacMahon's theorem on plane partitions yields a simple product formula for tiling number of a hexagon, and Cohn, Larsen and Propp's theorem provides an explicit enumeration for tilings of a dented semihexagon via semi-strict…
This article studies some new insertion algorithms that associate pairs of shifted tableaux to finite integer sequences in which certain terms may be primed. When primes are ignored in the input word these algorithms reduce to known…
In this paper, we give a more down-to-earth introduction to the connection between Gelfand-Tsetlin modules over $\mathfrak{gl}_n$ and diagrammatic KLRW algebras, and develop some of its consequences. In addition to a new proof of this…
For the OEIS sequence A001711, contributed by N. J. A. Sloane long before the on-line era and identified there as the diagonal $T(n+4, 4)$ of a generalized-Stirling triangle, R. J. Mathar contributed in February 2020 the conjectured order-2…
Using analytic number theory techniques, Altu\u{g} showed that the contribution of the trivial representation to the Arthur-Selberg trace formula for GL(2) over $\Q$ could be cancelled by applying a modified Poisson summation formula to the…
The refined enumeration of alternating sign matrices (ASMs) of given order having prescribed behavior near one or more of their boundary edges has been the subject of extensive study, starting with the Refined Alternating Sign Matrix…
The purpose of these notes is to introduce some of the problems the enumeration of lattice walks is dedicated to and familiarize with some of the arguments they can be addressed with. We discuss the enumeration of lattice walks, their…
We introduce Macdonald characters and use algebraic properties of Macdonald polynomials to study them. As a result, we produce several formulas for Macdonald characters, which are generalizations of those obtained by Gorin and Panova in…
The paper presents a construction of finite-dimensional irreducible representations of the Lie algebra $\mathfrak{g}_2$. The representation space is constructed as the space of solutions to a certain system of partial differential equations…
We propose a new effective method of constructing explicitly Gelfand -Tsetlin modules for $\mathfrak{gl}_n$. We obtain a large family of simple modules that have a basis consisting of Gelfand-Tsetlin tableaux, the action of the Lie algebra…
The Gelfand representation of $\mathcal{S}_n$ is the multiplicity-free direct sum of the irreducible representations of $\mathcal{S}_n$. In this paper, we use a result of Adin, Postnikov, and Roichman to find a recursive generating function…
We construct elliptic extensions of the alpha-parameter rook model introduced by Goldman and Haglund and of the rook model for matchings of Haglund and Remmel. In particular, we extend the product formulas of these models to the elliptic…
The enumeration of diagonally symmetric alternating sign matrices (DSASMs) is studied, and a Pfaffian formula is obtained for the number of DSASMs of any fixed size, where the entries for the Pfaffian are positive integers given by simple…