Related papers: An insertion algorithm for multiplying Demazure ch…
A classical result of Schubert calculus is an inductive description of Schubert cycles using divided difference (or push-pull) operators in Chow rings. We define convex geometric analogs of push-pull operators and describe their…
We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…
We exhibit a probabilistic symbolic algorithm for solving zero-dimensional sparse systems. Our algorithm combines a symbolic homotopy procedure, based on a flat deformation of a certain morphism of affine varieties, with the polyhedral…
One definition of key polynomials is as the weight generating functions of key tableaux. Assaf and Schilling introduced a crystal structure on key tableaux and related it to Morse--Schilling crystals on reduced factorizations for…
We study the factorization of Schubert polynomials into elementary symmetric polynomials. We conjecture that this occurs when the permutation corresponding to the Schubert polynomial does not contain the patterns $1432$, $1423$, $4132$, and…
We introduce an algebraic model, based on the determinantal expansion of the product of two matrices, to test combinatorial reductions of set functions. Each term of the determinantal expansion is deformed through a monomial factor in d…
Motivated by our recent work relating canonical bases to combinatorics of Garsia-Procesi modules \cite{B}, we give an insertion algorithm that computes the catabolizability of the insertion tableau of a standard word. This allows us to…
Gelfand-Tsetlin polytopes are classical objects in algebraic combinatorics arising in the representation theory of $\mathfrak{gl}_n(\mathbb{C})$. The integer point transform of the Gelfand-Tsetlin polytope $\mathrm{GT}(\lambda)$ projects to…
The numbers $f_\lambda$ of standard tableaux of shape $\lambda\vdash n$ satisfy 2 fundamental recursions: $f_\lambda = \sum f_{\lambda^-}$ and $(n + 1)f_\lambda=\sum f_{\lambda^+}$, where $\lambda^-$ and $\lambda^+$ run over all shapes…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
Rota-Baxter operators present a natural generalisation of integration by parts formula for the integral operator. In 2015, Zheng, Guo, and Rosenkranz conjectured that every injective Rota-Baxter operator of weight zero on the polynomial…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
We present simplified formulae for the analytic integration of the Newton potential of polynomials over boxes in two- and three-dimensional space. These are implemented in an easy-to-use C++ library that allows computations in arbitrary…
Average of exponential ${\rm Tr}_R e^X$, i.e. of a group rather than an algebra character, in Gaussian matrix model is known to be an amusing generalization of Schur polynomial, where time variables are substituted by traces of products of…
In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…
With the aid of Hensel Lemma, we refine the 2-adic Newton polygon algorithm proposed by Magron, Koprowski, and Vaccon at ISSAC 2023 to express computationally a given positive univariate polynomial with rational coefficients as a sum of…
We study correlation functions of the characteristic polynomials in coupled matrix models based on the Schur polynomial expansion, which manifests their determinantal structure.
This paper proves a combinatorial rule expressing the product $s_\tau(s_{\lambda/\mu} \circ p_r)$ of a Schur function and the plethysm of a skew Schur function with a power sum symmetric function as an integral linear combination of Schur…
We present a new sum rule for Clebsch-Gordan coefficients using generalized characters of irreducible representations of the rotation group. The identity is obtained from an integral involving Gegenbauer ultraspherical polynomials. A…
This paper has two primary contributions. First, we explore degenerate Sheffer-type polynomials, a hybrid of higher-order degenerate Bernoulli and Euler polynomials, and derive their properties. Second, assuming that the moment generating…