Related papers: Macaulay bases of modules
We extend the work of M.Borovoi on the nonabelian Galois cohomology of linear reductive algebraic groups over number fields to a general base scheme. As an application, we obtain new results on the arithmetic of such groups over global…
Classical local Weyl modules for a simple Lie algebra are labeled by dominant weights. We generalize the definition to the case of arbitrary weights and study the properties of the generalized modules. We prove that the representation…
We establish doubly-exponential degree bounds for Gr\"obner bases in certain algebras of solvable type over a field (as introduced by Kandri-Rody and Weispfenning). The class of algebras considered here includes commutative polynomial…
Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…
We investigate the application of syzygies for efficiently computing (finite) Pommaret bases. For this purpose, we first describe a non-trivial variant of Gerdt's algorithm to construct an involutive basis for the input ideal as well as an…
The Castelnuovo-Mumford regularity of a module gives a rough measure of its complexity. We bound the regularity of a module given a system of approximating modules whose regularities are known. Such approximations can arise naturally for…
A Generalized Numeration Base is defined in this paper, and then particular cases are presented, such as Prime Base, Square Base, m-Power Base, Factorial Base, and operations in these bases. These bases are important for partitions of…
We investigate the correspondence between generalized persistence modules and graded modules in the case the indexing set has a monoid action. We introduce the notion of an action category over a monoid graded ring. We show that the…
The template-based method is one of the most successful approaches to algebraic invariant synthesis. In this method, an algorithm designates a template polynomial p over program variables, generates constraints for p=0 to be an invariant,…
We present basic properties of Gr\"obner bases of submodules of a free module of finite rank over a polynomial ring $R$ with coefficients in a graded truncated discrete valuations ring $A$. As an application, we give a criterion for a…
Let $G$ be a compact group of linear transformations of an Euclidean space $V$. The $G$-invariant $C^\infty$ functions can be expressed as $C^\infty$ functions of a finite basic set of $G$-invariant homogeneous polynomials, called an…
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…
Let $F$ be an algebraically closed field of characteristic zero and let $G$ be a finite group. Consider $G$-graded simple algebras $A$ which are finite dimensional and $e$-central over $F$, i.e. $Z(A)_{e} := Z(A)\cap A_{e} = F$. For any…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
We deal with the reduction theory of a $W^*$-algebra $M$ along a $W^*$-subalgebra $Z$ of the centre of $M$. This is done by using Hilbert modules naturally constructed by suitable spatial representations of the abelian $W^*$-algebra $Z$. We…
Let $R$ be a unital ring satisfying the invariant basis number property, that every stably free $R$-module is free, and that the complex of partial bases of every finite rank free module is Cohen--Macaulay. This class of rings includes…
We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…
Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Grobner bases algorithm is a well-known method to solve this problem. However, a serious drawback exists in the Grobner bases based…
In 2019, Kaveh and Manon introduced Khovanskii bases as a special 'Gr\"obner-like' generating system of an algebra. We extend their work by considering an arbitrary grading on the algebra and propose a definition for a 'homogeneous…
Previous work by Mora and Sala provides the reduced Groebner basis of the ideal formed by the elementary symmetric polynomials in $n$ variables of degrees $k=1,\dots,n$, $\langle e_{1,n}(x), \dots, e_{n,n}(x) \rangle$. Haglund, Rhoades, and…