English
Related papers

Related papers: Upper Bounds of Schubert Polynomials

200 papers

Let $\mathcal{S}=\{1^2,2^2,3^2,...\}$ be the set of squares and $\mathcal{W}=\{w_n\}_{n=1}^{\infty} \subset \mathbb{N}$ be an additive complement of $\mathcal{S}$ so that $\mathcal{S} + \mathcal{W} \supset \{n \in \mathbb{N}: n \geq N_0\}$…

Number Theory · Mathematics 2023-04-06 Yuchen Ding , Yu-Chen Sun , Li-Yuan Wang , Yutong Xia

We prove inequalities that compare the size of an S-regulator with a product of heights of multiplicatively independent S-units. Our upper bound for the S-regulator follows from a general upper bound for the determinant of a real matrix…

Number Theory · Mathematics 2016-01-05 Shabnam Akhtari , Jeffrey D. Vaaler

Every word has a shape determined by its image under the Robinson-Schensted-Knuth correspondence. We show that when a word w contains a separable (i.e., 3142- and 2413-avoiding) permutation \sigma\ as a pattern, the shape of w contains the…

Combinatorics · Mathematics 2011-09-06 Andrew Crites , Greta Panova , Gregory S. Warrington

A \emph{square} is a word of the form $uu$, where $u$ is a nonempty finite word. Given a finite word $w$ of length $n$, let $[w]$ denote the corresponding \emph{circular word}, i.e., the set of all cyclic rotations of $w$. We study the…

Combinatorics · Mathematics 2026-05-13 Shuo Li , Yuan Song

Let $W$ be an affine Weyl group, and let $\Bbbk$ be a field of characteristic $p>0$. The diagrammatic Hecke category $\mathcal{D}$ for $W$ over $\Bbbk$ is a categorification of the Hecke algebra for $W$ with rich connections to modular…

Representation Theory · Mathematics 2025-02-10 Amit Hazi

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-09-18 Alexei Entin

Treewidth (tw) is an important parameter that, when bounded, yields tractability for many problems. For example, graph problems expressible in Monadic Second Order (MSO) logic and QUANTIFIED SAT or, more generally, QUANTIFIED CSP, are FPT…

Computational Complexity · Computer Science 2025-03-18 Florent Foucaud , Esther Galby , Liana Khazaliya , Shaohua Li , Fionn Mc Inerney , Roohani Sharma , Prafullkumar Tale

We constrain the spectrum of two-dimensional unitary, compact conformal field theories with central charge c > 1 using modular bootstrap. Upper bounds on the gap in the dimension of primary operators of any spin, as well as in the dimension…

High Energy Physics - Theory · Physics 2016-08-23 Scott Collier , Ying-Hsuan Lin , Xi Yin

We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…

Algebraic Geometry · Mathematics 2024-09-04 Boulos El Hilany , Sébastien Tavenas

We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly…

Combinatorics · Mathematics 2014-12-24 Mamadou Moustapha Kanté , O-joung Kwon

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

Number Theory · Mathematics 2016-05-03 Aleksandr Tuxanidy , Qiang Wang

For each permutation $w$, we can construct a collection of hyperplanes $\mathcal{A}_w$ according to the inversions of $w$, which is called the inversion hyperplane arrangement associated to $w$. It was conjectured by Postnikov and confirmed…

Combinatorics · Mathematics 2020-06-16 Neil J. Y. Fan

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

Computational Complexity · Computer Science 2013-02-15 Mrinal Kumar , Gaurav Maheshwari , Jayalal Sarma M. N

The main aim of this paper is to prove that the maximal operator $\sigma_{p}^{\kappa ,\ast }f:=\sup_{n\in \mathbf{P}}\left\vert \sigma_{n}^{\kappa }f\right\vert /\left( n+1\right) ^{1/p-2}$ is bounded from the Hardy space $% H_{p}$ to the…

Classical Analysis and ODEs · Mathematics 2014-10-27 George Tephnadze

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

Algebraic Geometry · Mathematics 2024-11-27 Daoji Huang , Matt Larson

To a Seifert matrix of a knot K one can associate a matrix w(K) with entries in the rational function field, Q(t). The Murasugi, Milnor, and Levine-Tristram knot signatures, all of which provide bounds on the 4-genus of a knot, are…

Geometric Topology · Mathematics 2013-10-29 Charles Livingston

We give a new lower bound for the first gap $\lambda_2 - \lambda_1$ of the Dirichlet eigenvalues of the Schr{\"o}dinger operator on a bounded convex domain $\Omega$ in R$^n$ or S$^n$ and greatly sharpens the previous estimates. The new…

Differential Geometry · Mathematics 2007-05-23 Jun Ling

We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we…

Combinatorics · Mathematics 2014-04-30 Nicolas Bonifas , Marco Di Summa , Friedrich Eisenbrand , Nicolai Hähnle , Martin Niemeier

Given a word $w(x_{1},\ldots,x_{r})$, i.e., an element in the free group on $r$ elements, and an integer $d\geq1$, we study the characteristic polynomial of the random matrix $w(X_{1},\ldots,X_{r})$, where $X_{i}$ are Haar-random…

Probability · Mathematics 2025-07-30 Nir Avni , Itay Glazer

In this paper, we provide a simple criterion for the Schubitope $\mathcal{S}_{D}$ associated to a diagram $D$ to be lattice-free. We further show that $\mathcal{S}_{D}$ is lattice-free if and only if its Ehrhart polynomial is equal to the…

Combinatorics · Mathematics 2026-05-12 Jinren Dou , Neil J. Y. Fan , Kunwen Liu