Related papers: Newton Binomial Formulas in Schubert Calculus
We give an elementary approach utilizing only the divided difference formalism for obtaining expansions of Schubert polynomials that are manifestly nonnegative, by studying solutions to the equation $\sum Y_i\partial_i=\mathrm{id}$ on…
A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…
We generalize and unify the proofs of several results on algebraic in- dependence of arithmetic functions and Dirichlet series by a theorem of Ax on differential Schanuel conjecture. Along the way, we find counter-examples to some results…
We explain how to encode an algebraic series by finite data and how to do effective arithmetic on the level of these encodings. The reasoning is based on the Newton-Puiseux algorithm and an effective equality test for algebraic series.…
Regular semisimple Hessenberg varieties are a family of subvarieties of the flag variety that arise in number theory, numerical analysis, representation theory, algebraic geometry, and combinatorics. We give a "Giambelli formula" expressing…
The bifurcation sets of polynomial functions have been studied by many mathematicians from various points of view. In particular, N\'emethi and Zaharia described them in terms of Newton polytopes. In this paper, we will show analogous…
We prove a binomial formula for Macdonald polynomials and consider applications of it.
This paper tackles the problem of constructing Bezout matrices for Newton polynomials in a basis-preserving approach that operates directly with the given Newton basis, thus avoiding the need for transformation from Newton basis to monomial…
We give new product formulas for the number of standard Young tableaux of certain skew shapes and for the principal evaluation of the certain Schubert polynomials. These are proved by utilizing symmetries for evaluations of factorial Schur…
Binomial Theorem for (N+n)^r is described with non-commuting variables N and n.
Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…
We prove that the play and the stop operator possess Newton and Bouligand derivatives, and exhibit formulas for those derivatives. The remainder estimate is given in a strenghtened form, and a corresponding chain rule is developed. The…
In the paper, the authors establish an explicit formula for computing Bernoulli polynomials at non-negative integer points in terms of $r$-Stirling numbers of the second kind.
We study a family of polynomials whose values express degrees of Schubert varieties in the generalized complex flag manifold G/B. The polynomials are given by weighted sums over saturated chains in the Bruhat order. We derive several…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
We prove Samuel's conjecture on certain Graham positivity of the expansion coefficient of two double Schubert polynomials in three sets of variables by establishing a refined version of Graham's positivity theorem. As a corollary, we prove…
We prove a general dispersive estimate for a Schroedinger type equation on a product manifold, under the assumption that the equation restricted to each factor satisfies suitable dispersive estimates. Among the applications are the…
The Schubert polynomials lift the Schur basis of symmetric polynomials into a basis for Z[x1,x2,...]. We suggest the "prism tableau model" for these polynomials. A novel aspect of this alternative to earlier results is that it directly…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
In [GT], Goldin and the second author extend some ideas from Schubert calculus to the more general setting of Hamiltonian torus actions on compact symplectic manifolds with isolated fixed points. (See also [Kn99] and [Kn08].) The main goal…