Related papers: An efficient algorithm for deciding vanishing of S…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved…
We introduce polynomials that represent general degeneracy loci for maps of vector bundles. These polynomials specialize to the known classical and quantum forms of single and double Schubert polynomials. This is the final version of the…
We generalize our puzzle formula for ordinary Schubert calculus on Grassmannians, to a formula for the T-equivariant Schubert calculus. The structure constants to be calculated are polynomials in {y_{i+1} - y_i}; they were shown…
Given scheme-theoretic equations for a nonsingular subvariety, we prove that the higher cohomology groups for suitable twists of the corresponding ideal sheaf vanish. From this result, we obtain linear bounds on the multigraded…
We deal with the algebraicity of a Puiseux series in terms of the properties of its coefficients. We show that the algebraicity of a Puiseux series for given bounded degree is determined by a finite number of explicit polynomial formulae.…
We obtain a geometric construction of a ``standard monomial basis'' for the homogeneous coordinate ring associated with any ample line bundle on any flag variety. This basis is compatible with Schubert varieties, opposite Schubert…
Let $P$ be a bounded convex subset of $\mathbb R^n$ of positive volume. Denote the smallest degree of a polynomial $p(X_1,\dots,X_n)$ vanishing on $P\cap\mathbb Z^n$ by $r_P$ and denote the smallest number $u\geq0$ such that every function…
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
Enriched versions of type A Schubert polynomials are constructed with coefficients in a polynomial ring in variables $c_1, c_2, \ldots$. Specializing these variables to $0$ recovers the double Schubert polynomials of Lascoux and…
This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in…
We give the first fully polynomial-time algorithm for learning halfspaces with respect to the uniform distribution on the hypercube in the presence of contamination, where an adversary may corrupt some fraction of examples and labels…
In the classic polyline simplification problem we want to replace a given polygonal curve $P$, consisting of $n$ vertices, by a subsequence $P'$ of $k$ vertices from $P$ such that the polygonal curves $P$ and $P'$ are as close as possible.…
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
The expansion of a Schubert polynomial into slide polynomials corresponds to a sum over sub-balls in the subword complex. There has been recent interest in other, coarser, expansions of Schubert polynomials. We extend the methods used in…
We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…
The necessary and sufficient Horn inequalities which determine the non-vanishing Littlewood-Richardson coefficients in the cohomology of a Grassmannian are recursive in that they are naturally indexed by non-vanishing Littlewood-Richardson…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical…
Schubert polynomials represent a basis for the cohomology of the complete flag variety and thus play a central role in geometry and combinatorics. In this context, Schubert polynomials are generating functions over various combinatorial…
We give formulas for the products of classes of Schubert varieties in the quantum cohomology rings of Grassmannians, in terms of the combinatorics of partitions and tableaux.