Related papers: An insertion algorithm for multiplying Demazure ch…
We prove a previously conjectured closed form formula for the norm of the Jack polynomials in superspace with respect to a certain scalar product. The proof is mainly combinatorial and relies on the explicit expression in terms of…
We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…
Schur superpolynomials have been introduced recently as limiting cases of the Macdonald superpolynomials. It turns out that there are two natural super-extensions of the Schur polynomials: in the limit $q=t=0$ and $q=t\rightarrow\infty$,…
A prism tableau is a set of reverse semistandard tableaux, each positioned within an ambient grid. Prism tableaux were introduced to provide a formula for the Schubert polynomials of A. Lascoux and M.P. Sch\"utzenberger. This formula…
We consider an arbitrary deformation of the Gaussian matrix model parameterized by Miwa variables $z_a$. One can look at it as a mixture of the Gaussian and logarithmic (Selberg) potentials, which are both superintegrable. The mixture is…
We consider the Schur-positivity of monomial immanants of Jacobi-Trudi matrices, in particular whether a non-negative coefficient of the trivial Schur function implies non-negative coefficients for other Schur functions in said immanants.…
We introduce degenerate Hermite polynomials as a degenerate version of the ordinary Hermite polynomials. Then, among other things, by using the formula about representing one lambda-Sheffer polynomial in terms of other lambda-Sheffer…
This is the first of three papers that develop structures which are counted by a "parabolic" generalization of Catalan numbers. Fix a subset R of {1,..,n-1}. Consider the ordered partitions of {1,..,n} whose block sizes are determined by R.…
In this article we will introduce the way to extend the mitosis algorithm for Schubert polynomials, developed by Ezra Miller, to the case of Grothendieck polynomials.
In this paper, we introduce a novel approach to solve the many-body Schrodinger equation by the tensor neural network. Based on the tensor product structure, we can do the direct numerical integration by using fixed quadrature points for…
Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the…
We provide several ingredients towards a generalization of the Littlewood-Richardson rule from Chow groups to algebraic cobordism. In particular, we prove a simple product-formula for multiplying classes of smooth Schubert varieties with…
The variety of complete quadrics is the wonderful compactification of $GL_n/O_n$ and admits a cell decomposition into Borel orbits indexed by combinatorial objects called $\mu$-involutions. We study Coxeter-theoretic properties of…
We show how the threshold level of affine fusion, the fusion of Wess-Zumino-Witten (WZW) conformal field theories, fits into the Schubert calculus introduced by Gepner. The Pieri rule can be modified in a simple way to include the threshold…
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…
The aim of this paper is to represent any polynomial in terms of the degenerate Frobenius-Euler polynomials and more generally of the higher-order degenerate Frobenius-Euler polynomials. We derive explicit formulas with the help of umbral…
Recently we explained that the classical $Q$ Schur functions stand behind various well-known properties of the cubic Kontsevich model, and the next step is to ask what happens in this approach to the generalized Kontsevich model (GKM) with…
The two tableaux assigned by the Robinson--Schensted correspondence are equal if and only if the input permutation is an involution, so the RS algorithm restricts to a bijection between involutions in the symmetric group and standard…
We present a conjecture generalizing the Cauchy formula for Macdonald polynomials. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a Riemann surface of genus g to…
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…