Related papers: Slide multiplicity free key polynomials
To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…
In this paper, we study rigidity of polynomials of arbitrary degree in the presence of neutral dynamics. Specifically, we focus on {non-renormalizable} (in the sense of Douady and Hubbard) complex polynomials of degree $d \geqslant 2$ that…
We show that the principal specialization of the Schubert polynomial at $w$ is bounded below by $1+p_{132}(w)+p_{1432}(w)$ where $p_u(w)$ is the number of occurrences of the pattern $u$ in $w$, strengthening a previous result by A.…
We introduce the quasi-key basis of the polynomial ring. We prove this basis contains the quasi-Schur polynomials of of Haglund, Luoto, Mason and van Willigenburg and that stable limits of quasi-key polynomials are quasi-Schur functions,…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
In this paper we provide a complete answer to a question by Heyman and Shparlinski concerning the natural density of polynomials which are irreducible by Eisenstein's criterion after applying some shift. The main tool we use is a local to…
We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…
In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full…
We define skew Schubert polynomials to be normal form (polynomial) representatives of certain classes in the cohomology of a flag manifold. We show that this definition extends a recent construction of Schubert polynomials due to Bergeron…
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…
We study a family of polynomials whose values express degrees of Schubert varieties in the generalized complex flag manifold G/B. The polynomials are given by weighted sums over saturated chains in the Bruhat order. We derive several…
We investigate Fourier multipliers with smooth symbols defined over locally compact Hausdorff groups. Our main results in this paper establish new H\"ormander-Mikhlin criteria for spectral and non-spectral multipliers. The key novelties…
Multi-Schur functions are symmetric functions that generalize the supersymmetric Schur functions, the flagged Schur functions, and the refined dual Grothendieck functions, which have been intensively studied by Lascoux. In this paper, we…
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…
We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…
We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…
The idea of using polynomial methods to improve simple smoother iterations within a multigrid method for a symmetric positive definite (SPD) system is revisited. When the single-step smoother itself corresponds to an SPD operator, there is…
For distinct unitary cuspidal automorphic representations $\pi_1$ and $\pi_2$ for $\mathrm{GL}(2)$ over a number field $F$ and any $\alpha\in\Bbb{R}$, let $\mathcal{S}_{\alpha}$ be the set of primes $v$ of $F$ for which…
The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…