Related papers: Isolated factorizations and their applications in …
A group $G$ is said to be factorized into subsets $A_1, A_2, \ldots, A_s\subseteq G$ if every element $g$ in $G$ can be uniquely represented as $g=g_1g_2\ldots g_s$, where $g_i\in A_i$, $i=1,2,\ldots,s$. We consider the following…
This work focuses on the combinatorial properties of glued semigroups and provides its combinatorial characterization. Some classical results for affine glued semigroups are generalized and some methods to obtain glued semigroups are…
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…
We introduce the concept of multiplicatively closed subsets of a commutative ring $R$ which split an $R$-module $M$ and study factorization properties of elements of $M$ with respect to such a set. Also we demonstrate how one can utilize…
The main aim of this work is to introduce and justify the study of semi-covarities. A {\it semi-covariety} is a non-empty family $\mathcal{F}$ of numerical semigroups such that it is closed under finite intersections, has a minimum,…
Let H be an algebraic group scheme over a field k acting on a commutative k-algebra A which is a unique factorisation domain. We show that, under certain mild assumptions, the monoid of nonzero H-stable principal ideals in A is free…
This paper classifies the factorizations of almost simple groups with a factor having at least two nonsolvable composition factors. This together with a previous classification result of the authors reduces the factorization problem of…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
An affine semigroup is a finitely generated subsemigroup of $(\mathbb Z_{\ge 0}^d, +)$, and a numerical semigroup is an affine semigroup with $d = 1$. A growing body of recent work examines shifted families of numerical semigroups, that is,…
Given a saturated fusion system $\mathcal{F}$ over a finite $p$-group $S$, we provide criteria to determine when uniqueness of factorization into irreducible $\mathcal{F}$--invariant representations holds. We use them to prove uniqueness of…
In this paper we develop a new approach for studying differential operators of an isolated singularity graded hypersurface ring $R$ defining a surface in affine three-space over a field of characteristic zero. With this method, we construct…
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…
We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…
In this article, we study the elements with disconnected centralizer in the Brauer complex associated to a simple algebraic group G defined over a finite field with corresponding Frobenius map F and derive the number of F-stable semisimple…
A subset $S$ of an integral domain $R$ is called a semidomain provided that the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities. The study of factorizations in integral domains was initiated by Anderson, Anderson, and…
We give a sufficient condition for a monomial ideal to have a nonzero Betti number in each multidegree. In the case of facet ideals of simplicial forests, this condition becomes a necessary one and it allows us to characterize Betti…
We consider spatial discretizations by the finite section method of the restricted group algebra of a finitely generated discrete group, which is represented as a concrete operator algebra via its left-regular representation. Special…
We give an algorithm with singly exponential complexity for computing the barcodes up to dimension $\ell$ (for any fixed $\ell \geq 0$) of the filtration of a given semi-algebraic set by the sub-level sets of a given polynomial. Our…
In an earlier publication, the last two authors showed that a finite-dimensional module for a quantum affine algebra of type $A$ whose $q$-factorization graph is totally ordered is prime. In this paper, we continue the investigation of the…
This paper studies the problem of decomposing a low-rank positive-semidefinite matrix into symmetric factors with binary entries, either $\{\pm 1\}$ or $\{0,1\}$. This research answers fundamental questions about the existence and…