Related papers: Gr{\"o}bner bases over Tate algebras
Let G be any of the complex classical groups GL(n), SO(2n+1), Sp(2n), O(2n), let g denote the Lie algebra of G, and let Z(g) denote the subalgebra of G-invariants in the universal enveloping algebra U(g). We derive a Taylor-type expansion…
The Gr\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials is a Gr\"obner basis. This problem was shown to be NP-hard…
In this paper we present a new efficient variant to compute strong Gr\"obner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduce one computation over the quotient $R/nR$ to two…
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…
The complexity of Gr\"{o}bner computations has inspired many improvements to Buchberger's algorithm over the years. Looking for further insights into the algorithm's performance, we offer a threaded implementation of classical Buchberger's…
An algebra $\cal{R}$ is called an extension of the algebra $M$ by $B$ if $M^2=0$, $M$ is an ideal of $\cal{R}$ and $\cal{R}$$/M\cong B$ as algebras. In this paper, by using the Gr\"{o}bner-Shirshov bases, we characterize completely the…
We study the structure of a $3-$Leibniz algebra $T$ graded by an arbitrary abelian group $G,$ which is considered of arbitrary dimension and over an arbitrary base field $\bbbf.$ We show that $T$ is of the form $T=\uu\oplus\sum_jI_j,$ with…
Given an affine algebra $R=K[x_1,\dots,x_n]/I$ over a field $K$, where $I$ is an ideal in the polynomial ring $P=K[x_1,\dots,x_n]$, we examine the task of effectively calculating re-embeddings of $I$, i.e., of presentations $R=P'/I'$ such…
Let $(f\_1,\dots, f\_s) \in \mathbb{Q}\_p [X\_1,\dots, X\_n]^s$ be a sequence of homogeneous polynomials with $p$-adic coefficients. Such system may happen, for example, in arithmetic geometry. Yet, since $\mathbb{Q}\_p$ is not an effective…
Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…
The tame symmetric algebras of period four, TSP4 algebras for short, form an important class of algebras, with interesting links to various branches of modern algebra. The study of this class has been recently developed in two major…
We present foundational work on standard bases over rings and on Boolean Groebner bases in the framework of Boolean functions. The research was motivated by our collaboration with electrical engineers and computer scientists on problems…
Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.
A universal Gr\"obner basis of an ideal is the union of all its reduced Gr\"obner bases. It is contained in the Graver basis, the set of all primitive elements. Obtaining an explicit description of either of these sets, or even a sharp…
Let $I$ be an ideal of the polynomial ring $A[x]=A[x_1,...,x_n]$ over the commutative, noetherian ring $A$. Geometrically $I$ defines a family of affine schemes over $\Spec(A)$: For $\p\in\Spec(A)$, the fibre over $\p$ is the closed…
The class of graded elementary quasi-Hopf algebras of tame type is classified. Combining with our previous work [19], this completes the trichotomy for such class of algebras according to their representation types. In addition, new…
Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…
A generalized criterion for signature related algorithms to compute Gr\"obner basis is proposed in this paper. Signature related algorithms are a popular kind of algorithms for computing Gr\"obner basis, including the famous F5 algorithm,…
We classify tame symmetric algebras of period four which are closely related to the spherical algebras introduced in [7]. This note provides a classification in the special case which naturally appears, when dealing with biregular Gabriel…
We consider, for each exchange matrix B, a category of geometric cluster algebras over B and coefficient specializations between the cluster algebras. The category also depends on an underlying ring R, usually the integers, rationals, or…