English
Related papers

Related papers: On certain subsemigroups of finite oriented and or…

200 papers

The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a…

Group Theory · Mathematics 2008-07-09 Joao Araujo , Csaba Schneider

We prove, in particular, that if a subset A of {1, 2,..., N} has no nontrivial solution to the equation x_1+x_2+x_3+x_4+x_5=5y then the cardinality of A is at most N e^{-c(log N)^{1/7-eps}}, where eps>0 is an arbitrary number, and c>0 is an…

Number Theory · Mathematics 2011-06-09 Tomasz Schoen , Ilya D. Shkredov

We prove that the minimal cardinality of the semitransitive subsemigroup in the singular part $\IS_n\setminus \S_n$ of the symmetric inverse semigroup $\IS_n$ is $2n-p+1$, where $p$ is the greatest proper divisor of $n$, and classify all…

Group Theory · Mathematics 2023-08-10 Karin Cvetko-Vah , Damjana Kokol Bukovšek , Tomaž Košir , Ganna Kudryavtseva

Let $X$ be a nonempty set. Denote by $\mathcal{F}^n_k$ the class of associative operations $F\colon X^n\to X$ satisfying the condition $F(x_1,\ldots,x_n)\in\{x_1,\ldots,x_n\}$ whenever at least $k$ of the elements $x_1,\ldots,x_n$ are equal…

Rings and Algebras · Mathematics 2022-03-15 Miguel Couceiro , Jimmy Devillet , Jean-Luc Marichal , Pierre Mathonet

A smallest generating set of a semigroup is a generating set of the smallest cardinality. Similarly, an irredundant generating set $X$ is a generating set such that no proper subset of $X$ is also a generating set. A semigroup $S$ is…

Group Theory · Mathematics 2019-12-23 Julius Jonušas , Sascha Troscheit

We compute the cardinality $\mathfrak n_{\dim}(\mathcal M)$ of the sets of dimension functions on the ordered structures $\mathcal M$. The inequality $\mathfrak n_{\dim}(\mathcal M) \leq 1$ holds if $\mathcal M$ is a d-minimal expansion of…

Logic · Mathematics 2026-02-10 Masato Fujita

We prove that a map onto a nilpotent group $Q$ has finitely generated kernel if and only if the preimage of the positive cone is coarsely connected as a subset of the Cayley graph for every full archimedean partial order on $Q$. In case $Q$…

Group Theory · Mathematics 2023-11-02 Kevin Klinge

For an element $g$ of a group $G$, an Engel sink is a subset $\mathscr{E}(g)$ such that for every $ x\in G $ all sufficiently long commutators $ [x,g,g,\ldots,g] $ belong to $\mathscr{E}(g)$. Let $q$ be a prime, let $m$ be a positive…

Group Theory · Mathematics 2018-09-11 Cristina Acciarri , Pavel Shumyatsky , Danilo Sanção da Silveira

With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can…

Group Theory · Mathematics 2022-10-07 Igor Dolinka

Let $G$ be a finite group. In this short note, we give a criterion of nilpotency of $G$ based on the existence of elements of certain order in each section of $G$.

Group Theory · Mathematics 2018-02-13 Marius Tărnăuceanu

In this paper, we show that a locally graded group with a finite number m of non-(nilpotent of class at most n) subgroups is (soluble of class at most [log2(n)] + m + 3)-by-(finite of order $\le$ m!). Also we show that the derived length of…

Group Theory · Mathematics 2014-12-05 Mohammad Zarrin

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

Group Theory · Mathematics 2025-06-03 Andrea Lucchini , Patricia Medina Capilla

We define the notion of the partial order of ends of the Cayley graph of a semigroup. We prove that the structure of the ends of a semigroup is invariant under change of finite generating set and at the same time is inherited by…

Group Theory · Mathematics 2014-09-04 S. Craik , R. Gray , V. Kilibarda , J. D. Mitchell , N. Ruskuc

For a group $G$ and a finite set $A$, denote by $\text{End}(A^G)$ the monoid of all continuous shift commuting self-maps of $A^G$ and by $\text{Aut}(A^G)$ its group of units. We study the minimal cardinality of a generating set, known as…

Group Theory · Mathematics 2020-11-17 Alonso Castillo-Ramirez

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

Group Theory · Mathematics 2023-06-05 Attila Maróti , Saveliy V. Skresanov

In this paper we compute the rank and exhibit a presentation for the monoids of all $P$-stable and $P$-order preserving partial permutations on a finite set $\Omega$, with $P$ an ordered uniform partition of $\Omega$. These (inverse)…

Rings and Algebras · Mathematics 2019-05-29 Rita Caneco , Vítor H. Fernandes , Teresa M. Quinteiro

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…

Group Theory · Mathematics 2018-06-05 Luke Morgan , Cheryl E. Praeger , Kyle Rosa

In this work, we introduce the subgroups $D_m(G)$ and $D_{m,n}(G)$, defined in terms of the orders of products of coprime elements in a finite group $G$. We show that both subgroups are characteristic, that $D_{m,n}(G)$ is always nilpotent,…

Group Theory · Mathematics 2026-02-09 M. Amiri , I. Lima , S. Sousa

We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound…

Combinatorics · Mathematics 2024-07-23 Arsh Chhabra , Stephan Ramon Garcia , Christopher O'Neill

For a numerical semigroup $S := \langle n_1, \dots, n_k \rangle$ with minimal generators $n_1 < \cdots < n_k$, Barron, O'Neill, and Pelayo showed that $L(s+n_1) = L(s) + 1$ and $\ell(s+n_k) = \ell(s) + 1$ for all sufficiently large $s \in…

Commutative Algebra · Mathematics 2023-08-23 Baian Liu