Related papers: Combinatorial Structures in Random Matrix Theory P…

Recently, we have established and used the generalized Littlewood theorem concerning contour integrals of the logarithm of analytical function to obtain a few new criteria equivalent to the Riemann hypothesis. Here, the same theorem is…

We prove precise conditional estimates for the third moment of the logarithm of the Riemann zeta function, refining what is implied by the Selberg central limit theorem, both for the real and imaginary parts. These estimates match…

The identities which are in the literature often called ``bounded Littlewood identities" are determinantal formulas for the sum of Schur functions indexed by partitions with bounded height. They have interesting combinatorial consequences…

It is well-known that Leonard pairs have a close connection with bispectral orthogonal polynomials of the Askey scheme. In this paper, we introduce the notion of a Leonard trio $(V,\oV,Z)$, an algebraic structure extending Leonard pairs,…

The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…

We develop structural insights into the Littlewood-Richardson graph, whose number of vertices equals the Littlewood-Richardson coefficient c({\lambda},{\mu},{\nu}) for given partitions {\lambda}, {\mu}, and {\nu}. This graph was first…

The $\mathcal{A}$-tracial algebras are algebras endowed with multi-linear forms, compatible with the product, and indexed by partitions. Using the notion of $\mathcal{A}$-cumulants, we define and study the $\mathcal{A}$-freeness property…

We give a proof of the existence of Asai, exterior square, and symmetric square local $L$-functions, $\gamma$-factors and root numbers in characteristic $p$, including the case of $p = 2$. Our study is made possible by developing the…

In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…

We introduce new methods from p-adic integration into the study of representation zeta functions associated to compact p-adic analytic groups and arithmetic groups. They allow us to establish that the representation zeta functions of…

Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In…

We suggest an hierarchy of all the results known so far about the connection of the asymptotics of combinatorial or representation theoretic problems with ``beta=2 ensembles'' arising in the random matrix theory. We show that all such…

A representation-theoretic approach to special functions was developed in the 40-s and 50-s in the works of I.M.Gelfand, M.A.Naimark, N.Ya.Vilenkin, and their collaborators. The essence of this approach is the fact that most classical…

We develop a calculus based on graph enumeration for $S_n$-equivariant motivic invariants of graphically stratified moduli spaces. We apply our theory to the Deligne--Mumford moduli space $\overline{\mathcal{M}}_{g, n}$ and to the space of…

The inner plethysm of symmetric functions corresponds to the $\lambda$-ring operations of the representation ring $R({\mathfrak S}_n)$ of the symmetric group. It is known since the work of Littlewood that this operation possesses stability…

In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…

Hybrid Euler-Hadamard products have previously been studied for the Riemann zeta function on its critical line and for Dirichlet L-functions in the context of the calculation of moments and connections with Random Matrix Theory. According…

We determine the special values at positive integers of the spectral zeta function associated with the combinatorial Laplacian on the regular tree. These values admit explicit formulas in terms of certain polynomials, which we show to be…

This paper presents novel algorithms which exploit the intrinsic algebraic and combinatorial structure of the matrix completion task for estimating missing en- tries in the general low rank setting. For positive data, we achieve results…

In [19] it was explained how one can naturally associate a Deitmar scheme (which is a scheme defined over the field with one element, $\mathbb{F}_1$) to a so-called "loose graph" (which is a generalization of a graph). Several properties of…