The existence of non-thin subalgebras of $K[x]/x^n$ and related numerical monoids
Francisco Franco Munoz

TL;DR
This paper investigates the minimal dimension of truncated polynomial algebras over any field that contain non-thin subalgebras, providing examples and counting them in low dimensions.
Contribution
It identifies the minimal dimension for non-thin subalgebras in truncated polynomial algebras and explores their examples and enumeration.
Findings
Minimal dimension for non-thin subalgebras determined
Examples of non-thin subalgebras provided
Counting of subalgebras in low dimensions conducted
Abstract
We find the minimal dimension for a truncated polynomial algebra over an arbitrary field for which there exists a "non-thin" subalgebra. Moreover, we discuss examples of subalgebras, and count them in low dimensions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Commutative Algebra and Its Applications · Algebraic structures and combinatorial models
The existence of non-thin subalgebras of and related numerical monoids
Francisco Franco Munoz
Abstract
We discuss examples of subalgebras of , count them in the case of finite fields when , and emphasize the connections with monoids and their invariants. We prove that the least integer such that there is a “non-thin” subalgebra of is .
1 Setting and conventions
In this work, the basic objects of study are -subalgebras of , where is a field. Such an algebra is local as a ring; we denote by its maximal ideal, its set of exponents (i.e. the set of valuations of its monic elements), and the minimal number of generators of as partial-monoid. We drop the subscripts and references to when understood from the context. We continue using here the same notation as in [1] and we’ll refer to that paper for background and results. All subspaces and dimensions are over .
2 Summary of minimal extensions
The relevant results of [1] are applied in this setting as follows: Let the natural map. We’ll consider subalgebras . The main question we study is what can be said about the set of subalgebras mapping isomorphically onto by .
Theorem 1**.**
The necessary and sufficient condition for the existence of a subalgebra mapping isomorphically onto is that (a one-dimensional -vector space) not be contained in . If that’s the case, the set of such algebras is naturally in correspondence with an affine space, isomorphic to (i.e. same dimension as) .
In particular when , there are such subalgebras, where . The process described in [1] allows one to reduce to those subalgebras of containing . Furthermore, as it’s explained there, provided one knows that for all subalgebras of the equality holds, then one can count exactly all the subalgebras of .
We recall here Proposition 22 of [1] which says that and that’s the most one can assert. An algebra for which equality holds will be called thin, otherwise it’s called non-thin. Here’s an example of a non-thin subalgebra [1]:
The algebra generated by inside has the basis , and and the generators of are so is a generator of while which belongs to . We have also .
3 Examples and tables
3.1 Examples in low dimensions
Fix a field . We can list all the sub-partial-monoids of for low values of and compute directly. Recall the definition of the invariant :
[TABLE]
In the tables, the generators denote algebra generators, i.e. all the monomials in the elements (including the empty monomial ). It’s not a priori immediate if those are linearly independent modulo , but in the following lists that’s the case and at the end we’ll prove this theorem.
3.1.1
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0\}&0&\mathbb{K}[x]/x=\mathbb{K}\\ \hline\cr\end{array}
3.1.2
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0,1\}&0&\mathbb{K}[x]/x^{2}\\ \hline\cr\{0\}&0&\mathbb{K}\\ \hline\cr\end{array}
3.1.3
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0,1,2\}&0&\mathbb{K}[x]/x^{3}\\ \hline\cr\{0,2\}&0&\{x^{2}\}\\ \hline\cr\{0\}&0&\mathbb{K}\\ \hline\cr\end{array}
3.1.4
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0,1,2,3\}&0&\mathbb{K}[x]/x^{4}\\ \hline\cr\{0,2,3\}&0&\{x^{2},x^{3}\}\\ \hline\cr\{0,3\}&0&\{x^{3}\}\\ \hline\cr\{0,2\}&1&\{x^{2}+ax^{3}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0\}&0&\mathbb{K}\\ \hline\cr\end{array}
3.1.5
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0,1,2,3,4\}&0&\mathbb{K}[x]/x^{5}\\ \hline\cr\{0,2,3,4\}&0&\{x^{2},x^{3}\}\\ \hline\cr\{0,3,4\}&0&\{x^{3},x^{4}\}\\ \hline\cr\{0,2,4\}&1&\{x^{2}+ax^{3}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4\}&0&\{x^{4}\}\\ \hline\cr\{0,3\}&1&\{x^{3}+ax^{4}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0\}&0&\mathbb{K}\\ \hline\cr\end{array}
3.1.6
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0,1,2,3,4,5\}&0&\mathbb{K}[x]/x^{6}\\ \hline\cr\{0,2,3,4,5\}&0&\{x^{2},x^{3}\}\\ \hline\cr\{0,3,4,5\}&0&\{x^{3},x^{4},x^{5}\}\\ \hline\cr\{0,2,4,5\}&1&\{x^{2}+ax^{3},x^{5}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,5\}&0&\{x^{4},x^{5}\}\\ \hline\cr\{0,3,5\}&1&\{x^{3}+ax^{4},x^{5}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,5\}&0&\{x^{5}\}\\ \hline\cr\{0,3,4\}&2&\{x^{3}+ax^{5},x^{4}+bx^{5}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,2,4\}&2&\{x^{2}+ax^{3}+bx^{5}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,4\}&1&\{x^{4}+ax^{5}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,3\}&2&\{x^{3}+ax^{4}+bx^{5}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0\}&0&\mathbb{K}\\ \hline\cr\end{array}
3.1.7
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0,1,2,3,4,5,6\}&0&\mathbb{K}[x]/x^{7}\\ \hline\cr\{0,2,3,4,5,6\}&0&\{x^{2},x^{3}\}\\ \hline\cr\{0,3,4,5,6\}&0&\{x^{3},x^{4},x^{5}\}\\ \hline\cr\{0,2,4,5,6\}&1&\{x^{2}+ax^{3},x^{5}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,5,6\}&0&\{x^{4},x^{5},x^{6}\}\\ \hline\cr\{0,3,5,6\}&1&\{x^{3}+ax^{4},x^{5}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,5,6\}&0&\{x^{5},x^{6}\}\\ \hline\cr\{0,3,4,6\}&2&\{x^{3}+ax^{5},x^{4}+bx^{5}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,2,4,6\}&2&\{x^{2}+ax^{3}+bx^{5}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,4,6\}&1&\{x^{4}+ax^{5},x^{6}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,3,6\}&2&\{x^{3}+ax^{4}+bx^{5}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,6\}&0&\{x^{6}\}\\ \hline\cr\{0,4,5\}&2&\{x^{4}+ax^{6},x^{5}+bx^{6}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5\}&1&\{x^{5}+ax^{6}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4\}&2&\{x^{4}+ax^{5}+bx^{6}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0\}&0&\mathbb{K}\\ \hline\cr\end{array}
3.1.8
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0,1,2,3,4,5,6,7\}&0&\mathbb{K}[x]/x^{8}\\ \hline\cr\{0,2,3,4,5,6,7\}&0&\{x^{2},x^{3}\}\\ \hline\cr\{0,3,4,5,6,7\}&0&\{x^{3},x^{4},x^{5}\}\\ \hline\cr\{0,2,4,5,6,7\}&1&\{x^{2}+ax^{3},x^{5}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,5,6,7\}&0&\{x^{4},x^{5},x^{6},x^{7}\}\\ \hline\cr\{0,3,5,6,7\}&1&\{x^{3}+ax^{4},x^{5},x^{7}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,5,6,7\}&0&\{x^{5},x^{6},x^{7}\}\\ \hline\cr\{0,3,4,6,7\}&2&\{x^{3}+ax^{5},x^{4}+bx^{5}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,2,4,6,7\}&2&\{x^{2}+ax^{3}+bx^{5},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,4,6,7\}&1&\{x^{4}+ax^{5},x^{6},x^{7}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,3,6,7\}&2&\{x^{3}+ax^{4}+bx^{5},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,6,7\}&0&\{x^{6},x^{7}\}\\ \hline\cr\{0,4,5,7\}&2&\{x^{4}+ax^{6},x^{5}+bx^{6},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5,7\}&1&\{x^{5}+ax^{6},x^{7}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,7\}&2&\{x^{4}+ax^{5}+bx^{6},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,7\}&0&\{x^{7}\}\\ \hline\cr\{0,4,5,6\}&3&\{x^{4}+ax^{7},x^{5}+bx^{7},x^{6}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,3,5,6\}&3&\{x^{3}+ax^{4}+bx^{7},x^{5}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,5,6\}&2&\{x^{5}+ax^{7},x^{6}+bx^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,2,4,6\}&3&\{x^{2}+ax^{3}+bx^{5}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,4,6\}&3&\{x^{4}+ax^{5}+bx^{7},x^{6}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,3,6\}&3&\{x^{3}+ax^{4}+bx^{5}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,6\}&1&\{x^{6}+ax^{7}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,5\}&4&\{x^{4}+ax^{6}+cx^{7},x^{5}+bx^{6}+dx^{7}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,5\}&2&\{x^{5}+ax^{6}+bx^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,4\}&3&\{x^{4}+ax^{5}+bx^{6}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0\}&0&\mathbb{K}\\ \hline\cr\end{array}
3.1.9
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0,1,2,3,4,5,6,7,8\}&0&\mathbb{K}[x]/x^{9}\\ \hline\cr\{0,2,3,4,5,6,7,8\}&0&\{x^{2},x^{3}\}\\ \hline\cr\{0,3,4,5,6,7,8\}&0&\{x^{3},x^{4},x^{5}\}\\ \hline\cr\{0,2,4,5,6,7,8\}&1&\{x^{2}+ax^{3},x^{5}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,5,6,7,8\}&0&\{x^{4},x^{5},x^{6},x^{7}\}\\ \hline\cr\{0,3,5,6,7,8\}&1&\{x^{3}+ax^{4},x^{5},x^{7}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,5,6,7,8\}&0&\{x^{5},x^{6},x^{7},x^{8}\}\\ \hline\cr\{0,3,4,6,7,8\}&2&\{x^{3}+ax^{5},x^{4}+bx^{5}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,2,4,6,7,8\}&2&\{x^{2}+ax^{3}+bx^{5},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,4,6,7,8\}&1&\{x^{4}+ax^{5},x^{6},x^{7}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,3,6,7,8\}&2&\{x^{3}+ax^{4}+bx^{5},x^{7},x^{8}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,6,7,8\}&0&\{x^{6},x^{7},x^{8}\}\\ \hline\cr\{0,4,5,7,8\}&2&\{x^{4}+ax^{6},x^{5}+bx^{6},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5,7,8\}&1&\{x^{5}+ax^{6},x^{7},x^{8}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,7,8\}&2&\{x^{4}+ax^{5}+bx^{6},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,7,8\}&0&\{x^{7},x^{8}\}\\ \hline\cr\{0,4,5,6,8\}&3&\{x^{4}+ax^{7},x^{5}+bx^{7},x^{6}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,3,5,6,8\}&3&\{x^{3}+ax^{4}+bx^{7},x^{5}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,5,6,8\}&2&\{x^{5}+ax^{7},x^{6}+bx^{7},x^{8}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,2,4,6,8\}&3&\{x^{2}+ax^{3}+bx^{5}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,4,6,8\}&3&\{x^{4}+ax^{5}+bx^{7},x^{6}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,3,6,8\}&3&\{x^{3}+ax^{4}+bx^{5}+cx^{7},x^{8}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,6,8\}&1&\{x^{6}+ax^{7},x^{8}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,5,8\}&4&\{x^{4}+ax^{6}+cx^{7},x^{5}+bx^{6}+dx^{7}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,5,8\}&2&\{x^{5}+ax^{6}+bx^{7},x^{8}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,4,8\}&3&\{x^{4}+ax^{5}+bx^{6}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,8\}&0&\{x^{8}\}\\ \hline\cr\{0,5,6,7\}&3&\{x^{5}+ax^{8},x^{6}+bx^{8},x^{7}+cx^{8}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,3,6,7\}&4&\{x^{3}+ax^{4}+bx^{5}+cx^{8},x^{7}+dx^{8}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,6,7\}&2&\{x^{6}+ax^{8},x^{7}+bx^{8}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5,7\}&3&\{x^{5}+ax^{6}+bx^{8},x^{7}+cx^{8}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,7\}&1&\{x^{7}+ax^{8}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,5,6\}&4&\{x^{5}+ax^{7}+cx^{8},x^{6}+bx^{7}+dx^{8}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,3,6\}&4&\{x^{3}+ax^{4}+bx^{5}+cx^{7}+dx^{8}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,6\}&2&\{x^{6}+ax^{7}+bx^{8}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5\}&3&\{x^{5}+ax^{6}+bx^{7}+cx^{8}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0\}&0&\mathbb{K}\\ \hline\cr\end{array}
3.1.10
\begin{array}[]{ | c | c | c | }\hline\cr E&e(E)&\text{Subalgebras}\\ \hline\cr\{0,1,2,3,4,5,6,7,8,9\}&0&\mathbb{K}[x]/x^{10}\\ \hline\cr\{0,2,3,4,5,6,7,8,9\}&0&\{x^{2},x^{3}\}\\ \hline\cr\{0,3,4,5,6,7,8,9\}&0&\{x^{3},x^{4},x^{5}\}\\ \hline\cr\{0,2,4,5,6,7,8,9\}&1&\{x^{2}+ax^{3},x^{5}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,5,6,7,8,9\}&0&\{x^{4},x^{5},x^{6},x^{7}\}\\ \hline\cr\{0,3,5,6,7,8,9\}&1&\{x^{3}+ax^{4},x^{5},x^{7}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,5,6,7,8,9\}&0&\{x^{5},x^{6},x^{7},x^{8},x^{9}\}\\ \hline\cr\{0,3,4,6,7,8,9\}&2&\{x^{3}+ax^{5},x^{4}+bx^{5},x^{9}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,2,4,6,7,8,9\}&2&\{x^{2}+ax^{3}+bx^{5},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,4,6,7,8,9\}&1&\{x^{4}+ax^{5},x^{6},x^{7},x^{9}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,3,6,7,8,9\}&2&\{x^{3}+ax^{4}+bx^{5},x^{7},x^{8}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,6,7,8,9\}&0&\{x^{6},x^{7},x^{8},x^{9}\}\\ \hline\cr\{0,4,5,7,8,9\}&2&\{x^{4}+ax^{6},x^{5}+bx^{6},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5,7,8,9\}&1&\{x^{5}+ax^{6},x^{7},x^{8},x^{9}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,7,8,9\}&2&\{x^{4}+ax^{5}+bx^{6},x^{7},x^{9}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,7,8,9\}&0&\{x^{7},x^{8},x^{9}\}\\ \hline\cr\{0,4,5,6,8,9\}&3&\{x^{4}+ax^{7},x^{5}+bx^{7},x^{6}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,3,5,6,8,9\}&3&\{x^{3}+ax^{4}+bx^{7},x^{5}+cx^{7}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,5,6,8,9\}&2&\{x^{5}+ax^{7},x^{6}+bx^{7},x^{8},x^{9}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,2,4,6,8,9\}&3&\{x^{2}+ax^{3}+bx^{5}+cx^{7},x^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,4,6,8,9\}&3&\{x^{4}+ax^{5}+bx^{7},x^{6}+cx^{7},x^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,3,6,8,9\}&3&\{x^{3}+ax^{4}+bx^{5}+cx^{7},x^{8}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,6,8,9\}&1&\{x^{6}+ax^{7},x^{8},x^{9}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,5,8,9\}&4&\{x^{4}+ax^{6}+cx^{7},x^{5}+bx^{6}+dx^{7}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,5,8,9\}&2&\{x^{5}+ax^{6}+bx^{7},x^{8},x^{9}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,4,8,9\}&3&\{x^{4}+ax^{5}+bx^{6}+cx^{7},x^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,8,9\}&0&\{x^{8},x^{9}\}\\ \hline\cr\{0,5,6,7,9\}&3&\{x^{5}+ax^{8},x^{6}+bx^{8},x^{7}+cx^{8},x^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,3,6,7,9\}&4&\{x^{3}+ax^{4}+bx^{5}+cx^{8},x^{7}+dx^{8}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,6,7,9\}&2&\{x^{6}+ax^{8},x^{7}+bx^{8},x^{9}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5,7,9\}&3&\{x^{5}+ax^{6}+bx^{8},x^{7}+cx^{8},x^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,7,9\}&1&\{x^{7}+ax^{8},x^{9}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,5,6,9\}&4&\{x^{5}+ax^{7}+cx^{8},x^{6}+bx^{7}+dx^{8},x^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,3,6,9\}&4&\{x^{3}+ax^{4}+bx^{5}+cx^{7}+dx^{8}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,6,9\}&2&\{x^{6}+ax^{7}+bx^{8},x^{9}\}\mid\text{any }a,b\in\mathbb{K}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5,9\}&3&\{x^{5}+ax^{6}+bx^{7}+cx^{8},x^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,9\}&0&\{x^{9}\}\\ \hline\cr\end{array}
\begin{array}[]{ | c | c | c | }\hline\cr\{0,5,6,7,8\}&4&\{x^{5}+ax^{9},x^{6}+bx^{9},x^{7}+cx^{9},x^{8}+dx^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,4,6,7,8\}&4&\{x^{4}+ax^{5}+bx^{9},x^{6}+cx^{9},x^{7}+dx^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,6,7,8\}&3&\{x^{6}+ax^{9},x^{7}+bx^{9},x^{8}+cx^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,5,7,8\}&4&\{x^{5}+ax^{6}+bx^{9},x^{7}+cx^{9},x^{8}+dx^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,4,7,8\}&4&\{x^{4}+ax^{5}+bx^{6}+cx^{9},x^{7}+dx^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,7,8\}&2&\{x^{7}+ax^{9},x^{8}+bx^{9}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5,6,8\}&5&\{x^{5}+ax^{7}+cx^{9},x^{6}+bx^{7}+dx^{9},x^{8}+ex^{9}\}\mid\text{any }a,b,c,d,e\in\mathbb{K}\\ \hline\cr\{0,2,4,6,8\}&4&\{x^{2}+ax^{3}+bx^{5}+cx^{7}+dx^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,4,6,8\}&5&\{x^{4}+ax^{5}+bx^{7}+dx^{9},x^{6}+cx^{7}+ex^{9}\}\mid\text{any }a,b,c,d,e\in\mathbb{K}\\ \hline\cr\{0,6,8\}&3&\{x^{6}+ax^{7}+bx^{9},x^{8}+cx^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,5,8\}&4&\{x^{5}+ax^{6}+bx^{7}+cx^{9},x^{8}+dx^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,4,8\}&4&\{x^{4}+ax^{5}+bx^{6}+cx^{7}+dx^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,8\}&1&\{x^{8}+ax^{9}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,5,6,7\}&6&\{x^{5}+ax^{8}+dx^{9},x^{6}+bx^{8}+ex^{9},x^{7}+cx^{8}+fx^{9}\}\mid\text{any }a,b,c,d,e,f\in\mathbb{K}\\ \hline\cr\{0,6,7\}&4&\{x^{6}+ax^{8}+cx^{9},x^{7}+bx^{8}+dx^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,5,7\}&5&\{x^{5}+ax^{6}+bx^{8}+dx^{9},x^{7}+cx^{8}+ex^{9}\}\mid\text{any }a,b,c,d,e\in\mathbb{K}\\ \hline\cr\{0,7\}&2&\{x^{7}+ax^{8}+bx^{9}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,5,6\}&6&\{x^{5}+ax^{7}+cx^{8}+ex^{9},x^{6}+bx^{7}+dx^{8}+fx^{9}\}\mid\text{any }a,b,c,d,e,f\in\mathbb{K}\\ \hline\cr\{0,6\}&3&\{x^{6}+ax^{7}+bx^{8}+cx^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,5\}&4&\{x^{5}+ax^{6}+bx^{7}+cx^{8}+dx^{9}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0\}&0&\mathbb{K}\\ \hline\cr\end{array}
Theorem 2**.**
The tables are correct up to . Moreover, the equality holds, i.e. these algebras are all thin.
Proof.
Checking the values for is straightforward. The fact that the coefficients appear in the indicated way is a consequence of the theory of minimal extensions ([1]), as mentioned before. For , denote , those that are sum of two nonzero elements (it’s possible that ). Notice that .
We need to prove the assertion that if and implies that . This in turn proves that the counts for the sub-partial-monoids not containing are correct, since they come from the results on minimal extensions from those containing .
By immediate inspection the results for hold. For , by direct inspection of the table, for all that contain , either or the square , i.e. has trivial additive structure, so (which means that for , ).
- •
. The ones that are not immediately obvious are:
\begin{array}[]{ | c | c | }\hline\cr\{0,3,5,6,7\}&\{x^{3}+ax^{4},x^{5},x^{7}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,2,4,6,7\}&\{x^{2}+ax^{3}+bx^{5},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,3,6,7\}&\{x^{3}+ax^{4}+bx^{5},x^{7}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\end{array}
It’s enough to show for the first two, since the third is contained in the first. For the only nonzero product in is which is not a multiple of . For a linear generating set of consists of the powers (where ) and clearly no such combination equals .
- •
. The ones that are not immediately obvious are:
\begin{array}[]{ | c | c | }\hline\cr\{0,3,6,7,8\}&\{x^{3}+ax^{4}+bx^{5},x^{7},x^{8}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,3,6,8\}&\{x^{3}+ax^{4}+bx^{5}+cx^{7},x^{8}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\end{array}
It’s enough to show for the first exponent set, since that contains the second. For a generating set of consists of the element (where ) which is not a multiple of .
- •
. The ones that are not so obvious are:
\begin{array}[]{ | c | c | }\hline\cr\{0,4,6,7,8,9\}&\{x^{4}+ax^{5},x^{6},x^{7},x^{9}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,7,8,9\}&\{x^{4}+ax^{5}+bx^{6},x^{7},x^{9}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,2,4,6,8,9\}&\{x^{2}+ax^{3}+bx^{5}+cx^{7},x^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,4,6,8,9\}&\{x^{4}+ax^{5}+bx^{7},x^{6}+cx^{7},x^{9}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\end{array}
It’s enough to show for the first and third exponent set. For , the only nonzero product in is which is not a multiple of . For , a linear generating set of consists of the powers where and such a combination is never equal to , by looking at leading coefficients.
∎
4 Counting Monoids and Algebras
We can collect the information about the monoids in the following tables. They follow by simply counting the items in the tables before. The top horizontal row labels the possible values of for a sub-partial-monoid of , and the vertical left row labels the co-size of , namely the size of its complement . We start the tables with the trivial case . The last column is the total count of a given co-size.
Many patterns can be explained from results in [1] while others have to do with Frobenius numbers of numerical monoids [3], in particular with relations between the genus (number of elements of the complement) and the Frobenius number (largest number not contained in the monoid).
4.1 Monoid tables
[TABLE]
[TABLE]
[TABLE]
[TABLE]
4.2 Subalgebras of
From the tables before we get the following counts. We omit the codimension row as it’s trivial and also omit the dimension column since .
[TABLE]
[TABLE]
5 Beyond
For the analysis that follows, recall that we have defined . In Theorem 2 we have used and proved several properties that we’ll now formalize.
Property N**.**
* is a sub-partial-monoid of such that and .*
We notice the following:
Proposition 3**.**
Property N is equivalent to is a sub-partial-monoid of .
By the theory of monoids, these correspond to submonoids of with Frobenius number . Since we need only to analyze the maximal ones, in turn these can be characterized by their intersection with , where if is even or if is odd. For more background on monoids and submonoids of see [3].
We have seen the following being a key property of subalgebra , its maximal ideal and its set (which is determined by clearly).
Property M**.**
The pair has property M if , and implies .
Suppose furthermore that we have given a linear basis of with elements , … , , . Then for to belong to and , must be a linear combination of products with . Now, if were such that has no multiplicity as a set, then that can’t happen, given that the valuation of a sum with each summand of different valuations is the minimum of those valuations. This proves:
Proposition 4**.**
If has no multiplicity (i.e. in such that implies ), then has Property M.
Furthermore notice that the empty set (where as before), corresponds to the submonoid of given by , where if is even and otherwise. This is exactly the case of the ideal , hence . Thus we’ll exclude the empty set from analysis.
A further analysis also leads to consider the following property: A pair consisting of an ideal and its set satisfies almost-uniqueness if the following holds:
Property AU**.**
There exists a linear basis of monic elements indexed by such that for all pair of sets in (of size or ) and such that , taking the monic elements corresponding to them, the identity holds.
Proposition 5**.**
AU implies M.
Notice that a multiplicity free satisfies AU and both imply M.
Proof.
Same argument as above, follows by considering products with the same valuations, the main point is that there are no nontrivial cancellations. ∎
5.1
By the remarks before, these partial-monoids correspond with ones having Frobenius number . And those are in bijection with certain subsets of , namely those partial-sub-monoids that when extended won’t contain . Within the set , can’t contain nor since they divide , so only can contain but can’t contain both since then the extension would contain . End up with or which produce the maximal ones below, which correspond to and (as subsets of ).
\begin{array}[]{ | c | c | c | }\hline\cr\{0,4,7,8,9,10\}&2&\{x^{4}+ax^{5}+bx^{6},x^{7},x^{9},x^{10}\}\mid\text{any }a,b\in\mathbb{K}\\ \hline\cr\{0,3,6,8,9,10\}&3&\{x^{3}+ax^{4}+bx^{5}+cx^{7},x^{8},x^{10}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\end{array}
For , is spanned by hence .
For , a linear generating set of consists of the powers , where and clearly such a combination is never equal to .
Alternatively, and more simply, notice that the sets involved don’t have multiplicity.
5.2
The possible sets for , correspond with ones having Frobenius number . Such is determined by a partial-sum closed subset of and its union with minus the complement in .
Let’s analyze the minimum positive integer of inside . Such a set can’t contain , if contains then contains and can’t contain nor since and , so if contains , then it’s that produces . If doesn’t contain 2, but contains , then doesn’t have nor since and . Hence containing implies it’s . If contains might contain , so two possible or . Now if only contains from then have .
Produces the following possible sets for :
\begin{array}[]{ | c | c | c | }\hline\cr\{0,5,7,8,9,10,11\}&1&\{x^{5}+ax^{6},x^{7},x^{8},x^{9},x^{11}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,4,6,8,9,10,11\}&3&\{x^{4}+ax^{5}+bx^{7},x^{6}+cx^{7},x^{9},x^{11}\}\mid\text{any }a,b,c\in\mathbb{K}\\ \hline\cr\{0,4,5,8,9,10,11\}&4&\{x^{4}+ax^{6}+cx^{7},x^{5}+bx^{6}+dx^{7},x^{11}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,3,6,7,9,10,11\}&4&\{x^{3}+ax^{4}+bx^{5}+cx^{8},x^{7}+dx^{8},x^{11}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,2,4,6,8,10,11\}&4&\{x^{2}+ax^{3}+bx^{5}+cx^{7}+dx^{9},x^{11}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\end{array}
Let’s analyze one by one:
- •
has , no multiplicity.
- •
has , no multiplicity.
- •
has , no multiplicity.
- •
has , no multiplicity.
- •
and the algebra generators of , . This satisfies property AU, given that’s generated as algebra by two elements, namely and , the latter which is a null element, namely, annihilates .
5.3
The possible sets for , correspond with ones having Frobenius number . Such is determined by a partial-sum closed subset of and its union with minus the complement in .
Let’s analyze the minimum positive integer of inside . Need to avoid divisors of , so none of work. Hence only which gives rise to and which has no multiplicity.
5.4
The possible sets for , correspond with ones having Frobenius number . Such is determined by a partial-sum closed subset of and its union with minus the complement in . Let’s analyze the minimum positive integer of inside .
- •
least is , then contains can’t contain any other element since , , hence it’s
- •
least is , then can’t contain since , can’t contain since , and so it’s
- •
least is then can’t contain since and so can either contain or not , giving and
- •
least is , can contain , so ,
- •
least is gives
We exclude the analysis and algebra generators for from the following table in light of the next section (they turn out not to be always independent modulo ). For the rest, the analysis shows the validity of property AU:
\begin{array}[]{ | c | c | c | }\hline\cr\{0,6,8,9,10,11,12,13\}&1&\{x^{6}+ax^{7},x^{8},x^{9},x^{10},x^{11},x^{13}\}\mid\text{any }a\in\mathbb{K}\\ \hline\cr\{0,5,7,9,10,11,12,13\}&5&\{x^{5}+ax^{6}+bx^{8}+dx^{9},x^{7}+cx^{8}+ex^{9},x^{9},x^{11},x^{13}\}\mid\text{any }a,b,c,d,e\in\mathbb{K}\\ \hline\cr\{0,5,6,9,10,11,12,13\}&4&\{x^{5}+ax^{7}+cx^{8},x^{6}+bx^{7}+dx^{8},x^{9},x^{13}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,4,7,8,10,11,12,13\}&4&\{x^{4}+ax^{5}+bx^{6}+cx^{9},x^{7}+dx^{9},x^{10},x^{13}\}\mid\text{any }a,b,c,d\in\mathbb{K}\\ \hline\cr\{0,4,6,8,10,11,12,13\}&4&-\\ \hline\cr\{0,3,6,8,9,11,12,13\}&5&\{x^{3}+ax^{4}+bx^{5}+cx^{7}+dx^{10},x^{8}+ex^{10},x^{13}\}\mid\text{any }a,b,c,d,e\in\mathbb{K}\\ \hline\cr\{0,2,4,6,8,10,12,13\}&5&\{x^{2}+ax^{3}+bx^{5}+cx^{7}+dx^{9}+ex^{11},x^{13}\}\mid\text{any }a,b,c,d,e\in\mathbb{K}\\ \hline\cr\end{array}
Let’s analyze one by one:
- •
has , no multiplicity
- •
has , no multiplicity
- •
has , no multiplicity
- •
has , no multiplicity
- •
, here are algebra generators of . Here the (multi)set is , and the multiples of are the only ones giving rise to non-unique sums, i.e. if , then . From here the property AU follows.
- •
, here are algebra generators of . This satisfies property AU, given the the algebra is generated by two elements, namely and and the latter is a null element.
6 Minimal dimension for the existence of a non-thin subalgebra is
6.1 Main Result
We have an explicit classification of the -subalgebras of for . The purpose of this section is to show that for we get a non-thin subalgebra.
Theorem 6**.**
There exists a non-thin subalgebra of , denoted . Hence is the minimal with this property.
Proof.
Since we have shown that all subalgebras are thin for , we need to construct one for .
Consider the partial-monoid and the subalgebra generated by inside , which has elements:
- •
- •
- •
- •
- •
- •
From here it’s clear that the vector space with basis is closed under multiplication and hence it’s the sought after algebra, whose set of exponents is precisely . Notice that but . We can write the formula in as
[TABLE]
Furthermore, the sizes are , so , and the dimensions are , and so . Also, the set does have multiplicity: , which is to be expected given property AU.
∎
6.2 Count of the number of thin subalgebras in dimension
We have a generating set as algebra, not necessarily they’re independent modulo as we saw, . Notice and and hence it’s thin iff and arbitrary. Notice that since in any field, either or is not zero, we can always solve for either or , thereby one of them is arbitrary and the other is determined.
Similarly, for the set , a generating set (together with ) as an algebra is . And the identical calculation shows that the algebra is thin iff and are arbitrary. We obtain:
Proposition 7**.**
With exponent set , there are non-thin subalgebras of and thin ones. Also, there are non-thin subalgebras of with exponent set and thin ones.
In light of the analysis for carried out previously, we have:
Proposition 8**.**
For all partial-monoids except those containing (there are exactly two of those, namely and ), every subalgebra with exponent set is thin.
We have the table for algebras attached to (maximal) partial-monoid :
\begin{array}[]{| c | c | c | c | }\hline\cr\dim(\mathscr{m}/\mathscr{m}^{2})&\text{Generators}&\text{type}\\ \hline\cr 4&\{x^{4}+ax^{5}+bx^{7}+dx^{9},x^{6}+cx^{7}+ex^{9},x^{11},x^{13}\}\mid\text{any }a,b,c,d,e\text{ with }3a=2a\in\mathbb{K}&\text{ thin}\\ \hline\cr 3&\{x^{4}+ax^{5}+bx^{7}+dx^{9},x^{6}+cx^{7}+ex^{9},x^{11}\}\mid\text{any }a,b,c,d,e\text{ with }3a\neq 2a\in\mathbb{K}&\text{ non-thin}\\ \hline\cr\end{array}
6.3 Other results concerning non-thin subalgebras
Notice that the algebra found and its monoid has . And this is also minimal:
Proposition 9**.**
If or , then .
Proof.
By the inequality , the case follows since is always nonzero.
Assume for contradiction that is such that is one dimensional but . Then take monic elements with the minimal valuation and the other generator. By minimality of the valuation, since is one dimensional, generates as algebra hence must be a polynomial in (this is evident here, one reason being that is nilpotent, so the ideal generated by is the set of linear combinations of positive powers of ); and so the valuation is a multiple of , which is a contradiction with . ∎
As a corollary to the proof, we get that for a non-thin subalgebra, the minimum dimension of must be :
Proposition 10**.**
If , then .
One final question to consider is the size of , namely its number of elements. The set we found has elements. Here we’ll prove that’s the least one can do.
Proposition 11**.**
If , then .
Proof.
If there’s a counterexample to the statement, with minimal size , one would have , and , i.e. is a generator. Furthermore, a counterexample with minimal satisfies (Otherwise considering the algebra generated by the rest of the generators doesn’t contain and projecting to gives an embedding and an example with .) Henceforth we assume this. By above, we can assume . Denote the smallest element of by . If , then all products of elements in are zero, i.e. , and in that case, given the obvious inequality, , we have an equality . Hence we can assume that’s not the case, namely . And moreover, since is a generator of , hence contains at least elements , but if , then this set would equal and , which is not the case. Also notice that the element is always multiplicity-free, i.e. the equation with implies .
Hence we arrive at has elements and . In the two cases, we’ll show that we end up with a multiplicity free which by Proposition 4, implies has property N, which will be the desired contradiction. Cases:
- •
. Then by assumption and , hence . Since , this says that only one positive element is not a generator. By the above remark, that element is , and so any other sum is larger than . Hence and has no multiplicity.
- •
. Now .
If , then as before which has no multiplicity.
If instead , then we have exactly two positive elements in that are not generators. Denote by the next smallest element of . Notice that the smallest element in (as a set) is and the next smallest is , furthermore, this second element is also multiplicity free. Indeed if with , and if both , then which is not the case. Hence one is and the other is . We obtain that , which has no multiplicity.
∎
As a further observation, with the same notation in the proof, notice that since , then and so , with equality iff . And so in the case that is a generator, and . This shows how tight the set found is, since if , then and in fact does belong to . We obtain that is in a sense the minimal non-thin subalgebra:
Theorem 12**.**
The subalgebra is a minimal non-thin subalgebra in the following ways: is minimal, is minimal, is minimal and is minimal.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Francisco Franco Munoz, On minimal extensions of rings and applications, arxiv.org/abs/1712.02026
- 2[2] Francisco Franco Munoz, Subrings of Finite Commutative Rings, arxiv.org/abs/1712.02025
- 3[3] J. C. Rosales, J. C and P. A. García-Sánchez, P. A. Numerical semigroups. Developments in Mathematics, 20. Springer, New York, 2009
