English
Related papers

Related papers: On semigroups of orientation-preserving partial pe…

200 papers

In this paper, we characterize the monoid of endomorphisms of the semigroup of all monotone full transformations of a finite chain, as well as the monoids of endomorphisms of the semigroup of all monotone partial transformations and of the…

Rings and Algebras · Mathematics 2022-05-04 De Biao Li , Vítor H. Fernandes

Let $V$ be a vector space and $U$ a fixed subspace of $V$. We denote the semigroup of all linear transformations on $V$ under composition of functions by $L(V)$. In this paper, we study the semigroup of all linear transformations on $V$…

Rings and Algebras · Mathematics 2024-11-25 Kritsada Sangkhanan

Following the new description of an oriented full transformation on a finite chain given recently by Higgins and Vernitski in "Orientation-preserving and orientation-reversing mappings: a new description", Semigroup Forum 104 (2022),…

Rings and Algebras · Mathematics 2024-03-20 Vítor H. Fernandes

Here we introduce the notion of (left, right) $\pi$-$t$-simple, right $\pi$-inverse ordered semigroups and discuss characterizations and relationships concerning them. Semilattice decomposition of left $\pi$-$t$-simple ordered semigroups…

Group Theory · Mathematics 2024-07-23 A. Jamadar

Let $\mathcal M_{mn}=\mathcal M_{mn}(\mathbb F)$ denote the set of all $m\times n$ matrices over a field $\mathbb F$, and fix some $n\times m$ matrix $A\in\mathcal M_{nm}$. An associative operation $\star$ may be defined on $\mathcal…

Group Theory · Mathematics 2017-12-14 Igor Dolinka , James East

We prove that any class of permutations defined by avoiding a partially ordered pattern (POP) with height at most two has a regular insertion encoding and thus has a rational generating function. Then, we use Combinatorial Exploration to…

Combinatorics · Mathematics 2023-12-14 Christian Bean , Émile Nadeau , Jay Pantone , Henning Ulfarsson

Let $G$ be a semiabelian variety defined over an algebraically closed field $K$, endowed with a rational self-map $\Phi$. Let $\alpha\in G(K)$ and let $\Gamma\subseteq G(K)$ be a finitely generated subgroup. We show that the set…

Number Theory · Mathematics 2022-10-10 Jason P. Bell , Dragos Ghioca

For an element a in a semigroup S the local subsemigroup of S with respect to a is the subsemigroup aSa of S and the variant of S with respect to a is a semigroup with underlying set S with a sandwich operation xy = xay for all x, y in S.…

Group Theory · Mathematics 2019-10-31 Siji Michael , P. G. Romeo

In this paper we classify the maximal subsemigroups of the \emph{full transformation semigroup} $\Omega^\Omega$, which consists of all mappings on the infinite set $\Omega$, containing certain subgroups of the symmetric group $\sym(\Omega)$…

Rings and Algebras · Mathematics 2013-02-13 J. East , J. D. Mitchell , Y. Péresse

We study the semigroup extension $\mathscr{I}_\lambda^n(S)$ of a semigroup $S$ by symmetric inverse semigroups of a bounded finite rank. We describe idempotents and regular elements of the semigroups $\mathscr{I}_\lambda^n(S)$ and…

Group Theory · Mathematics 2019-06-21 Oleg Gutik , Oleksandra Sobol

The set of all subsets of any inverse semigroup forms an involution semiring under set-theoretical union and element-wise multiplication and inversion. We find structural conditions on a finite inverse semigroup guaranteeing that neither…

Group Theory · Mathematics 2024-03-13 Igor Dolinka , Sergey V. Gusev , Mikhail V. Volkov

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

Combinatorics · Mathematics 2007-05-23 Robert Guralnick , David Perkinson

Let $G$ be a graph on $n$ vertices, labeled $v_1,\ldots,v_n$ and $\pi$ be a permutation on $[n]:=\{1,2,\cdots, n\}$. Suppose that each pebble $p_i$ is placed at vertex $v_{\pi(i)}$ and has destination $v_i$. During each step, a disjoint set…

Combinatorics · Mathematics 2016-09-01 Junhua He , Louis A. Valentin , Xiaoyan Yin , Gexin Yu

In this paper we deal with the following problem: how does the structure of a finite semigroup $S$ depend on the probability that two elements selected at random from $S$, with replacement, define the same inner right translation of $S$. We…

Group Theory · Mathematics 2023-10-17 Attila Nagy , Csaba Tóth

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

Geometric Topology · Mathematics 2025-04-30 Michael Magee , Doron Puder , Ramon van Handel

A partially ordered pattern (abbreviated POP) is a partially ordered set (poset) that generalizes the notion of a pattern when we are not concerned with the relative order of some of its letters. The notion of partially ordered patterns…

Combinatorics · Mathematics 2025-07-17 Lintong Wang , Sherry H. F. Yan

This paper introduces the notion of orbit coherence in a permutation group. Let $G$ be a group of permutations of a set $\Omega$. Let $\pi(G)$ be the set of partitions of $\Omega$ which arise as the orbit partition of an element of $G$. The…

Group Theory · Mathematics 2012-06-05 John R. Britnell , Mark Wildon

We prove new results on inheritance of Green's relations by subsemigroups in the presence of stability of elements. We provide counterexamples in other cases to show in particular that not all right-stable semigroups are embeddable in…

Group Theory · Mathematics 2019-07-11 James East , Peter M. Higgins

We review selected known results on partially ordered patterns (POPs) that include co-unimodal, multi- and shuffle patterns, peaks and valleys ((modified) maxima and minima) in permutations, the Horse permutations and others. We provide…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev

We give a positive answer to a question raised by Davis et al. ({\em Discrete Mathematics} 341, 2018), concerning permutations with the same pinnacle set. Given $\pi\in S_n$, a {\em pinnacle} of $\pi$ is an element $\pi_i$ ($i\neq 1,n$)…

Data Structures and Algorithms · Computer Science 2020-01-29 Irena Rusu
‹ Prev 1 4 5 6 7 8 10 Next ›