English
Related papers

Related papers: Extremal factorization lengths of elements in comm…

200 papers

We study the structure of nilpotent subsemigroups in the semigroup $M(n,\mathbb{F})$ of all $n\times n$ matrices over a field, $\mathbb{F}$, with respect to the operation of the usual matrix multiplication. We describe the maximal…

Group Theory · Mathematics 2010-04-02 Ganna Kudryavtseva , Volodymyr Mazorchuk

Arithmetical invariants---such as sets of lengths, catenary and tame degrees---describe the non-uniqueness of factorizations in atomic monoids. We study these arithmetical invariants by the monoid of relations and by presentations of the…

Commutative Algebra · Mathematics 2010-06-23 Víctor Blanco , Pedro A. García-Sánchez , Alfred Geroldinger

We look at extensions of formulas given by Jovovic and recently proved by Dhar on integer partitions where the smallest part occurs at least $m$ times and on integer partitions with fixed differences between the largest and smallest parts…

Combinatorics · Mathematics 2024-01-08 Pankaj Jyoti Mahanta , Manjil P. Saikia

Given a positive integer $m$, let $\mathbb{Z}_m$ be the set of residue classes mod $m$. For $A\subseteq \mathbb{Z}_m$ and $n\in \mathbb{Z}_m$, let $\sigma_A(n)$ be the number of solutions to the equation $n=x+y$ with $x,y\in A$. Let…

Number Theory · Mathematics 2024-07-11 Guangping Liang , Yu Zhang , Haode Zuo

The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…

Representation Theory · Mathematics 2023-11-09 Steven Benzel , Scott Conner , Nham Ngo , Khang Pham

For a cancellative semigroup S and a field F, it is proved that the semigroup algebra FS is centrally essential if and only if the group of fractions $G_S$ of the semigroup $S$ exists and the group algebra $FG_S$ of $G_S$ is centrally…

Rings and Algebras · Mathematics 2022-05-10 Oleg Lyubimtsev , Askar Tuganbaev

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…

Number Theory · Mathematics 2025-04-04 Derong Qiu

Let $f: \mathbb{Z}_+\rightarrow \mathbb{Z}_+$ be a polynomial with the property that corresponding to every prime $p$ there exists an integer $\ell$ such that $p\nmid f(\ell)$. In this paper, we establish some equidistributed results…

Number Theory · Mathematics 2021-03-31 Nian Hong Zhou

If $S$ is a discrete semigroup, then $\beta S$ has a natural, left-topological semigroup structure extending $S$. Under some very mild conditions, $U(S)$, the set of uniform ultrafilters on $S$, is a two-sided ideal of $\beta S$, and…

Rings and Algebras · Mathematics 2015-05-11 Will Brian

In this paper we characterize surjective isometries on certain classes of non-commutative spaces associated with semi-finite von Neumann algebras: the Lorentz spaces $L^{w,1}$, as well as the spaces $L^1+L^\infty$ and $L^1\cap L^\infty$.…

Operator Algebras · Mathematics 2020-12-16 Pierre de Jager , Jurie Conradie

We obtain a nontrivial upper bound for almost all elements of the sequences of real numbers which are multiplicative and at the prime indices are distributed according to the Sato--Tate density. Examples of such sequences come from…

Number Theory · Mathematics 2014-09-23 Florian Luca , Maksym Radziwill , Igor E. Shparlinski

In the problem of the longest common substring with $k$ mismatches we are given two strings $X, Y$ and must find the maximal length $\ell$ such that there is a length-$\ell$ substring of $X$ and a length-$\ell$ substring of $Y$ that differ…

Data Structures and Algorithms · Computer Science 2020-04-29 Garance Gourdel , Tomasz Kociumaka , Jakub Radoszewski , Tatiana Starikovskaya

The set $\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ of all finite subsets of $\mathbb{N}_0$ containing the zero element is a monoid with set addition as operation. If a set $A\in\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ can be written in the…

Commutative Algebra · Mathematics 2025-08-15 Andreas Reinhart

Let $\mathbb G = (G, +)$ be a group (either abelian or not). Given $X, Y \subseteq G$, we denote by $\langle Y \rangle$ the subsemigroup of $\mathbb G$ generated by $Y$, and we set $$\gamma(Y) := \sup_{y_0 \in Y} \inf_{y_0 \ne y \in Y} {\rm…

Combinatorics · Mathematics 2016-05-05 Salvatore Tringali

For a given positive integers $m$ and $\ell$, we give a complete list of positive integers $n$ for which their exist $m$th roots of unity $x_1,\dots,x_n \in \mathbb{C}$ such that $x_1^{\ell} + \cdots + x_n^{\ell}=0$. This extends the…

Number Theory · Mathematics 2016-03-04 Neeraj Kumar , K. Senthil Kumar

The set of hook lengths of an integer partition $\lambda$ is the complement of some numerical semigroup $S$. There has been recent interest in studying the number of partitions with a given set of hook lengths. Very little is known about…

Combinatorics · Mathematics 2026-04-29 Nathan Kaplan , Kaylee Kim , Cole McGeorge , Fabian Ramirez , Deepesh Singhal

We investigate random minimal factorizations of the $n$-cycle, that is, factorizations of the permutation $(1 \, 2 \cdots n)$ into a product of cycles $\tau_1, \ldots, \tau_k$ whose lengths $\ell(\tau_1), \ldots, \ell(\tau_k)$ verify the…

Probability · Mathematics 2020-02-28 Paul Thevenin

Let $G=C_n\oplus C_{mn}$ with $n\geq 2$ and $m\geq 1$, and let $k\in [0,n-1]$. It is known that any sequence of $mn+n-1+k$ terms from $G$ must contain a nontrivial zero-sum of length at most $mn+n-1-k$. The associated inverse question is to…

Number Theory · Mathematics 2021-09-22 David J. Grynkiewicz , Chao Liu

Let $G$ be a finite group. The small Davenport constant $\mathsf d(G)$ of $G$ is the maximal integer $\ell$ such that there is a sequence of length $\ell$ over $G$ which has no nonempty product-one subsequence. In 2007, Bass conjectured…

Combinatorics · Mathematics 2025-02-20 Guoqing Wang , Yang Zhao

Let $H$ be a Krull monoid with class group $G$ and suppose that each class contains a prime divisor. Then every element $a \in H$ has a factorization into irreducible elements, and the set $\mathsf L (a)$ of all possible factorization…

Commutative Algebra · Mathematics 2015-05-25 Alfred Geroldinger , Wolfgang Schmid