English
Related papers

Related papers: Upper Bounds of Schubert Polynomials

200 papers

We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…

Combinatorics · Mathematics 2014-02-07 Avinash J. Dalal , Jennifer Morse

A complex number $\alpha$ is said to satisfy the height reducing property if there is a finite set $F\subset \mathbb{Z}$ such that $\mathbb{Z}[\alpha]=F[\alpha]$, where $\mathbb{Z}$ is the ring of the rational integers. It is easy to see…

Number Theory · Mathematics 2015-01-23 Shigeki Akiyama , Jörg M. Thuswaldner , Toufik Zaïmi

A non-empty word $w$ is a \emph{border} of a word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ is \emph{privileged} if $\vert u\vert\leq 1$ or if $u$ has a privileged border $w$ that appears…

Combinatorics · Mathematics 2022-09-13 Josef Rukavicka

We give upper bounds on the size of the gap between the constant term and the next non-zero Fourier coefficient of an entire modular form of given weight for \Gamma_0(2). Numerical evidence indicates that a sharper bound holds for the…

Number Theory · Mathematics 2007-05-23 Barry Brent

It has been shown that the Cartan subalgebra of $W_{\infty}$- algebra is the space of the two-variable, definite-parity polynomials. Explicit expressions of these polynomials, and their basic properties are presented. Also has been shown…

Quantum Physics · Physics 2009-10-30 A. Verçin

We consider equation systems of the form X_1 = f_1(X_1, ..., X_n), ..., X_n = f_n(X_1, ..., X_n) where f_1, ..., f_n are polynomials with positive real coefficients. In vector form we denote such an equation system by X = f(X) and call f a…

Numerical Analysis · Computer Science 2010-03-17 Javier Esparza , Stefan Kiefer , Michael Luttenberger

The Birkhoff graph $\mathcal{B}_n$ is the Cayley graph of the symmetric group $S_n$, where two permutations are adjacent if they differ by a single cycle. Our main result is a tighter upper bound on the independence number…

Combinatorics · Mathematics 2020-10-13 Leonardo Nagami Coregliano , Fernando Granha Jeronimo

In this paper we provide asymptotic upper bounds on the complexity in two (closely related) situations. We confirm for the total doubling coverings and not only for the chains the expected bounds of the form $$ \kappa({\mathcal U}) \le…

Classical Analysis and ODEs · Mathematics 2019-03-12 Raf Cluckers , Omer Friedland , Yosef Yomdin

We show how certain non-perturbative superpotentials W, which are the two-dimensional analogs of the Seiberg-Witten prepotential in 4d, can be computed via geometric engineering from 4-folds. We analyze an explicit example for which the…

High Energy Physics - Theory · Physics 2009-10-30 Wolfgang Lerche

For any large prime $q$, $x \leq 1$ and any real $k\geq 2$, we prove a lower bound for the following $2k$-th moment \begin{equation*} \sum_{\substack{\chi \in X_q^*}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k}, \end{equation*} where…

Number Theory · Mathematics 2025-11-05 Peng Gao , Liangyi Zhao

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…

Number Theory · Mathematics 2024-09-05 Philipp Habegger , Alina Ostafe , Igor E. Shparlinski

Given a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$, we say an index $i$ is a peak if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $P(\pi)$ denote the set of peaks of $\pi$. Given any set $S$ of positive integers, define…

Combinatorics · Mathematics 2024-06-05 Sara Billey , Matthew Fahrbach , Alan Talmage

We clarify the notion of the DS --- generalized Drinfeld-Sokolov --- reduction approach to classical ${\cal W}$-algebras. We first strengthen an earlier theorem which showed that an $sl(2)$ embedding ${\cal S}\subset {\cal G}$ can be…

High Energy Physics - Theory · Physics 2009-10-22 L. Feher , L. O'Raifeartaigh , P. Ruelle , I. Tsutsui

In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…

Combinatorics · Mathematics 2010-01-01 Elad Haramaty , Amir Shpilka

An $(r, s)$-formation is a concatenation of $s$ permutations of $r$ letters. If $u$ is a sequence with $r$ distinct letters, then let $\mathit{Ex}(u, n)$ be the maximum length of any $r$-sparse sequence with $n$ distinct letters which has…

Discrete Mathematics · Computer Science 2014-11-14 J. T. Geneson , Rohil Prasad , Jonathan Tidor

Originally, the SW-equations discovered by Seiberg-Witten are 1st-order PDE, which solutions (A,\phi), with \phi\ne 0, are known as SW-monopoles. It is known that the solutions of these 1st-order eq correspond to the minimum of…

Mathematical Physics · Physics 2016-09-07 Celso M. Doria

Schubert varieties in finite dimensional flag manifolds G/P are a well-studied family of projective varieties indexed by elements of the corresponding Weyl group W. In particular, there are many tests for smoothness and rational smoothness…

Combinatorics · Mathematics 2010-09-01 Sara Billey , Andrew Crites

For a given class of structured matrices $\mathbb S$, we find necessary and sufficient conditions on vectors $x,w\in \C^{n+m}$ and $y,z \in \C^{n}$ for which there exists $\Delta=[\Delta_1~\Delta_2]$ with $\Delta_1 \in \mathbb S$ and…

Optimization and Control · Mathematics 2022-08-29 Mohit Kumar Baghel , Punit Sharma

We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given $E\subset \mathbb…

Combinatorics · Mathematics 2015-08-12 David Covert , Steven Senger