相关论文: Mitosis algorithm for Grothendieck polynomials

One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…

We present an implementation of the algorithm for computing Groebner bases for operads due to the first author and A. Khoroshkin. We discuss the actual algorithms, the choices made for the implementation platform and the data…

The reduction of Feynman integrals to master integrals is an algebraic problem that requires algorithmic approaches at the modern level of calculations. Straightforward applications of the classical Buchberger algorithm to construct…

Subword complexes are simplicial complexes introduced by Knutson and Miller to illustrate the combinatorics of Schubert polynomials and determinantal ideals. They proved that any subword complex is homeomorphic to a ball or a sphere and…

We introduce an algorithm to describe Pieri's Rule for multiplication of Schubert polynomials. The algorithm uses tower diagrams introduced by the authors and another new algorithm that describes Monk's Rule. Our result is different from…

We show that a formalism proposed by Creutz to evaluate Grassmann integrals provides an algorithm of complexity $O(2^n n^3)$ to compute the generating function for the sum of the permanental minors of a matrix of order $n$. This algorithm…

Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In…

List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm…

This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…

In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…

There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…

We investigate the longstanding problem of finding a combinatorial rule for the Schubert structure constants in the $K$-theory of flag varieties (in type $A$). The Grothendieck polynomials of A. Lascoux-M.-P. Sch\"{u}tzenberger (1982) serve…

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…

The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities by reducing to polynomial inequalities. Finally, we show the great applicability of this algorithm and as examples, we use it to…

We suggest a mathematical definition of the notion of master integrals and present a brief review of algorithmic methods to solve reduction problems for Feynman integrals based on integration by parts relations. In particular, we discuss a…

We prove a formula for the degrees of Ikeda and Naruse's $P$-Grothendieck polynomials using combinatorics of shifted tableaux. We show this formula can be used in conjunction with results of Hamaker, Marberg, and Pawlowski to obtain an…

Schubert polynomials $\mathfrak{S}_w$ are polynomial representatives for cohomology classes of Schubert varieties in a complete flag variety, while Grothendieck polynomials $\mathfrak{G}_w$ are analogous representatives for the $K$-theory…

We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized…

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

There is a remarkable formula for the principal specialization of a type A Schubert polynomial as a weighted sum over reduced words. Taking appropriate limits transforms this to an identity for the backstable Schubert polynomials recently…