English
Related papers

Related papers: Sparse multivariate polynomial interpolation in th…

200 papers

The present work deals with the mathematical investigation of some generalizations of the Sz\'{a}sz operators. In this work, the multiple Sheffer polynomials are introduced. The generalization of Sz\'{a}sz operators involving multiple…

Classical Analysis and ODEs · Mathematics 2020-06-22 Mahvish Ali , Richard B. Paris

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…

Algebraic Geometry · Mathematics 2021-07-16 Letterio Gatto

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…

Algebraic Geometry · Mathematics 2017-02-13 Jens Hornbostel , Nicolas Perrin

Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…

Symbolic Computation · Computer Science 2025-02-26 Alexander Demin , Joris van der Hoeven

Let $k$ and $m$ be positive integers and $\lambda/\mu$ a skew partition. We compute the principal specialization of the skew Schur polynomials $s_{\lambda /\mu}(x_1, \ldots, x_{k})$ modulo $q^m-1$ under suitable conditions. We interpret the…

Combinatorics · Mathematics 2022-09-23 So-Yeon Lee , Young-Tak Oh

We introduce a new combinatorial object, semistandard increasing decomposition tableau and study its relation to a semistandard decomposition tableau introduced by Kra\'skiewicz and developed by Lam and Serrano. We also introduce…

Mathematical Physics · Physics 2017-05-19 Keiichi Shigechi

When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Joakim Uhlin

Notes from a course at the ATM Workshop on Schubert Varieties, held at The Institute of Mathematical Sciences, Chennai, in November 2017. Various expansions of Schur functions, the Lindstr\"om-Gessel-Viennot lemma, semistandard Young…

History and Overview · Mathematics 2020-06-18 Amritanshu Prasad

We present algorithms performing sparse univariate polynomial interpolation with errors in the evaluations of the polynomial. Based on the initial work by Comer, Kaltofen and Pernet [Proc. ISSAC 2012], we define the sparse polynomial…

Symbolic Computation · Computer Science 2014-06-19 Erich L. Kaltofen , Clément Pernet

We use dual equivalence to give a short, combinatorial proof that Stanley symmetric functions are Schur positive. We introduce weak dual equivalence, and use it to give a short, combinatorial proof that Schubert polynomials are key…

Combinatorics · Mathematics 2017-02-15 Sami Assaf

We propose a theory of combinatorially explicit Schubert polynomials which represent the Schubert classes in the Borel presentation of the cohomology ring of orthogonal flag varieties. We use these polynomials to describe the arithmetic…

Algebraic Geometry · Mathematics 2013-09-10 Harry Tamvakis

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…

Combinatorics · Mathematics 2019-03-28 Ricky Ini Liu , Karola Mészáros , Avery St. Dizier

There is a remarkable formula for the principal specialization of a type A Schubert polynomial as a weighted sum over reduced words. Taking appropriate limits transforms this to an identity for the backstable Schubert polynomials recently…

Combinatorics · Mathematics 2022-01-20 Eric Marberg , Brendan Pawlowski

A polynomial matrix inequality is a formula asserting that a polynomial matrix is positive semidefinite. Polynomial matrix optimization concerns minimizing the smallest eigenvalue of a symmetric polynomial matrix subject to a tuple of…

Optimization and Control · Mathematics 2025-06-06 Jared Miller , Jie Wang , Feng Guo

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

We study multiplication of any Schubert polynomial $\mathfrak{S}_w$ by a Schur polynomial $s_\lambda$ (the Schubert polynomial of a Grassmannian permutation) and the expansion of this product in the ring of Schubert polynomials. We derive…

Combinatorics · Mathematics 2014-01-03 Karola Meszaros , Greta Panova , Alexander Postnikov

This article is devoted to the computation of Jack connection coefficients, a generalization of the connection coefficients of two classical commutative subalgebras of the group algebra of the symmetric group: the class algebra and the…

Combinatorics · Mathematics 2014-09-16 Ekaterina A. Vassilieva

The Chow class of the closure of the torus orbit of a point in a Grassmannian only depends on the matroid associated to the point. The Chow class can be extended to a matroid invariant of arbitrary matroids. We call the coefficients…

Combinatorics · Mathematics 2025-04-08 Jon Pål Hamre

We give expansions of reproducing kernels of the Christoffel-Darboux type in terms of Schur polynomials. For this, we use evaluations of averages of characteristic polynomials and Schur polynomials in random matrix ensembles. We explicitly…

Mathematical Physics · Physics 2021-10-13 Leonardo Santilli , Miguel Tierz

Barvinok introduced the symmetrized determinant ($\sdet$) as a \emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over…

Computational Complexity · Computer Science 2026-05-01 Sanyam Agarwal , Markus Bläser , Mridul Gupta