Related papers: Combinatorial equivalence of separable elements in…

We continue the study of separable elements in finite Weyl groups. These elements generalize the well-studied class of separable permutations. We show that the multiplication map $W/U \times U \to W$ is a length-additive bijection, or…

Recently, B\'{e}nyi and the second author introduced two combinatorial interpretations for symmetrized poly-Bernoulli polynomials. In the present study, we construct bijections between these combinatorial objects. We also define various…

Separable elements in Weyl groups are generalizations of the well-known class of separable permutations in symmetric groups. Gaetz and Gao showed that for any pair $(X,Y)$ of subsets of the symmetric group $\mathfrak{S}_n$, the…

We continue a study of separable equivalence from Hokkaido Mathematical Journal 24 (1995), 527-549. We prove that symmetric separable equivalent rings $A$ and $B$ are linked by a Frobenius bimodule ${}_AP_B$ such that $A$ is $P$-separable…

A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…

We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…

A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

We define the notion of a separable element in a finite Weyl group, generalizing the well-studied class of separable permutations. We prove that the upper and lower order ideals in weak Bruhat order generated by a separable element are…

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…

It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change…

Let $\Bigl\langle\matrix{n\cr k}\Bigr\rangle$, $\Bigl\langle\matrix{B_n\cr k}\Bigr\rangle$, and $\Bigl\langle\matrix{D_n\cr k}\Bigr\rangle$ be the Eulerian numbers in the types A, B, and D, respectively -- that is, the number of…

This paper is the second in a series of planned papers which provide first bijective proofs of alternating sign matrix results. Based on the main result from the first paper, we construct a bijective proof of the enumeration formula for…

Let $\mathfrak{S}_n$ and $\mathfrak{B}_n$ denote the respective sets of ordinary and bigrassmannian (BG) permutations of order $n$, and let $(\mathfrak{S}_n,\leq)$ denote the Bruhat ordering permutation poset. We study the restricted poset…

The elements in the hyperoctahedral group $\mathfrak{B}_n$ can be treated as signed permutations with the natural order $\cdots<-2<-1<0<1<2<\cdots$, or as colored permutations with the $r$-order $-1<_r-2<_r\cdots<_r0<_r1<_r2<_r\cdots$. For…

Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…

In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly…

We introduce a method that produces a bijection between the posets ${\rm silt-}{A}$ and ${\rm silt-}{B}$ formed by the isomorphism classes of basic silting complexes over finite-dimensional $k$-algebras $A$ and $B$, by lifting $A$ and $B$…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

In this paper we show that the irreducible representations of a finite inverse semigroup $S$ over an algebraically closed field $F$ are in bijection with the conjugacy classes of $S$ if the characteristic of $F$ is zero or a prime number…