Related papers: Computation of unirational fields
The quantum cohomology algebra of the (full) flag manifold is a fundamental example in quantum cohomology theory, with connections to combinatorics, algebraic geometry, and integrable systems. Using a differential geometric approach, we…
Due to the elimination property held by the lexicographic monomial order, the corresponding Groebner bases display strong structural properties from which meaningful informations can easily be extracted. We study these properties for…
In this paper, we generalize the notion of border bases of zero-dimensional polynomial ideals to the module setting. To this end, we introduce order modules as a generalization of order ideals and module border bases of submodules with…
This is the first of two articles devoted to a comprehensive exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product…
We consider the algorithmic problem of computing a primitive idempotent of a central simple algebra over the field of rational functions over a finite field. The algebra is given by a set of structure constants. The problem is reduced to…
In this paper, we extend the characterization of $\mathbb{Z}[x]/\ < f \ >$, where $f \in \mathbb{Z}[x]$ to be a free $\mathbb{Z}$-module to multivariate polynomial rings over any commutative Noetherian ring, $A$. The characterization allows…
Let $F$ be a finite field with the characteristic $p > 2$ and let $G$ be the unitary Grassmann algebra generated by an infinite dimensional vector space $V$ over $F$. In this paper, we determine a basis for $\mathbb{Z}_{2}$-graded…
This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…
This paper involves categories and computer science. The paper is motivated by a question which arises from two pieces of research. Firstly, the work of Brown and Heyworth which extends rewriting techniques to enable the computation of left…
We classify all cubic extensions of any field of arbitrary characteristic, up to isomorphism, via an explicit construction involving three fundamental types of cubic forms. We deduce a classification of any Galois cubic extension of a…
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…
In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…
In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…
This paper presents algorithms for computing the Groebner fan of an arbitrary polynomial ideal. The computation involves enumeration of all reduced Groebner bases of the ideal. Our algorithms are based on a uniform definition of the…
We develop a theory of integration over valued fields of residue characteristic zero. In particular we obtain new and base-field independent foundations for integration over local fields of large residue characteristic, extending results of…
The Gr\"obner basis technique for calculating Feynman diagrams proposed in [O.V. Tarasov, Acta Physica Polonica, v. B29 (1998) 2655] is applied to the two-loop propagator type integrals with arbitrary masses and momentum. We describe the…
A new calculus of planar diagrams involving diagrammatics for biadjoint functors and degenerate affine Hecke algebras is introduced. The calculus leads to an additive monoidal category whose Grothendieck ring contains an integral form of…
Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…