Related papers: Gr{\"o}bner bases over Tate algebras
We compute the reduced Gr\"{o}bner basis of the toric ideal with respect to a suitable monomial order and we study the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is an unmixed bipartite graph without isolated vertices.
We present here a new approach for computing Gr\"obner bases for bilateral modules over an effective ring. Our method is based on Weispfenning notion of restricted Gr\"obner bases and related multiplication.
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…
We present a method for computing the framing on the cohomology of graph hypersurfaces defined by the Feynman differential form. This answers a question of Bloch, Esnault and Kreimer in the affirmative for an infinite class of graphs for…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…
We construct a category, $\Omega$, of which the objects are pointed categories and the arrows are pointed correspondences. The notion of a "spec datum" is introduced, as a certain relation between categories, of which one has been given a…
We consider a theory of noncommutative Gr\"obner bases on decreasingly filtered algebras whose associated graded algebras are commutative. We transfer many algorithms that use commutative Gr\"obner bases to this context. As an important…
We give a description of the mod 2 cohomology algebra of the oriented Grassmann manifold $\widetilde G_{2^t,4}$ as the quotient of a polynomial algebra by a certain ideal. In the process we find a Gr\"obner basis for that ideal, which we…
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…
We develop some foundations of commutative algebra, with a view towards algebraic geometry, in symmetric tensor categories. Most results establish analogues of classical theorems, in tensor categories which admit a tensor functor to some…
This text consists of five relatively systematic notes on Gr\"obner bases and free resolutions of modules over solvable polynomial algebras.
This paper deals with the notion of Gr\"obner $\delta$-base for some rings of linear differential operators by adapting the works of W. Trinks, A. Assi, M. Insa and F. Pauer. We compare this notion with the one of Gr\"obner base for such…
We develop a method for approximating the Gr\"obner basis of the ideal of polynomials which vanish at a finite set of points, when the coordinates of the points are known with only limited precision. The method consists of a preprocessing…
Elementary tutorial on implementation aspects of Gr\"obner bases computation.
Algebraic basics on Temperley-Lieb algebras are proved in an elementary and straightforward way with the help of tensor categories behind them.
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We establish Gr\"{o}bner-Shirshov bases theory for Gelfand-Dorfman-Novikov algebras over a field of characteristic $0$. As applications, a PBW type theorem in Shirshov form is given and we provide an algorithm for solving the word problem…
Given the complement of a hyperplane arrangement, let $\Gamma$ be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of $\Gamma$ in two…
In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…