Related papers: A diagrammatic approach to Kronecker squares

Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…

We present several upper and lower bounds on the Kronecker coefficients of the symmetric group. We prove $k$-stability of the Kronecker coefficients generalizing the (usual) stability, and giving a new upper bound. We prove a lower bound…

Multiway data analysis aims to uncover patterns in data structured as multi-indexed arrays, with multiway covariance playing a crucial role in many applications. However, the high dimensionality of multiway covariance presents significant…

In this paper we give a new sufficient condition for a general stability of Kronecker coefficients, which we call it additive stability. It was motivated by a recent talk of J. Stembridge at the conference in honor of Richard P. Stanley's…

Using the block vec matrix, I give a necessary and sufficient condition for factorization of a matrix into the Kronecker product of two other matrices. As a consequence, I obtain an elementary algorithmic procedure to decide whether a…

We explicate the combinatorial/geometric ingredients of Arthur's proof of the convergence and polynomiality, in a truncation parameter, of his non-invariant trace formula. Starting with a fan in a real, finite dimensional, vector space and…

We give a proof of the generalized Cauchy identity for double Grothendieck polynomials, a combinatorial interpretation of the stable double Grothendieck polynomials in terms of triples of tableaux, and an interpolation between the stable…

The polynomial ring $B$ in infinitely many indeterminates $(x_1,x_2,\ldots)$, with rational coefficients, has a vector space basis of Schur polynomials, parametrized by partitions. The goal of this note is to provide an explanation of the…

We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…

Vector-valued Jack polynomials associated to the symmetric group ${\mathfrak S}_N$ are polynomials with multiplicities in an irreducible module of ${\mathfrak S}_N$ and which are simultaneous eigenfunctions of the Cherednik-Dunkl operators…

We extend path analysis by showing that, for a singly-connected path diagram, the partial covariance of two random variables factorizes over the nodes and edges in the path between the variables. This result allows us to determine the…

Compound matrices play an important role in many fields of mathematics and have recently found new applications in systems and control theory. However, the explicit formulas for these compounds are non-trivial and not always easy to use.…

In the recent works of Brubaker-Bump-Friedberg, Bump-Nakasuji, and others, the product in the Casselman-Shalika formula is written as a sum over a crystal. The coefficient of each crystal element is defined using the data coming from the…

We prove stronger variants of a multiplier theorem of Kislyakov. The key ingredients are based on ideas of Kislaykov and the Kahane-Salem-Zygmund inequality. As a by-product we show various multiplier theorems for spaces of trigonometric…

Let $n$ be a positive integer, and let $\rho_n = (n, n-1, n-2, \ldots, 1)$ be the ``staircase'' partition of size $N = {n+1 \choose 2}$. The Saxl conjecture asserts that every irreducible representation $S^\lambda$ of the symmetric group…

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our…

We analyze the decomposition problem of multivariate polynomial-exponential functions from truncated series and present new algorithms to compute their decomposition. Using the duality between polynomials and formal power series, we first…

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

In this paper, we study staircase tableaux, a combinatorial object introduced due to its connections with the asymmetric exclusion process (ASEP) and Askey-Wilson polynomials. Due to their interesting connections, staircase tableaux have…

Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…