Related papers: On monotone alternating inverse monoids
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…
The Tutte polynomial is a fundamental invariant of graphs and matroids. In this article, we define a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids. To any regular oriented matroid $N$, we associate…
This paper continues the study of Fourier transforms on finite inverse semigroups, with a focus on Fourier inversion theorems and FFTs for new classes of inverse semigroups. We begin by introducing four inverse semigroup generalizations of…
Let $\mathcal{A}(R,S)$ denote the class of all matrices of zeros and ones with row sum vector $R$ and column sum vector~$S$. We introduce the notion of an inversion in a $(0,1)$--matrix. This definition extends the standard notion of an…
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…
In an atomic, cancellative, commutative monoid, the \omega-value measures how far an element is from being prime. In numerical monoids, we show that this invariant exhibits eventual quasilinearity (i.e., periodic linearity). We apply this…
Let $\mathcal{ORD}_{n}$ be the semigroup consisting of all oriented and order-decreasing full transformations on the finite chain $X_{n}=\{ 1<\cdots<n \}$, and for $1\leq r\leq n-1$, let $$\mathcal{ORD}(n,r) =\{\alpha \in…
Motivated by the \v{C}ern\'y conjecture for automata, we introduce the concept of monoidal automata, which allows the formulation of the \v{C}ern\'y conjecture for monoids. We show upper bounds on the reset threshold of monoids with certain…
We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…
The catenary degree is an invariant that measures the distance between factorizations of elements within an atomic monoid. In this paper, we classify which finite subsets of $\mathbb Z_{\ge 0}$ occur as the set of catenary degrees of a…
Let $n$ be any positive integer and $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ be the semigroup of all order isomorphisms between principal filters of the $n$-th power of the set of positive integers $\mathbb{N}$ with the product order. We study…
We consider subalgebras $\mathcal{A}$ of the algebra $M_n$ of $n \times n$ complex matrices that contain all diagonal matrices, known in the literature as the structural matrix algebras (SMAs). Let $\mathcal{A} \subseteq M_n$ be an…
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…
We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.
Right (and left) coherency and right (and left) weak coherency are natural finitary conditions for monoids. Determining whether or not a given monoid has any of these properties is historically a difficult problem. This paper has several…
We study here preference revision, considering both the monotonic case where the original preferences are preserved and the nonmonotonic case where the new preferences may override the original ones. We use a relational framework in which…
In this paper we introduce the submonoids $\mathscr{R}_n$, resp. $\mathscr{C}_n$, of the monoid $\mathscr{M}_n$ of ordered score sheets of a robin-round tournament played by $n$ teams for which the order is preserved after the leader team…
We develop a general theory of Markov chains realizable as random walks on $\mathscr R$-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…