Related papers: Finite Generation in Polynomial Semirings
It is a classical result that the direct product AxB of two groups is finitely generated (finitely presented) if and only if A and B are both finitely generated (finitely presented). This is also true for direct products of monoids, but not…
Let $R$ be a complete regular local ring with an algebraically closed residue field and let $A$ be a Noetherian $R$-subalgebra of the polynomial ring $R[X]$. It has been shown in \cite{DO2} that if $\dim R=1$, then $A$ is necessarily…
Motivated by a question of A. Rapinchuk concerning general reductive groups, we are investigating the following question: Given a finitely generated integral domain $R$ with field of fractions $F$, is there a \emph{finitely generated…
We investigate rank revealing factorizations of $m \times n$ polynomial matrices $P(\lambda)$ into products of three, $P(\lambda) = L(\lambda) E(\lambda) R(\lambda)$, or two, $P(\lambda) = L(\lambda) R(\lambda)$, polynomial matrices. Among…
For an integral domain $R$ and a commutative cancellative monoid $M$, the ring consisting of all polynomial expressions with coefficients in $R$ and exponents in $M$ is called the monoid ring of $M$ over $R$. An integral domain is called…
Subalgebras of upper triangular matrix algebras have played a fundamental role in the classification of minimal varieties of polynomial growth. Such classification has become a source of study in recent years since it leads to the more…
A semidomain is a subsemiring of an integral domain. One can think of a semidomain as an integral domain in which additive inverses are no longer required. A semidomain $S$ is additively reduced if $0$ is the only invertible element of the…
A semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse. A po-semiring is a semiring equipped with a compatible bounded partial order. In this paper, properties of…
Much study has been done on semigroups which are unions of groups. There are several ways in which a union of groups can be made into a semigroup in which each of the component groups arises as subgroups of the constructed semigroup. An…
We study the finite basis problem for $4$-element additively idempotent semirings whose additive reducts have two minimal elements and one coatom. Up to isomorphism, there are $112$ such algebras. We show that $106$ of them are finitely…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
In this short note we count the finite semirings up to isomorphism, and up to isomorphism and anti-isomorphism for some small values of $n$; for which we utilise the existing library of small semigroups in the GAP package Smallsemi.
A numerical set $T$ is a subset of $\mathbb N_0$ that contains $0$ and has finite complement. The atom monoid of $T$ is the set of $x \in \mathbb N_0$ such that $x+T \subseteq T$. Marzuola and Miller introduced the anti-atom problem: how…
Let $G$ be a finite group. A finite unordered sequence $S = g_1 \boldsymbol{\cdot} \ldots \boldsymbol{\cdot} g_{\ell}$ of terms from $G$, where repetition is allowed, is a product-one sequence if its terms can be ordered such that their…
We study the ideals of the partition, Brauer, and Jones monoid, establishing various combinatorial results on generating sets and idempotent generating sets via an analysis of their Graham--Houghton graphs. We show that each proper ideal of…
Let $\mathcal{C}$ be a class of finite groups closed for subgroups, quotients groups and extensions. Let $\Gamma$ be a finite simplicial graph and $G = G_{\Gamma}$ be the corresponding pro-$\mathcal C$ RAAG. We show that if $N$ is a…
It is well known that the ring of polynomial invariants of a reductive group is finitely generated. However, it is difficult to give strong upper bounds on the degrees of the generators, especially over fields of positive characteristic. In…
Multiplicative order of an element $a$ of group $G$ is the least positive integer $n$ such that $a^n=e$, where $e$ is the identity element of $G$. If the order of an element is equal to $|G|$, it is called generator or primitive root. This…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
Under suitable conditions on a family $(I(t))_{t\ge 0}$ of Lipschitz mappings on a complete metric space, we show that up to a subsequence the strong limit $S(t):=\lim_{n\to\infty}(I(t 2^{-n}))^{2^n}$ exists for all dyadic time points $t$,…