English
Related papers

Related papers: Macaulay bases of modules

200 papers

In Commutative Algebra structure results on minimal free resolutions of Gorenstein modules are of classical interest. We define Gorenstein modules of finite length over the weighted polynomial ring via symmetric matrices in divided powers.…

Commutative Algebra · Mathematics 2008-07-21 Michael Kunte

This habilitation (German variant of a PhD on top of a PhD) thesis presents the quintessence of the ideas and experiences with Groebner Bases of Birgit Reinert. She died unexpectedly without providing an abstract. As arXiv requires an…

Rings and Algebras · Mathematics 2009-03-29 Birgit Reinert

Castelnuovo-Mumford regularity and any extended degree function can be thought of as complexity measures for the structure of finitely generated graded modules. A recent result of Doering, Gunston, Vasconcelos shows that both can be…

Commutative Algebra · Mathematics 2007-05-23 Uwe Nagel

The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…

Rings and Algebras · Mathematics 2022-01-11 Rabigul Tuniyaz , Gulshadam Yunus

Calogero-Moser models can be generalised for all of the finite reflection groups. These include models based on non-crystallographic root systems, that is the root systems of the finite reflection groups, H_3, H_4, and the dihedral group…

High Energy Physics - Theory · Physics 2009-10-31 A. J. Bordner , E. Corrigan , R. Sasaki

We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…

Algebraic Geometry · Mathematics 2010-10-14 Franziska Hinkelmann , Elizabeth Arnold

We introduce a detection algorithm for SAGBI basis in polynomial rings, analogous to a Gr\"obner basis detection algorithm previously proposed by Gritzmann and Sturmfels. We also present two accompanying software packages named…

Commutative Algebra · Mathematics 2024-04-26 Viktoriia Borovik , Timothy Duff , Elima Shehu

Generalized Halphen systems are solved in terms of functions that uniformize genus zero Riemann surfaces, with automorphism groups that are commensurable with the modular group. Rational maps relating these functions imply subgroup…

solv-int · Physics 2007-05-23 J. Harnad , J. McKay

Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of…

Quantum Physics · Physics 2026-04-07 Buğra Gültekin , Solomon B. Samuel , Zafer Gedik

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…

Commutative Algebra · Mathematics 2022-03-09 Sonja Petrović , Shahrzad Jamshidi Zelenberg

In this article we compute a minimal Groebner basis for the symmetric algebra for certain affine Monomial Curves, as an R-module. Keywords: Monomial Curves, Groebner Basis, Symmetric Algebra. Mathematics Subject Classification 2000: 13P10,…

Commutative Algebra · Mathematics 2011-01-12 Debasish Mukhopadhyay

In "Frobenius Categories versus Brauer Blocks", Progress in Math. 274, we have introduced the Frobenius categories F over a finite p-group P, and we have associated to F - suitably endowed with some central k*-extensions - a "Grothendieck…

Group Theory · Mathematics 2010-04-12 Lluis Puig

The arithmetic degree, the smallest extended degree, and the homological degree are invariants that have been proposed as alternatives of the degree of a module if this module is not Cohen-Macaulay. We compare these degree functions and…

Commutative Algebra · Mathematics 2021-05-18 Uwe Nagel , Tim Roemer

Gr\"obner Bases and Cylindrical Algebraic Decomposition are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a…

Symbolic Computation · Computer Science 2012-07-30 David J. Wilson , Russell J. Bradford , James H. Davenport

We introduce the volume-preserving equivalence among symmetric matrix-valued map-germs which is the unimodular version of Bruce's $\mathcal{G}$-equivalence. The key concept to deduce unimodular classification out of classification relative…

Differential Geometry · Mathematics 2020-06-02 Wojciech Domitrz , Shyuichi Izumiya , Hiroshi Teramoto

We consider a few modifications of the Big prime modular $\gcd$ algorithm for polynomials in $\Z[x]$. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors…

Number Theory · Mathematics 2014-07-23 Vahagn H. Mikaelian

In this paper, we investigate the polyhedral structure of two submodular sets with generalized upper bound (GUB) constraints, which arise as important substructures in various real-world applications. We derive a class of strong valid…

Optimization and Control · Mathematics 2026-01-27 Weikang Qian , Keyan Li , Wei-Kun Chen , Yu-Hong Dai

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…

Symbolic Computation · Computer Science 2015-09-28 Tristan Vaccon

Let $R$ be a commutative unital ring, $\mathfrak{ a}$ an ideal of $R$ and $M$ a fixed $R$-module. We introduce and study generalisations of $\mathfrak{a}$-reduced modules, $\mathfrak{R}_{\mathfrak{ a}}$ and $\mathfrak{a}$-coreduced modules,…

Commutative Algebra · Mathematics 2024-04-11 Tilahun Abebaw , Amanuel Mamo , David Ssevviiri , Zelalem Teshome

We present a new algorithm for computing a $\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox,…

Algebraic Geometry · Mathematics 2017-03-09 Hoon Hong , Zachary Hough , Irina A. Kogan