English
Related papers

Related papers: Structural aspects of semigroups based on digraphs

200 papers

A nonpolycyclic nilpotent-by-cyclic group Gamma can be expressed as the HNN extension of a finitely-generated nilpotent group N. The first main result is that quasi-isometric nilpotent-by-cyclic groups are HNN extensions of quasi-isometric…

Group Theory · Mathematics 2007-05-23 Ashley Reiter Ahlin

We study the problem of checking the existence of a step-by-step transformation of $d$-regular induced subgraphs in a graph, where $d \ge 0$ and each step in the transformation must follow a fixed reconfiguration rule. Our problem for $d=0$…

Data Structures and Algorithms · Computer Science 2021-11-30 Hiroshi Eto , Takehiro Ito , Yasuaki Kobayashi , Yota Otachi , Kunihiro Wasa

The set of supercharacter theories of a fixed group $G$ forms a natural lattice. An open question in the study of supercharacter theories is to classify this lattice, and to date, this has only been done for the cyclic groups…

Representation Theory · Mathematics 2016-12-22 Jonathan Lamar

Consider the conjugation action of the general linear group $\operatorname{GL}_{2}(K)$ on the polynomial ring $K[X_{2 \times 2}]$. When $K$ is an infinite field, the ring of invariants is a polynomial ring generated by the trace and the…

Commutative Algebra · Mathematics 2025-04-04 Aryaman Maithani

A semigroup (dynamical system) generated by $C^{1+\alpha}$-contracting mappings is considered. We call a such semigroup regular if the maximum $K$ of the conformal dilatations of generators, the maximum $l$ of the norms of the derivatives…

Dynamical Systems · Mathematics 2016-09-06 Yunping Jiang

The geometry of inverse semigroups is a natural topic of study, motivated both from within semigroup theory and by applications to the theory of non-commutative $C^*$-algebras. We study the relationship between the geometry of an inverse…

Group Theory · Mathematics 2025-12-04 Mark Kambites , Nóra Szakács

Let $H$ be a subdigraph of a digraph $D$. An ear of $H$ in $D$ is a path or a cycle in $D$ whose ends lie in $H$ but whose internal vertices do not. An \emph{ear decomposition} of a strong digraph $D$ is a nested sequence $(D_0,D_1,\ldots ,…

We classify the pairs $(C,G)$ where $C$ is a seminormal curve over an arbitrary field $k$ and $G$ is a smooth connected algebraic group acting faithfully on $C$ with a dense orbit, and we determine the equivariant Picard group of $C$. We…

Algebraic Geometry · Mathematics 2017-03-29 Bruno Laurent

Given a binary quasigroup $G$ of order $n$, a $d$-iterated quasigroup $G[d]$ is the $(d+1)$-ary quasigroup equal to the $d$-times composition of $G$ with itself. The Cayley table of every $d$-ary quasigroup is a $d$-dimensional latin…

Combinatorics · Mathematics 2021-08-20 Anna A. Taranenko

A k-digraph is an orientation of a multi-graph that is without loops and contains at most k edges between any pair of distinct vertices. We obtain necessary and sufficient conditions for a sequence of non-negative integers in non-decreasing…

Combinatorics · Mathematics 2007-05-23 S. Pirzada , U. Samee

A digraph $D$ with a subset $S$ of $V(D)$ is called $\boldsymbol{S}${\bf -strong} if for every pair of distinct vertices $u$ and $v$ of $S$, there is a $(u, v)$-dipath and a $(v, u)$-dipath in $D$. We define a digraph $D$ with a subset $S$…

Combinatorics · Mathematics 2024-06-21 Changchang Dong , Hong Yang , Jixiang Meng , Juan Liu

'A semigroup is completely regular if and only if it is a union of groups'- an analogue of this structure theorem of completely regular semigroup has been obtained in the setting of seminearrings in [[16], Mukherjee (Pal) et al., Semigroup…

Rings and Algebras · Mathematics 2025-07-10 Rajlaxmi Mukherjee , Tuhin Manna , Kamalika Chakraborty , Sujit Kumar Sardar

We give a thorough structural analysis of the principal one-sided ideals of arbitrary semigroups, and then apply this to full transformation semigroups and symmetric inverse monoids. One-sided ideals of these semigroups naturally occur as…

Group Theory · Mathematics 2019-11-19 James East

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

Rings and Algebras · Mathematics 2011-07-26 Simon M. Goberstein

We show that the semidirect product of a group $C$ by $A*_D B$ is isomorphic to the free product of $A\rtimes C$ and $B\rtimes C$ amalgamated at $D\rtimes C$, where $A$, $B$ and $C$ are arbitrary groups. Moreover, we apply this theorem to…

Group Theory · Mathematics 2018-01-03 Gabriel Zapata

A digraph $D=(V,A)$ of order $n\geq 3$ is pancyclic, whenever $D$ contains a directed cycle of length $k$ for each $k\in\{3,...,n\}$; and D is vertex-pancyclic iff, for each vertex $v\in V$ and each $k\in \{3,...,n\}$, $D$ contains a…

Combinatorics · Mathematics 2021-04-07 Narda Cordero-Michel , Hortensia Galeana-Sánchez

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

Combinatorics · Mathematics 2014-06-11 Tewodros Amdeberhan , Victor H. Moll

Let $k$ be an algebraically closed field of characteristic zero, and $k[[z]]$ the ring of formal power series over $k$. We provide several characterizations of right amenable finitely generated subsemigroups of $z^2k[[z]]$ with the…

Dynamical Systems · Mathematics 2023-01-27 Fedor Pakovich

The {\it inversion} of a set $X$ of vertices in a digraph $D$ consists of reversing the direction of all arcs of $D\langle X\rangle$. We study $sinv'_k(D)$ (resp. $sinv_k(D)$) which is the minimum number of inversions needed to transform…

Combinatorics · Mathematics 2025-12-12 Julien Duron , Frédéric Havet , Florian Hörsch , Clément Rambaud

A set $\mathcal{S}$ of derangements (fixed-point-free permutations) of a set $V$ generates a digraph with vertex set $V$ and arcs $(x,x^\sigma)$ for $x\in V$ and $\sigma\in\mathcal{S}$. We address the problem of characterising those…

Combinatorics · Mathematics 2020-08-31 Daniel Horsley , Moharram Iradmusa , Cheryl E. Praeger