相关论文: Ranks of ideals in inverse semigroups of difunctio…

For a finite abelian group $G$ and a positive integer $k$, let $\mathsf{D}_k(G)$ denote the smallest integer $\ell$ such that each sequence over $G$ of length at least $\ell$ has $k$ disjoint nontrivial zero-sum subsequences. It is known…

For $n \in \mathbb{N}$, let $[n] = \{1, 2, \ldots, n\}$ be an $n$ - element set. As usual, we denote by $I_n$ the symmetric inverse semigroup on $[n]$, i.e. the partial one-to-one transformation semigroup on $[n]$ under composition of…

A fence is a particular partial order on a (finite) set, close to the linear order. In this paper, we calculate the rank of the semigroup $\mathcal{FI}_{n}$ of all order-preserving partial injections on an $n$-element fence. In particular,…

We study a twist on the classic secretary problem, which we term the secretary ranking problem: elements from an ordered set arrive in random order and instead of picking the maximum element, the algorithm is asked to assign a rank, or…

The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a…

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

We study the $4$-rank of the ideal class group of $K_n := \mathbb{Q}(\sqrt{-n}, \sqrt{n})$. Our main result is that for a positive proportion of the squarefree integers $n$ we have that the $4$-rank of $\text{Cl}(K_n)$ equals $\omega_3(n) -…

In this paper we study the cyclic inverse monoid $\CI_n$ on a set $\Omega_n$ with $n$ elements, i.e. the inverse submonoid of the symmetric inverse monoid on $\Omega_n$ consisting of all restrictions of the elements of a cyclic subgroup of…

Let $G$ be a finite group, written multiplicatively. The Davenport constant of $G$ is the smallest positive integer $D(G)$ such that every sequence of $G$ with $D(G)$ elements has a non-empty subsequence with product $1$. Let $D_{2n}$ be…

The monoid of all partial injections on a finite set (the symmetric inverse semigroup) is of particular interest because of the well-known Wagner-Preston Theorem. In this article, we step forward the study of a submonoid of the symmetric…

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

Let $G$ be a finite group and $D_{2n}$ be the dihedral group of $2n$ elements. For a positive integer $d$, let $\mathsf{s}_{d\mathbb{N}}(G)$ denote the smallest integer $\ell\in \mathbb{N}_0\cup \{+\infty\}$ such that every sequence $S$…

In this paper we establish a formal connection between the structure of ideals in integers rings and the theory of additive combinatorics. For integers rings with cyclic class groups, we prove a structural theorem demonstrating that every…

For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…

Given a simple digraph $D$ on $n$ vertices (with $n\ge2$), there is a natural construction of a semigroup $\langle D\rangle$ associated with $D$. For any edge $(a,b)$ of $D$, let $a\to b$ be the idempotent of defect $1$ mapping $a$ to $b$…

Let ${\cal I}_n$ be the symmetric inverse semigroup on $X_n = \{1, 2, \ldots , n\}$ and let ${\cal DDP}_n$ and ${\cal ODDP}_n$ be its subsemigroups of order-decreasing partial isometries and of order-preserving and order-decreasing partial…

We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse…

In this paper we provide an overview of the class of inverse semigroups $S$ such that every congruence on $S$ relates at least one idempotent to a non-idempotent; such inverse semigroups are called $E$-disjunctive. This overview includes…