Related papers: Elements with unique length factorization of a num…
In this paper, we study some of the factorization aspects of rational multicyclic monoids, that is, additive submonoids of the nonnegative rational numbers generated by multiple geometric sequences. In particular, we provide a complete…
In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…
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…
Let $S$ be a polynomial ring in $n$ variables over a field $K$ of characteristic $0$. A numerical characterization of all possible extremal Betti numbers of any graded submodule of a finitely generated graded free $S$-module is given.
We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…
We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…
In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such…
We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…
There has been significant recent interest in studying how the number of numerical semigroups of genus $g$ behaves as a function of $g$. Bras-Amor\'os has shown how to organize the collection of numerical semigroups of genus $g$ into a…
Finite elements, which are well-known and studied in the framework of vector lattices, are investigated in $\ell$-algebras, preferably in $f$-algebras, and in product algebras. The additional structure of an associative multiplication leads…
A connected component of an affine algebraic group is called periodic if all its elements have finite order. We give a characterization of periodic components in terms of automorphisms with finite number of fixed points. It is also…
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…
In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…
We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…
In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved
Motivated by intuitive properties of physical quantities, the notion of a non-anomalous semigroup is formulated. These are totally ordered semigroups where there are no `infinitesimally close' elements. The real numbers are then defined as…
The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…
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$,…
A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…
We count factorizations of Singer cycles as products of reflections in the families of special and general unitary and linear groups over a finite field. In the case of minimum-length factorizations, the resulting answer is a striking…