Block Stanley decompositions. I: Elementary and gnomon decompositions

DOI10.1016/J.JPAA.2014.07.030MaRDI QIDQ2254786zbMATH OpenOpenAlexFDO

Authors Theodore Murdock, James A. Murdock

Publication date 6 February 2015

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.01831

zbMATH Keywords

block decompositionsmonomial idealsStanley decompositionssubprime filtrations

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Abstract: Stanley decompositions are used in invariant theory and the theory of normal forms for dynamical systems to provide a unique way of writing each invariant as a polynomial in the Hilbert basis elements. Since the required Stanley decompositions can be very long, we introduce a more concise notation called a block decomposition, along with three notions of shortness (incompressibility, minimality of Stanley spaces, and minimality of blocks) for block decompositions. We give two algorithms that generate different block decompositions, which we call elementary and gnomon decompositions, and give examples. Soleyman-Jahan's criterion for a Stanley decomposition to come from a prime filtration is reformulated to apply to block decompositions. We simplify his proof, and apply the theorem to show that elementary and gnomon decompositions come from "subprime" filtrations. In a sequel to this paper we will introduce two additional algorithms that generate block decompositions that may not always be subprime, but are always incompressible.

Review text

Let \(S\) be a polynomial ring over a field \(k\), with a fixed set of variables \(x_1,\ldots,x_n\). For a monomial ideal \(I\) of \(S\), it is of interest to find Stanley decompositions of the \(k\)-vector space \(S/I\), for example in the theory of Stanley depth. Stanley decompositions may be very long, hence the authors of this paper introduce block decomposition, which is geometrical in nature, as a compact version of Stanley decomposition. Denote by \(\text{Mon}(S)\) the set of all monomials in \(S\). Identify each monic monomial in \(S\) with a unique integral point in \(\mathbb{Z}_{\geq 0}^n\). A \textit{block} is a subset of \(\mathbb{Z}_{\geq 0}^n\) consisting of points belonging to a box \([a_1,b_1]\times[a_2,b_2] \times \cdots \times [a_n,b_n]\), where \(a_i\in \mathbb{Z}_{\geq 0}, b_i \in \mathbb{Z}_{\geq 0} \cup \{\infty\}\). By convention, \([a,\infty]\) is the half-open interval \([a,\infty)\). Let \(M\) be a subset of \(\text{Mon}(S)\), then a \textit{block decomposition} of \(M\) is a way to write \(M\) as a disjoint union of blocks. A \textit{Stanley block} is a block for which for all \(i=1,\ldots,n\), we have \(b_i \in \{a_i,\infty\}\). Stanley blocks naturally correspond to the usual, algebraic notion of Stanley spaces. The block decomposition of \(M\) is a \textit{Stanley decomposition} if all the blocks appearing in the union are Stanley ones. The primitive example of a block Stanley decomposition is the following: Let \(I\) be a monomial ideal of \(S\), and \(M\) be the set of monic monomials in \(S/I\). Then any (block) Stanley decomposition of \(M\) is a Stanley decomposition of the \(k\)-vector space \(S/I\) using Stanley spaces. Each block decomposition can be refined to a unique Stanley decomposition (Algorithm 2.2). The authors consider various measures of complexity of block decompositions, like compressibility, or minimality. In a sequel, they will consider organized and stacked decompositions. Let \(I\) be a monomial ideal of \(S\), and \(M\) the set of monic monomials in \(S/I\). The problem is to find block decompositions of \(M\). In the present paper, the authors define elementary and gnomon decompositions. Elementary decomposition is arguably the simplest block decomposition. On the other hand, gnomon decomposition has the advantage that one can find it by induction on the number of generators of \(I\). The authors prove an analogue of Soleyman-Jahan's characterization of Stanley decompositions which correspond to a prime filtration, by characterizing block decompositions which correspond to the so-clalled \textit{subprime filtrations}. They show that elementary and gnomon decompositions correspond to subprime filtrations.

Recommendations

• Block Stanley decompositions. II: Greedy algorithms, applications, and open problems
• On a conjecture of R. P. Stanley. I: Monomial ideals
• Stanley decomposition of the joint covariants of three quadratics
• Stanley decompositions in localized polynomial rings
• Complementary decompositions of monomial ideals and involutive bases

Cites work

• A new transvectant algorithm for nilpotent normal forms
• Averaging methods in nonlinear dynamical systems
• Box products in nilpotent normal form theory: the factoring method
• Computing combinatorial decompositions of rings
• How to compute the Stanley depth of a monomial ideal
• scientific article; zbMATH DE number 4172017 (Why is no real title available?)
• scientific article; zbMATH DE number 3975912 (Why is no real title available?)
• scientific article; zbMATH DE number 4036752 (Why is no real title available?)
• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• Normal form for the (2;n)-nilpotent vector field, using invariant theory
• Normal Forms for Coupled Takens-Bogdanov Systems
• On the structure of nilpotent normal form modules
• Prime filtrations of monomial ideals and polarizations
• Stanley decomposition for coupled Takens-Bogdanov systems
• Stanley decomposition of the joint covariants of three quadratics
• Stanley decompositions of the Bracket ring.
• Uniform bounds on multigraded regularity

Cited in

(6)

• Block Stanley decompositions. II: Greedy algorithms, applications, and open problems
• Stanley decompositions of the Bracket ring.
• Stanley decomposition for coupled Takens-Bogdanov systems
• scientific article; zbMATH DE number 4095658 (Why is no real title available?)
• Stanley decomposition of the joint covariants of three quadratics
• Box products in nilpotent normal form theory: the factoring method

This page was built for publication: Block Stanley decompositions. I: Elementary and gnomon decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254786)