Related papers: Newton Binomial Formulas in Schubert Calculus
We study the factorization of Schubert polynomials into elementary symmetric polynomials. We conjecture that this occurs when the permutation corresponding to the Schubert polynomial does not contain the patterns $1432$, $1423$, $4132$, and…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
We illuminate the relation between the Bruhat order on the symmetric group and structure constants (Littlewood-Richardson coefficients) for the cohomology of the flag manifold in terms of its basis of Schubert classes. Equivalently, the…
We study a variant of Newton's algorithm applied to under-determined systems of non-smooth equations. The notion of regularity employed in our work is based on Newton differentiability, which generalizes semi-smoothness. The classic notion…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…
In the paper, the authors provide four alternative proofs of an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind.
We consider relationships between optimality conditions using Newton diagrams and sums of squares of polynomials and power series.
This paper proposes and develops a new Newton-type algorithm to solve subdifferential inclusions defined by subgradients of extended-real-valued prox-regular functions. The proposed algorithm is formulated in terms of the second-order…
We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
Recently, Chapoton found a $q$-analog of Ehrhart polynomials, which are polynomials in $x$ whose coefficients are rational functions in $q$. Chapoton conjectured the shape of the Newton polygon of the numerator of the $q$-Ehrhart polynomial…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
A flexible unified framework for both classical and quantum Schubert calculus is proposed. It is based on a natural combinatorial approach relying on the Hasse-Schmidt extension of a certain family of pairwise commuting endomorphisms of an…
We consider the solution of variational equations on manifolds by Newton's method. These problems can be expressed as root finding problems for mappings from infinite dimensional manifolds into dual vector bundles. We derive the…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
Basepoint free cycles on the moduli space $\overline{M}_{0,n}$ of stable n-pointed rational curves, defined using Gromov-Witten invariants of smooth projective homogeneous spaces X are studied. Intersection formulas to find classes are…
It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…
We introduce new notions in elliptic Schubert calculus: the (twisted) Borisov-Libgober classes of Schubert varieties in general homogeneous spaces G/P. While these classes do not depend on any choice, they depend on a set of new variables.…
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…