English
Related papers

Related papers: Chains of subsemigroups

200 papers

The LYM inequality is a fundamental result concerning the sizes of subsets in a Sperner family. Subsequent studies on the LYM inequality have been generalized to families of $r$-decompositions, where all components are required to avoid…

Combinatorics · Mathematics 2026-03-17 Zihao Huang , Weikang Liang , Yujiao Ma , Suijie Wang

We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…

Combinatorics · Mathematics 2011-04-08 Svante Janson

A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…

Group Theory · Mathematics 2022-11-14 Victoria Gould , Craig Miller , Thomas Quinn-Gregson , Nik Ruskuc

We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same…

Formal Languages and Automata Theory · Computer Science 2014-03-03 Szabolcs Ivan , Judit Nagy-Gyorgy

For a finite group $G$ we investigate the difference between the maximum size MaxDim$(G)$ of an "independent" family of maximal subgroups of $G$ and maximum size $m(G)$ of an irredundant sequence of generators of $G$. We prove that…

Group Theory · Mathematics 2015-02-25 Eloisa Detomi , Andrea Lucchini

Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…

Commutative Algebra · Mathematics 2024-09-05 D. Marín-Aragón , R. Tapia-Ramos

We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite…

Group Theory · Mathematics 2011-08-02 Robert Gray , Nik Ruskuc

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…

Formal Languages and Automata Theory · Computer Science 2013-10-21 Ines Klimann , Jean Mairesse , Matthieu Picantin

In this paper, we introduce several notions of "dimension" of a finite group, involving sizes of generating sets and certain configurations of maximal subgroups. We focus on the inequality $m(G) \leq \mathrm{MaxDim}(G)$, giving a family of…

Group Theory · Mathematics 2015-02-03 Ravi Fernando

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

Group Theory · Mathematics 2020-04-28 Georgina Bumpus , Christoph Haase , Stefan Kiefer , Paul-Ioan Stoienescu , Jonathan Tanner

We determine the groups of minimal order in which all groups of order n can embedded for 1 < n < 16. We further determine the order of a minimal group in which all groups or order n or less can be embedded, also for 1 < n < 16.

Group Theory · Mathematics 2017-06-29 Robert Heffernan , Des MacHale , Brendan McCann

We develop a general approach to the study of maximal nilpotent subsemigroups of finite semigroups. This approach can be used to recover many known classifications of maximal nilpotent subsemigroups, in particular, for the symmetric inverse…

Group Theory · Mathematics 2010-04-02 Olexandr Ganyushkin , Volodymyr Mazorchuk

Using Rees index, the subsemigroup growth of free semigroups is investigated. Lower and upper bounds for the sequence are given and it is shown to have superexponential growth of strict type $n^n$ for finite free rank greater than 1. It is…

Group Theory · Mathematics 2014-09-30 Alex Bailey , Martin Finn-Sell , Robert Snocken

We construct, for each real number $0\leq \alpha \leq 1$, a random walk on a finitely generated semigroup whose speed exponent is $\alpha$. We further show that the speed function of a random walk on a finitely generated semigroup can be…

Group Theory · Mathematics 2025-04-15 Guy Blachar , Be'eri Greenfeld

We study spherical completeness of ball spaces and its stability under expansions. We introduce the notion of an ultra-diameter, mimicking diameters in ultrametric spaces. We prove some positive results on preservation of spherical…

Logic · Mathematics 2021-08-25 Wieslaw Kubiś , Franz-Viktor Kuhlmann

Given a semigroup $S$, for each Green's relation $\mathcal{K}\in\{\mathcal{L},\mathcal{R},\mathcal{J},\mathcal{H}\}$ on $S,$ the $\mathcal{K}$-height of $S,$ denoted by $H_{\mathcal{K}}(S),$ is the height of the poset of…

Combinatorics · Mathematics 2024-07-12 Matthew Brookes , Craig Miller

For a finite group $G$, we investigate the behaviour of four invariants, $\text{MaxDim}(G),$ $\text{MinDim}(G),$ $\text{MaxInt}(G)$ and $\text{MinInt}(G),$ measuring in some way the width and the height of the lattice $\mathcal M(G)$…

Group Theory · Mathematics 2020-12-15 Andrea Lucchini

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

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

In this note, we consider the semigroup $O(X)$ of all order endomorphisms of an infinite chain $X$ and the subset $J$ of $O(X)$ of all transformations $\alpha$ such that $|Im(\alpha)|=|X|$. For an infinite countable chain $X$, we give a…

Rings and Algebras · Mathematics 2021-11-25 Ilinka Dimitrova , Vítor H. Fernandes , Jörg Koppitz
‹ Prev 1 3 4 5 6 7 10 Next ›