Related papers: Extremal factorization lengths of elements in comm…

Let $S=(s_n)_{n\geq 1}$ be a sequence with elements in a commutative monoid $(\mathcal{M},+,0)$. In this paper, we provide an explicit formula for $$\sum_{\la} C(\la) q^{\sum_{n\geq 1} \la_n\cdot s_n}$$ where $\la=(\la_1,\ldots)$ run…

For each prime $\ell$, let $|\cdot|_\ell$ be an extension to $\bar \Q$ of the usual $\ell$-adic absolute value on $\Q$. Suppose $g(z) = \sum_{n=0}^\infty c(n)q^n \in M_{k+\half}(N)$ is an eigenform whose Fourier coefficients are algebraic…

We derive a compact determinant formula for calculating and factorizing the hypersum polynomials S^{(L)}_k(N) \equiv \sum_{n_1=1}^N ...\sum_{n_{L+1}=1}^{n_{L}}(n_{L+1})^k expressed in the variable N(N+L+1)

A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…

Let $H$ be a commutative semigroup with unit element such that every non-unit can be written as a finite product of irreducible elements (atoms). For every $k \in \mathbb N$, let $\mathscr U_k (H)$ denote the set of all $\ell \in \mathbb N$…

Exponential Puiseux semirings are additive submonoids of $\qq_{\geq 0}$ generated by almost all of the nonnegative powers of a positive rational number, and they are natural generalizations of rational cyclic semirings. In this paper, we…

Let ${\mathfrak S}_n$ denote the symmetric group with $n$ letters, and $g(n)$ the maximal order of an element of ${\mathfrak S}_n$. If the standard factorization of $M$ into primes is $M=q_1^{\al_1}q_2^{\al_2}... q_k^{\al_k}$, we define…

This paper analyses stable commutator length in groups Z^r * Z^s. We bound scl from above in terms of the reduced wordlength (sharply in the limit) and from below in terms of the answer to an associated subset-sum type problem. Combining…

Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity determined by the factorization structure. For numerical…

Alanzi et al. (2022) investigated overpartition of a positive integer $n$ with $\ell$-regular non-overlined parts denoted by $\overline R_\ell^\ast (n)$, and proved some results for the case $\ell=3$. As extension to the results of Alanzi…

Let x be an element of a group G. For a positive integer n let E_n(x) be the subgroup generated by all commutators [...[[y,x],x],...,x] over y in G, where x is repeated n times. There are several recent results showing that certain…

The delta set of a numerical semigroup $S$, denoted $\Delta(S)$, is a factorization invariant that measures the complexity of the sets of lengths of elements in $S$. We study the following problem: Which finite sets occur as the delta set…

A semigroup $S$ is called a weakly exponential semigroup if, for every couple $(a,b)\in S\times S$ and every positive integer $n$, there is a non-negative integer $m$ such that $(ab)^{n+m}=a^nb^n(ab)^m=(ab)^ma^nb^n$. A semigroup $S$ is…

Let $\mathcal{PORD}_{n}$ be the semigroup consisting of all oriented and order-decreasing partial transformations on the finite chain $X_{n}=\{ 1<\cdots<n \}$. Let $\mathcal{IORD}_{n}$ be the subsemigroup of $\mathcal{PORD}_{n}$ consisting…

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…

Using the standard Coxeter presentation for the symmetric group $S_n$, two reduced expressions for the same group element are said to be commutation equivalent if we can obtain one expression from the other by applying a finite sequence of…

We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one…

An efficient integer factorization algorithm would reduce the security of all variants of the RSA cryptographic scheme to zero. Despite the passage of years, no method for efficiently factoring large semiprime numbers in a classical…

This paper is the third in a series of manuscripts that examine the combinatorics of the Kunz polyhedron $P_m$, whose positive integer points are in bijection with numerical semigroups (cofinite subsemigroups of $\mathbb Z_{\ge 0}$) whose…

Let $\mathcal O$ be a holomorphy ring in a global field $K$, and $R$ a classical maximal $\mathcal O$-order in a central simple algebra over $K$. We study sets of lengths of factorizations of cancellative elements of $R$ into atoms…