Related papers: Gr{\"o}bner bases over Tate algebras
In 1980, White conjectured that the toric ideal of a matroid is generated by quadratic binomials corresponding to a symmetric exchange. In this paper, we compute Gr\"obner bases of toric ideals associated with matroids and show that, for…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…
In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.
In this paper we show how to construct a certain class of orthonormal bases in $L^2({\bf R}^d)$ starting from one or more Gabor orthonormal bases in $L^2({\bf R})$. Each such basis can be obtained acting on a single function…
In this paper and upcoming ones, we initiate a systematic study of Bethe ansatz equations for integrable models by modern computational algebraic geometry. We show that algebraic geometry provides a natural mathematical language and…
In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Groebner bases via Buchberger's Algorithm.
In this article, we study bounded-below locally finite $\mathbb{Z}$-graded algebras, which are referred to as commonly graded algebras in literature. Commonly graded algebras have almost similar theory as that of connected graded algebras,…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
Any variety of classical algebras has a so-called conformal counterpart. For example one can consider Lie conformal or associative conformal algebras. Lie conformal algebras are closely related to vertex algebras. We define free objects in…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
In this paper we give a necessary and sufficient criterion for representability of a matroid over an algebraic closed field. This leads to an algorithm, based on an extension of Groebner Bases, in order to decide if a given matroid is…
Gr\"obner bases of binomial ideals arising from finite lattices will be studied. In terms of Gr\"obner bases and initial ideals, a characterization of finite distributive lattices as well as planar distributive lattices will be given.
For any type of fundamental groupoid scheme, we construct an algebraic cohomology theory for varieties with coefficients in the base field. This is a minor variant of \'etale cohomology, involving neither de Rham complexes nor…
Geometric (Clifford) algebra provides an efficient mathematical language for describing physical problems. We formulate general relativity in this language. The resulting formalism combines the efficiency of differential forms with the…
We present Buchberger Theory and Algorithm of Gr\"obner bases for multivariate Ore extensions of rings presented as modules over a principal ideal domain. The algorithms are based on M\"oller Lifting Theorem.
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 apply the methods of rewriting systems and Gr\"obner-Shirshov bases to give a unified approach to a class of linear operators on associative algebras. These operators resemble the classic Rota-Baxter operator, and they are…
For $n$ a power of two, we give a complete description of the cohomology algebra $H^*(\widetilde G_{n,3};\mathbb Z_2)$ of the Grassmann manifold $\widetilde G_{n,3}$ of oriented $3$-planes in $\mathbb R^n$. We do this by finding a reduced…