Related papers: Lower Bounds in Real Schubert Calculus

The Shapiro conjecture in the real Schubert calculus, while likely true for Grassmannians, fails to hold for flag manifolds, but in a very interesting way. We give a refinement of the Shapiro conjecture for the flag manifold and present…

We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…

Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…

We prove lower bounds for the worst case error of quadrature formulas that use given sample points $\X_n = \{ x_1, \dots , x_n \}$. We are mainly interested in optimal point sets $\X_n$, but also prove lower bounds that hold with high…

We study modular analogues of Schur numbers for systems of linear equations. We show that these only depend on the number of equations, not their coefficients and in the case of one equation show stronger bounds.

We present the first super-linear lower bounds for natural graph problems in the CONGEST model, answering a long-standing open question. Specifically, we show that any exact computation of a minimum vertex cover or a maximum independent set…

We extend the classical Schubert calculus of enumerative geometry for the Grassmann variety of lines in projective space from the complex realm to the real. Specifically, given any collection of Schubert conditions on lines in projective…

We study exceptional minuscule Schubert varieties and provide the defining equations of the defining ideals of their intersection with the big open cell. We also provide the resolutions of these ideals and characterize some of them in terms…

Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…

We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems include submodular load balancing, which generalizes load…

We collect a few guesses on possible implications of a lower bound on the scalar curvature of a Riemannian manifold on the size and shape of this manifold.

Let X be an orthogonal Grassmannian parametrizing isotropic subspaces in an even dimensional vector space equipped with a nondegenerate symmetric form. We prove a Giambelli formula which expresses an arbitrary Schubert class in the singular…

Numerical homotopy continuation of solutions to polynomial equations is the foundation for numerical algebraic geometry, whose development has been driven by applications of mathematics. We use numerical homotopy continuation to investigate…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…

We study the numerical bounds obtained using a conformal-bootstrap method - advocated in ref. [1] but never implemented so far - where different points in the plane of conformal cross ratios $z$ and $\bar z$ are sampled. In contrast to the…

We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…

We prove a root system uniform, concise combinatorial rule for Schubert calculus of_minuscule_ and_cominuscule_ flag manifolds G/P (the latter are also known as "compact Hermitian symmetric spaces"). We connect this geometry to the poset…

We describe an approach to the question of finding real solutions to problems of enumerative geometry, in particular the question of whether a problem of enumerative geometry can have all of its solutions be real. We give some methods to…

This article provides new lower bounds for both Schur and weak Schur numbers by exploiting a "template"-based approach. The concept of "template" is also generalized to weak Schur numbers. Finding new templates leads to explicit partitions…