English
Related papers

Related papers: Chains of subsemigroups

200 papers

The enumeration of zero-sum subsequences of a given sequence over finite cyclic groups is one classical topic, which starts from one question of P. Erd\H{o}s. In this paper, we consider this problem in a more general setting -- finite…

Combinatorics · Mathematics 2025-05-02 Guoqing Wang , Yang Zhao , Xingliang Yi

Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…

Group Theory · Mathematics 2014-03-10 Igor Dolinka , Nik Ruškuc

In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…

Group Theory · Mathematics 2020-07-23 Sandeep Dalal , Jitender Kumar

In this paper, we determine the relative rank of the semigroup $T(X,Y)$ of all transformations on a finite chain $X$ with restricted range $Y \subseteq X$ modulo the set $OP(X,Y)$ of all orientation-preserving transformation in $T(X,Y)$.…

Rings and Algebras · Mathematics 2022-06-27 Ilinka Dimitrova , Jörg Koppitz

We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…

Rings and Algebras · Mathematics 2019-09-24 Miguel Couceiro , Jimmy Devillet

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

Probability · Mathematics 2015-03-20 Kari Eloranta

In this work, we study good semigroups of $\mathbb{N}^n$ introducing the definition of length and genus for these objects. We show how to count the local good semigroup with a fixed genus. Furthermore, we study the relationships of these…

Commutative Algebra · Mathematics 2020-06-02 Nicola Maugeri , Giuseppe Zito

The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered…

Group Theory · Mathematics 2019-05-13 A. Jamadar , K. Hansda

This paper is a survey on the works [MS77, MS79, MS81] on maximal subgroups in finitely generated linear groups, and the works that followed it [GG08, GG13b, GG13a, Kap03, Iva92, HO16, GM16, AGS14, Sf90, Sf98, Per05, AKT16, FG18, GS17]…

Group Theory · Mathematics 2020-01-22 Tsachik Gelander , Yair Glasner , Gregory Soifer

For each subchain $X'$ of a chain $X$, let $T_{RE}(X, X')$ denote the semigroup under composition of all full regressive transformations, $\alpha:X\rightarrow X'$ satisfying $x\alpha\leq x$ for all $x\in X$. Necessary and sufficient…

Rings and Algebras · Mathematics 2012-10-05 Patanee Udomkavanich , Phichet Jitjankarn

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

Group Theory · Mathematics 2019-12-03 Mark Pengitore

We study the maximal subgroups of branch groups and obtain a criterion that ensures that certain spinal groups are contained in the class $\mathcal{MF}$ of groups with all maximal subgroups of finite index. This allows us to construct…

Group Theory · Mathematics 2024-10-10 Mikel Eguzki Garciarena , J. Moritz Petschick

Let $G$ be an additive finite abelian group. A sequence over $G$ is called a minimal zero-sum sequence if the sum of its terms is zero and no proper subsequence has this property. Davenport's constant of $G$ is the maximum of the lengths of…

Number Theory · Mathematics 2010-01-14 Wolfgang A. Schmid

Suppose that G is a linearly reductive group. We study the minimal free resolution of the invariant ring. If G is a finite linearly reductive group, then the ring of invariants is generated in degree at most |G|, the group order. We prove…

Commutative Algebra · Mathematics 2007-05-23 Harm Derksen

We determine upper bounds for the maximum order of an element of a finite almost simple group with socle T in terms of the minimum index m(T) of a maximal subgroup of T: for T not an alternating group we prove that, with finitely many…

Group Theory · Mathematics 2013-01-23 Simon Guest , Joy Morris , Cheryl Praeger , Pablo Spiga

We classify minimal transitive subsemigroups of the finitary inverse symmetric semigroup modulo the classification of minimal transitive subgroups of finite symmetric groups; and semitransitive subsemigroups of the finite inverse symmetric…

We present new, and mostly sharp, bounds on the maximum length of certain generalizations of Davenport-Schinzel sequences. Among the results are sharp bounds on order-$s$ {\em double DS} sequences, for all $s$, sharp bounds on sequences…

Combinatorics · Mathematics 2014-01-23 Seth Pettie

In this article, we study the maximal cross number of long zero-sumfree sequences in a finite Abelian group. Regarding this inverse-type problem, we formulate a general conjecture and prove, among other results, that this conjecture holds…

Number Theory · Mathematics 2010-10-19 Benjamin Girard

In this article we show that the semigroup operation of a strictly linearly ordered semigroup on a real interval is automatically continuous if each element of the semigroup admits a square root. Hence, by a result of Acz\'el, such a…

Classical Analysis and ODEs · Mathematics 2014-05-07 Jochen Glück

The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup…

Formal Languages and Automata Theory · Computer Science 2014-06-20 Janusz Brzozowski , Marek Szykuła
‹ Prev 1 4 5 6 7 8 10 Next ›