English
Related papers

Related papers: Upper Bounds of Schubert Polynomials

200 papers

Baader, J\"org, and Parlier recently established an upper bound for the crossing number of curve systems of size $m\asymp g^{1+\alpha}$ on a genus $g$ surface, obtaining a leading coefficient of $9/4=2.25$. Their construction relies on…

Geometric Topology · Mathematics 2026-02-03 Hyungryul Baik

A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called rich if every finite factor of $w$ is rich. Let $w$ be a word…

Combinatorics · Mathematics 2021-01-21 Josef Rukavicka

For any $n$-by-$n$ matrix $A$ of the form \[[\begin{array}{cccc} 0 & A_1 & & \\ & 0 & \ddots & \\ & & \ddots & A_{k-1} \\ & & & 0\end{array}],\] we consider two $k$-by-$k$ matrices \[A'=[\begin{array}{cccc} 0 & \|A_1\| & & \\ & 0 & \ddots &…

Functional Analysis · Mathematics 2014-10-02 Hwa-Long Gau , Pei Yuan Wu

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

Computational Complexity · Computer Science 2020-11-06 Mrinal Kumar , Ben Lee Volk

For a normalized root system $R$ in $\mathbb R^N$ and a multiplicity function $k\geq 0$ let $\mathbf N=N+\sum_{\alpha \in R} k(\alpha)$. We denote by $dw(\mathbf{x})=\Pi_{\alpha \in R}|\langle \mathbf{x},\alpha…

Classical Analysis and ODEs · Mathematics 2020-04-22 Agnieszka Hejna

The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…

Algebraic Geometry · Mathematics 2007-05-23 Alexey Glutsyuk

We prove bounds on intersections of algebraic varieties in $\mathbb{C}^4$ with Cartesian products of finite sets from $\mathbb{C}^2$, and we point out connections with several classic theorems from combinatorial geometry. Consider an…

Combinatorics · Mathematics 2017-12-21 Hossein Nassajian Mojarrad , Thang Pham , Claudiu Valculescu , Frank de Zeeuw

Two permutations $(x_1,\dots,x_w)$ and $(y_1,\dots,y_w)$ are weakly similar if $x_i<x_{i+1}$ if and only if $y_i<y_{i+1}$ for all $1\leqslant i \leqslant w$. Let $\pi$ be a permutation of the set $[n]=\{1,2,\dots, n\}$ and let $wt(\pi)$…

Combinatorics · Mathematics 2020-12-22 Andrzej Dudek , Jarosław Grytczuk , Andrzej Ruciński

Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called {\em Sylvester waves}) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…

Number Theory · Mathematics 2007-05-23 Boris Y. Rubinstein , Leonid G. Fel

The aim of this paper is to study the matrix discrepancy problem. Assume that $\xi_1,\ldots,\xi_n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be…

Combinatorics · Mathematics 2021-05-25 Jiaxin Xie , Zhiqiang Xu , Ziheng Zhu

We prove the Fundamental Gap Conjecture, which states that the difference between the first two Dirichlet eigenvalues (the spectral gap) of a Schr\"odinger operator with convex potential and Dirichlet boundary data on a convex domain is…

Spectral Theory · Mathematics 2011-01-12 Ben Andrews , Julie Clutterbuck

Given positive integers m,n,s,t, let z(m,n,s,t) be the maximum number of ones in a (0,1) matrix of size m-by-n that does not contain an all ones submatrix of size s-by-t. We find a flexible upper bound on z(m,n,s,t) that implies the known…

Combinatorics · Mathematics 2009-04-01 Vladimir Nikiforov

For a finite Lie algebra $G_N$ of rank N, the Weyl orbits $W(\Lambda^{++})$ of strictly dominant weights $\Lambda^{++}$ contain $dimW(G_N)$ number of weights where $dimW(G_N)$ is the dimension of its Weyl group $W(G_N)$. For any…

Mathematical Physics · Physics 2008-11-26 Hasan R. Karadayi , Meltem Gungormez

Let $\mathfrak{g}$ be a simple finite dimensional complex Lie algebra and let $\widehat{\mathfrak{g}}$ be the corresponding affine Lie algebra. Kac and Wakimoto observed that in some cases the coefficients in the character formula for a…

Representation Theory · Mathematics 2024-03-28 Roman Bezrukavnikov , Victor Kac , Vasily Krylov

While Euler characteristic X(G)=sum_x w(x) super counts simplices, Wu characteristics w_k(G) = sum_(x_1,x_2,...,x_k) w(x_1)...w(x_k) super counts simultaneously pairwise interacting k-tuples of simplices in a finite abstract simplicial…

Combinatorics · Mathematics 2018-03-20 Oliver Knill

In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…

Data Structures and Algorithms · Computer Science 2021-11-03 Haotian Jiang , Victor Reis

Let $D(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and ${\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\mathcal R}(n)$ in terms of $d$,…

Combinatorics · Mathematics 2016-10-26 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith

Let $S$ be a set of $n$ points in the plane, $\wp(S)$ be the set of all simple polygons crossing $S$, $\gamma_P$ be the maximum angle of polygon $P \in \wp(S)$ and $\theta =min_{P\in\wp(S)} \gamma_P$. In this paper, we prove that…

Computational Geometry · Computer Science 2021-06-15 Saeed Asaeedi , Farzad Didehvar , Ali Mohades

We develop upper and lower bounds for the numerical radius of $2\times 2$ off-diagonal operator matrices, which generalize and improve on the existing ones. We also show that if $A$ is a bounded linear operator on a complex Hilbert space…

Functional Analysis · Mathematics 2021-10-07 Pintu Bhunia , Kallol Paul

We prove new combinatorial results about polynomial configurations in large subsets of finite fields. Bergelson--Leibman--McCutcheon (2005) showed that for any polynomial $P(x) \in \mathbb{Z}[x]$ with $P(0) = 0$, if $A \subseteq…

Number Theory · Mathematics 2026-03-25 Ethan Ackelsberg , Vitaly Bergelson
‹ Prev 1 8 9 10 Next ›