Related papers: Mitosis algorithm for Grothendieck polynomials
The geometric naturality of Schubert polynomials and their combinatorial pipe dream representations was established by Knutson and Miller (2005) via antidiagonal Gr\"obner degeneration of matrix Schubert varieties. We consider instead…
The variety of complete quadrics is the wonderful compactification of $GL_n/O_n$ and admits a cell decomposition into Borel orbits indexed by combinatorial objects called $\mu$-involutions. We study Coxeter-theoretic properties of…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
In this paper, we provide a probabilistic interpretation of the Volkenborn integral; this allows us to extend results by T. Kim et al about sums of Euler numbers to sums of Bernoulli numbers. We also obtain a probabilistic representation of…
Lascoux and Sch\"utzenberger introduced Schubert and Grothendieck polynomials to study the cohomology and K-theory of the complete flag variety. We present explicit combinatorial rules for expressing Grothendieck polynomials in the basis of…
Extending results of Wyser, we determine formulas for the equivariant cohomology classes of closed orbits of certain families of spherical subgroups of $GL_n$ on the flag variety $GL_n/B$. Putting this together with a slight extension of…
Subword complexes were defined by A.Knutson and E.Miller in 2004 for describing Gr\"obner degenerations of matrix Schubert varieties. The facets of such a complex are indexed by pipe dreams, or, equivalently, by the monomials in the…
The purpose of this article is to give a Chlodowsky type generalization of Szasz operators defined by means of the Sheffer type polynomials. We obtain convergence properties of our operators with the help of Korovkin's theorem and the order…
Kohnert proposed the first monomial positive formula for Schubert polynomials as the generating polynomial for certain unit cell diagrams obtained from the Rothe diagram of a permutation. Billey, Jockusch and Stanley gave the first proven…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
We investigate nontrigonometric forms of Riesz transforms in the context of Schur multipliers. This refines Grothendieck-Haagerup's endpoint criterion with a new condition for the Schatten p-boundedness of Schur multipliers and strengthens…
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 present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…
Present notes can be viewed as an attempt to extend the notion of Schubert/Grothendieck polynomial to the context of an arbitrary algebraic oriented cohomology theory and, hence, of a commutative one-dimensional formal group law.
A novel very simple method for finding roots of polynomials over finite fields has been proposed. The essence of the proposed method is to search the roots via nested cycles over the subgroups of the multiplicative group of the Galois…
It is a classical fundamental result that Schur-positive specializations of the ring of symmetric functions are characterized via totally positive functions whose parametrization describes the Edrei-Thoma theorem. In this paper we study…
We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for…
Polynomial solutions to the KP hierarchy are known to be parametrized by a cone over an infinite-dimensional Grassmann variety. Using the notion of Schubert derivation on a Grassmann algebra, we encode the classical Pl\"ucker equations of…
For the root system of type $A$ we introduce and study a certain extension of the quadratic algebra invented by S. Fomin and the first author, to construct a model for the equivariant cohomology ring of the corresponding flag variety. As an…
In this note we first review the classical Petterson-Gorenstein-Zierler decoding algorithm for the class of alternant codes (which includes Reed-Solomon, Bose-Chaudhuri-Hocquenghem and classical Goppa codes), then we present an improvement…