English
Related papers

Related papers: Upper Bounds of Schubert Polynomials

200 papers

The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to…

Information Theory · Computer Science 2010-09-21 Christine Bachoc , Venkat Chandar , Gerard Cohen , Patrick Sole , Aslan Tchamkerten

We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…

Combinatorics · Mathematics 2011-04-21 Nati Linial , Doron Puder

We prove a sharp lower bound on the number of terms in an element of the reduced Gr\"obner basis of a Schubert determinantal ideal $I_w$ under the term order of [Knutson-Miller '05]. We give three applications. First, we give a…

Commutative Algebra · Mathematics 2023-06-06 Ada Stelzer

We study the differential uniformity of the Wan-Lidl polynomials over finite fields. A general upper bound, independent of the order of the field, is established. Additional bounds are established in settings where one of the parameters is…

Number Theory · Mathematics 2022-11-10 Li-An Chen , Robert S. Coulter

Let $\Omega \subset \mathbb{R}^n$ be a bounded domain satisfying a Hayman-type asymmetry condition, and let $ D $ be an arbitrary bounded domain referred to as "obstacle". We are interested in the behaviour of the first Dirichlet eigenvalue…

Analysis of PDEs · Mathematics 2017-06-08 Bogdan Georgiev , Mayukh Mukherjee

We continue our study of the Widom factors for $L_p(\mu)$ extremal polynomials initiated in [4]. In this work we characterize sets for which the lower bounds obtained in [4] are saturated, establish continuity of the Widom factors with…

Classical Analysis and ODEs · Mathematics 2020-05-20 Gökalp Alpan , Maxim Zinchenko

We introduce an S.o.S hierarchy of lower bounds for a polynomial optimization problem whose constraint is expressed as a matrix polynomial semidefinite inequality. Our approach involves utilizing a penalty function framework to directly…

Optimization and Control · Mathematics 2025-10-20 Hoang Anh Tran , Kim-Chuan Toh

Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…

Data Structures and Algorithms · Computer Science 2015-03-19 Anand Louis , Prasad Raghavendra , Prasad Tetali , Santosh Vempala

The orbits of the orthogonal and symplectic groups on the flag variety are in bijection, respectively, with the involutions and fixed-point-free involutions in the symmetric group $S_n$. Wyser and Yong have described polynomial…

Combinatorics · Mathematics 2018-08-29 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

Montanari and Richard (2015) asked whether a natural semidefinite programming (SDP) relaxation can effectively optimize $\mathbf{x}^{\top}\mathbf{W} \mathbf{x}$ over $\|\mathbf{x}\| = 1$ with $x_i \geq 0$ for all coordinates $i$, where…

Data Structures and Algorithms · Computer Science 2020-12-07 Afonso S. Bandeira , Dmitriy Kunisky , Alexander S. Wein

We prove upper and lower bounds for all the coefficients in the Hilbert Polynomial of a graded Gorenstein algebra $S=R/I$ with a quasi-pure resolution over $R$. The bounds are in terms of the minimal and the maximal shifts in the resolution…

Commutative Algebra · Mathematics 2012-02-08 Sabine El Khoury , Hema Srinivasan

We give a new formula for double Grothendieck polynomials based on Magyar's orthodontia algorithm for diagrams. Our formula implies a similar formula for double Schubert polynomials $\mathfrak S_w(\mathbf x;\mathbf y)$. We also prove a…

Combinatorics · Mathematics 2024-10-11 Linus Setiabrata , Avery St. Dizier

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

Combinatorics · Mathematics 2025-08-08 Vesa Kaarnioja , André-Alexander Zepernick

We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…

Classical Analysis and ODEs · Mathematics 2023-10-30 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

Given a finite word $w$, Guibas and Odlyzko (J. Combin. Theory Ser. A, 30, 1981, 183-208) showed that the autocorrelation polynomial $\phi_w(t)$ of $w$, which records the set of self-overlaps of $w$, explicitly determines for each $n$, the…

Dynamical Systems · Mathematics 2025-11-04 Nishant Chandgotia , Brian Marcus , Jacob Richey , Chengyu Wu

We establish a version of the Pommerenke-Levin-Yoccoz inequality for the modulus of a polynomial-like restriction of a global polynomial and give two applications. First it is shown that if the modulus of a polynomial-like restriction of an…

Dynamical Systems · Mathematics 2022-02-08 Alexander Blokh , Lex Oversteegen , Vladlen Timorin

A well-known result of Stanley from 1980 implies that the weak order on a maximal parabolic quotient of the symmetric group $S_n$ has the Sperner property; this same property was recently established for the weak order on all of $S_n$ by…

Combinatorics · Mathematics 2021-11-12 Christian Gaetz , Katherine Tung

The Schubert varieties on a flag manifold G/P give rise to a cell decomposition on G/P whose Kronecker duals, known as the Schubert classes on G/P, form an additive base of the integral cohomology of G/P. The Schubert's problem of…

Algebraic Topology · Mathematics 2020-11-02 Haibao Duan , Xuezhi Zhao

For a set of permutations (patterns) $\Pi$ in $S_k$, consider the set of all permutations in $S_n$ that avoid all patterns in $\Pi$. An important problem in current algebraic combinatorics is to find pattern sets $\Pi$ such that the…

Combinatorics · Mathematics 2022-10-24 Avichai Marmor

We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…

Algebraic Geometry · Mathematics 2017-05-01 Saugata Basu , Cordian Riener