Related papers: Factorization in Additive Monoids of Evaluation Po…
In classical factorization theory, an integral domain is called \emph{atomic} if every nonzero nonunit element can be written as a finite product of irreducible elements. Here, we introduce and study a weaker notion of atomicity, which…
We discuss various square-free factorizations in monoids in the context of: atomicity, ascending chain condition for principal ideals, decomposition, and a greatest common divisor property. Moreover, we obtain a full characterization of…
In a quaternion order of class number one, an element can be factored in multiple ways depending on the order of the factorization of its reduced norm. The fact that multiplication is not commutative causes an element to induce a…
The Huneke-Wiegand conjecture has prompted much recent research in Commutative Algebra. In studying this conjecture for certain classes of rings, Garc\'ia-S\'anchez and Leamer construct a monoid S_\Gamma^s whose elements correspond to…
Let $H^\times$ be the group of units of a multiplicatively written monoid $H$. We say $H$ is acyclic if $xyz \ne y$ for all $x, y, z \in H$ with $x \notin H^\times$ or $z \notin H^\times$; unit-cancellative if $yx \ne x \ne xy$ for all $x,…
A positive monoid is a submonoid of the nonnegative cone of a linearly ordered abelian group. The positive monoids of rank $1$ are called Puiseux monoids, and their atomicity, arithmetic of length, and factorization have been systematically…
Based on a theorem of Bergman we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following:…
An integral domain (or a commutative cancellative monoid) is atomic if every nonzero nonunit element is the product of irreducibles, and it satisfies the ACCP if every ascending chain of principal ideals eventually stabilizes. The interplay…
We study the structure of the commutative multiplicative monoid $\mathbb N_0[x]^*$ of all the non-zero polynomials in $\mathbb Z[x]$ with non-negative coefficients. We show that $\mathbb N_0[x]^*$ is not a half-factorial monoid and is not a…
It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain…
A semiring generalises the notion of a ring, replacing the additive abelian group structure with that of a commutative monoid. In this paper, we study a notion positioned between a ring and a semiring -- a semiring whose additive monoid is…
We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…
We discuss existence of factorizations with linear factors for (left) polynomials over certain associative real involutive algebras, most notably over Clifford algebras. Because of their relevance to kinematics and mechanism science, we put…
Given an arbitrary monic polynomial $f$ over a field $F$ of characteristic 0, we use companion matrices to construct a polynomial $M_f\in F[X]$ of minimum degree such that for each root $\alpha$ of $f$ in the algebraic closure of $F$,…
We investigate non-unique factorization of polynomials in Z_{p^n}[x] into irreducibles. As a Noetherian ring whose zero-divisors are contained in the Jacobson radical, Z_{p^n}[x] is atomic. We reduce the question of factoring arbitrary…
We study the globalization problem for a strong partial action $\alpha$ of a monoid $M$ on a semigroup $X$ via the associated rewriting system $(X_M^+,\to)$. We show that the local confluence of $(X_M^+,\to)$ is sufficient for the…
We consider real non-symmetric matrices and their factorisation as a product of real symmetric matrices. The number of complex eigenvalues of the original matrix reveals restrictions on such factorisations as we shall prove.
Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…
We obtain estimates on the number $|\mathcal{A}_{\boldsymbol{\lambda}}|$ of elements on a linear family $\mathcal{A}$ of monic polynomials of $\mathbb{F}_q[T]$ of degree $n$ having factorization pattern…
In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…