Related papers: Length-Factoriality and Pure Irreducibility

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…

Left-modularity is a concept that generalizes modularity in lattice theory. In this paper, we give a characterization of left-modular elements and derive two formulae for the characteristic polynomial of a lattice with such an element, one…

We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups.…

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…

Let $D$ be a Krull domain admitting a prime element with finite residue field and let $K$ be its quotient field. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $D$,…

The non-empty finite subsets of a multiplicatively written monoid form a monoid under setwise multiplication. The same holds for finite subsets containing the identity element. Partly due to their unusual arithmetic properties, these…

Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

For numerical semigroups with a specified list of (not necessarily minimal) generators, we describe the asymptotic distribution of factorization lengths with respect to an arbitrary modulus. In particular, we prove that the factorization…

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

Let $H$ be a Krull monoid with finite class group $G$ and suppose that each class contains a prime divisor. Then every non-unit $a \in H$ has a factorization into atoms, say $a=u_1 \cdot\ldots \cdot u_k$ where $k$ is the factorization…

A commutative monoid $M$ is called a linearly orderable monoid if there exists a total order on $M$ that is compatible with the monoid operation. The finitary power monoid of a commutative monoid $M$ is the monoid consisting of all nonempty…

If $H$ is a monoid and $a=u_1 \cdots u_k \in H$ with atoms (irreducible elements) $u_1, \ldots, u_k$, then $k$ is a length of $a$, the set of lengths of $a$ is denoted by $\mathsf L(a)$, and $\mathcal L(H)=\{\,\mathsf L (a) \mid a \in H…

Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of so-called descent 1-cocyles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid…

The investigation and classification of non-unique factorization phenomena have attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P. Garcia-Sanchez, together with several co-authors, derived a…

This article aims to provide a novel formalization of the concept of computational irreducibility in terms of the exactness of functorial correspondence between a category of data structures and elementary computations and a corresponding…

A leading-twist factorization formula is derived for the longitudinal structure function in the x -->1 limit of deeply inelastic scattering. This is achieved by defining a new jet function which is gauge independent and probes the…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

A graph property (i.e., a set of graphs) is induced-hereditary or additive if it is closed under taking induced-subgraphs or disjoint unions. If $\cP$ and $\cQ$ are properties, the product $\cP \circ \cQ$ consists of all graphs $G$ for…

For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…