English
Related papers

Related papers: Grassmann convexity and multiplicative Sturm theor…

200 papers

We present a Suffridge-like extension of the Grace-Szeg\"o convolution theorem for polynomials and entire functions with only real zeros. Our results can also be seen as a $q$-extension of P\'olya's and Schur's characterization of…

Classical Analysis and ODEs · Mathematics 2012-10-04 Martin Lamprecht

The following hypothesis was put forward by Goreinov, Tyrtyshnikov and Zamarashkin in \cite{GTZ1997}. For arbitrary real $n \times k$ matrix with orthonormal columns a sufficiently "good" $k \times k$ submatrix exists. "Good" in the sense…

Numerical Analysis · Mathematics 2024-08-27 Yuri Nesterenko

In this paper, we obtain a new proof of Fritz John necessary optimality conditions for vector problems applying Kakutani fixed point theorem and Hadamard directional derivative. We also derive a similar proof of second-order Fritz John…

Optimization and Control · Mathematics 2024-05-21 Vsevolod I. Ivanov

The classical problem of maximizing the Shannon entropy of a sum of independent random variables supported on a finite alphabet is considered and settled in the ternary case. Namely, the following theorem is established: if…

Information Theory · Computer Science 2026-05-13 Mladen Kovačević

Freiman's theorem gives a lower bound for the cardinality of the doubling of a finite set in $\RR^n$. In this paper we give an interpretation of his theorem for monomial ideals and their fiber cones. We call a quasi-equigenerated monomial…

Commutative Algebra · Mathematics 2018-01-17 Jürgen Herzog , Takayuki Hibi , Guangjun Zhu

We give a proof of the Universality Conjecture for orthogonal and symplectic ensembles of random matrices in the scaling limit for a class of weights w(x)=exp(-V(x)) where V is a polynomial, V(x)=kappa_{2m}x^{2m}+..., kappa_{2m}>0. For such…

Mathematical Physics · Physics 2007-05-23 Percy Deift , Dimitri Gioev

We show that the irreducible variety of 4 x 4 x 4 complex valued tensors of border rank at most 4 is the zero set of polynomial equations of degree 5 (the Strassen commutative conditions), of degree 6 (the Landsberg-Manivel polynomials),…

Algebraic Geometry · Mathematics 2011-05-02 Shmuel Friedland , Elizabeth Gross

The Davenport constant for a finite abelian group $G$ is the minimal length $\ell$ such that any sequence of $\ell$ terms from $G$ must contain a nontrivial zero-sum sequence. For the group $G=(\mathbb Z/n\mathbb Z)^2$, its value is $2n-1$,…

Number Theory · Mathematics 2021-07-23 David J. Grynkiewicz

We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form…

Optimization and Control · Mathematics 2014-09-09 Joël Blot

By a classical result of Roitman, a complete intersection $X$ of sufficiently small degree admits a rational decomposition of the diagonal. This means that some multiple of the diagonal by a positive integer $N$, when viewed as a cycle in…

Algebraic Geometry · Mathematics 2018-03-16 Andre Chatzistamatiou , Marc Levine

According to Ogg's conjecture (Mazur's Theorem), cuspidal subgroup coincides with rational torsion points of the Jacobian variety of modular curves of the form $X_0(N)$ for a {\it prime} number $N$. There is a recent interest to generalize…

Number Theory · Mathematics 2022-02-07 Debargha Banerjee , Narasimha Kumar , Dipramit Majumdar

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

Using a method of H. Davenport and W. M. Schmidt, we show that, for each positive integer n, the ratio 2/n is the optimal exponent of simultaneous approximation to real irrational numbers 1) by all conjugates of algebraic numbers of degree…

Number Theory · Mathematics 2015-05-13 Guillaume Alain

Let $\lambda_\mathbb{K}(m)$ denote the maximal absolute projection constant over the subspaces of dimension $m$. Apart from the trivial case for $ m=1$, the only known value of $\lambda_\mathbb{K}(m)$ is for $ m=2$ and…

Functional Analysis · Mathematics 2024-02-28 Beata Deregowska , Barbara Lewandowska

In this paper, we establish a regularity theory for the optimal transport problem when the target is composed of two disjoint convex domains. This is an important model in which singularities arise. Even though the singular set does not…

Analysis of PDEs · Mathematics 2025-07-22 Shibing Chen , Jiakun Liu

This paper discusses Tverberg-type theorems with coordinate constraints (i.e., versions of these theorems where all points lie within a subset $S \subset \mathbb{R}^d$ and the intersection of convex hulls is required to have a non-empty…

Metric Geometry · Mathematics 2019-01-30 Jesús A. De Loera , Thomas A. Hogan , Frédéric Meunier , Nabil Mustafa

By the classical Sturm's theorem, the number of distinct real roots of a given real polynomial $f(x)$ within any interval $(a,b]$ can be expressed by the number of variations in the sign of the Sturm chain at the bounds. Through…

Combinatorics · Mathematics 2021-11-01 Kaiwen Hou , Bin Li

We prove the B. and M. Shapiro conjecture that says that if the Wronskian of a set of polynomials has real roots only, then the complex span of this set of polynomials has a basis consisting of polynomials with real coefficients. This in…

Algebraic Geometry · Mathematics 2007-05-23 E. Mukhin , V. Tarasov , A. Varchenko

This paper offers two elementary yet precise derivations of an exact formula \[ W(n) = \sum_{i=1} ^{n} \lceil \lg i \rceil = n \lceil \lg n \rceil - 2^{\lceil \lg n \rceil} + 1 \] for the maximum number $ W(n) $ of comparisons of keys…

Data Structures and Algorithms · Computer Science 2017-03-01 Marek A. Suchenek

The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary code of length n with minimum Hamming distance at least d can be obtained by application of Turan's theorem to the graph with vertex set {0,1,..,q-1}^n in which…

Information Theory · Computer Science 2011-07-01 Ludo Tolhuizen