Related papers: Some Results on Factorization of Monoids
We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving…
In the study of factorizations of finite cyclic groups, a classical problem is to investigate the properties of factorization sets $A$ and $B$ in the direct sum decomposition $A \oplus B = \mathbb{Z}_{M}$ with $|A| = |B| =\sqrt{M}$, where…
In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a…
These notes present an approach to obtaining monoid operations which are compatible with a given family of mappings in the sense that the mappings become left translations in the monoid. This can be applied to various situations such as the…
In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not…
Suppose that we have a bicomplete closed symmetric monoidal quasi-abelian category $\mathcal{E}$ with enough flat projectives, such as the category of complete bornological spaces $\textbf{CBorn}_k$ or the category of inductive limits of…
The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…
Although multiplier bimonoids in general are not known to correspond to comonoids in any monoidal category, we classify them in terms of maps from the Catalan simplicial set to another suitable simplicial set; thus they can be regarded as…
We study processes with unstable particles in intermediate time-like states. It is shown that the amplitudes squared of such processes factor exactly in the framework of the model of unstable particles with continuous masses. Decay widths…
Using a construction that builds a monoid from a monoid action, this paper exhibits an example of a direct product of monoids that admits a prefix-closed regular cross-section, but one of whose factors does not admit a regular…
Monoids and groupoids are examples of poloids. On the one hand, poloids can be regarded as one-sorted categories; on the other hand, poloids can be represented by partial magmas of partial transformations. In this article, poloids are…
A monoid is aperiodic if all its subgroups are trivial. We completely classify all varieties of aperiodic monoids whose subvariety lattice is distributive.
In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…
We study factorizations of HOMFLY polynomials of certain knots and oriented links. We begin with a computer analysis of knots with at most 12 crossings, finding 17 non-trivial factorizations. Next, we give an irreducibility criterion for…
We extend the recent progress on the cocycle rigidity of partially hyperbolic homogeneous abelian actions to the setting with rank 1 factors in the universal cover. The method of proof relies on the periodic cycle functional and analysis of…
Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…
Unique factorization fails in many rings and monoids, but divisor and transfer homomorphisms provide tools to understand non-unique factorizations. In this expository article, we first explore these notions in the classical setting of…
The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…