English
Related papers

Related papers: Finite regular semigroups with permutations that m…

200 papers

We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…

Combinatorics · Mathematics 2009-09-21 Daniel Appel

We define and study the notion of a crossed module over an inverse semigroup and the corresponding $4$-term exact sequences, called crossed module extensions. For a crossed module $A$ over an $F$-inverse monoid $T$, we show that equivalence…

Group Theory · Mathematics 2021-11-11 Mikhailo Dokuchaev , Mykola Khrypchenko , Mayumi Makuta

In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…

Group Theory · Mathematics 2019-09-04 Andrey S. Mysovsky

Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…

Dynamical Systems · Mathematics 2007-05-23 T. Gannon

We define a new invariant of finitely generated representations of a finite group, with coefficients in a commutative noetherian ring. This invariant uses group cohomology and takes values in the singularity category of the coefficient…

Representation Theory · Mathematics 2024-09-10 Paul Balmer , Martin Gallauer

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

Formal Languages and Automata Theory · Computer Science 2024-06-04 Juha Honkala

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

Group Theory · Mathematics 2018-05-31 Marius Tărnăuceanu

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

Combinatorics · Mathematics 2025-05-06 Carmelo Cisto , Gioia Failla , Francesco Navarra

Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…

Logic · Mathematics 2016-12-16 Tobias Boege

We classify all non-degenerate skew-hermitian forms defined over certain local rings, not necessarily commutative, and study some of the fundamental properties of the associated unitary groups, including their orders when the ring in…

Rings and Algebras · Mathematics 2018-04-10 J. Cruickshank , F. Szechtman

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.

Group Theory · Mathematics 2015-10-26 John R. Britnell , Nick Gill

In what follows we generalize the notion of a complemented ring to rings that are not necessarily reduced. We then determine how our concepts fit in with other well-known classes of rings.

Rings and Algebras · Mathematics 2026-05-27 P. Bhattacharjee , W. Wm. McGovern , Y. Zhou

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

Logic · Mathematics 2015-12-11 Andreas Blass , Mauro Di Nasso

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 combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…

Number Theory · Mathematics 2017-12-12 Taekyun Kim , Dae san Kim

In this paper, we establish a one-to-one correspondence between the set of biclosed sets in an irreducible root system of type $A_n$ and the set of quasitrivial semigroup structures on a set with $n+1$ elements. Building on this…

Group Theory · Mathematics 2025-02-26 Weijia Wang , Rui Wang

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

We develop the theory of mixed finite elements in terms of special inverse systems of complexes of differential forms, defined over cellular complexes. Inclusion of cells corresponds to pullback of forms. The theory covers for instance…

Numerical Analysis · Mathematics 2015-06-25 Snorre Harald Christiansen

We survey new results on finite groups of birational transformations of algebraic varieties.

Algebraic Geometry · Mathematics 2021-12-28 Yuri Prokhorov

In this paper we introduce the definition of marked permutations. We first present a bijection between Stirling permutations and marked permutations. We then present an involution on Stirling derangements. Furthermore, we present a…

Combinatorics · Mathematics 2016-12-23 Guan-Huei Duh , Yen-chi Roger Lin , Shi-Mei Ma , Yeong-Nan Yeh
‹ Prev 1 8 9 10 Next ›