Related papers: Enumeration of bigrassmannian permutations below a…
Nonassociative algebras satisfying the polynomial identities x(yz)=y(xz) and (xy)z=(xz)y are called bicommutative. We prove the following results: (i) Finitely generated bicommutative algebras are weakly noetherian, i.e., satisfy the…
Following Lusztig and Vogan, we study the Bruhat $G$-order on the set $\mathcal{D}$ of rank $1$ local systems on $B$-orbits over an Hermitian symmetric variety $G/L$. The main aim is to give a combinatorial characterization similar to the…
We give a characterization for the binary linear constant weight codes by using the symmetric difference of the supports of the codewords. This characterization gives a correspondence between the set of binary linear constant weight codes…
A permutation representation of a Coxeter group $W$ naturally defines an absolute order. This family of partial orders (which includes the absolute order on $W$) is introduced and studied in this paper. Conditions under which the associated…
We consider a few special cases of the more general question: How many permutations $\pi\in\mathcal{S}_n$ have the property that $\pi^2$ has $j$ descents for some $j$? In this paper, we first enumerate Grassmannian permutations $\pi$ by the…
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…
A general setting to study a certain type of formulas, expressing characters of the symmetric group $\mathfrak{S}_n$ explicitly in terms of descent sets of combinatorial objects, has been developed by two of the authors. This theory is…
The derangement polynomial for the symmetric group enumerates derangements by the number of excedances. It can be interpreted as the local $h$-polynomial, in the sense of Stanley, of the barycentric subdivision of the simplex. Motivated by…
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…
Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W. In this paper, we…
We describe an linear representation for Abel-Grassmann groups. As a consequence, we obtain or improve many previous results. In particular, enumeration of Abel-Grassmann groups up to isomorphism is obtained for orders <512.
Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…
Previous work has shown that the disarray (or displacement) of an (affine) (signed) permutation is bounded in terms of its Coxeter length. Here, we characterize the permutations for which the bound is sharp in two ways: in terms of a…
The motivation of this paper is to investigate the joint distribution of succession and Eulerian statistics. We first investigate the enumerators for the joint distribution of descents, big ascents and successions over all permutations in…
In this paper, we study the decomposition of Bruhat intervals in a Coxeter group with respect to cosets of a parabolic subgroup. Our main result is that the intersection of a lower Bruhat interval with a parabolic coset contains a unique…
A $k$-Stirling permutation of order $n$ is said to be "flattened" if the leading terms of its increasing runs are in ascending order. We show that flattened $k$-Stirling permutations of order $n+1$ are in bijection correspondence with a…
We give two contructions of sets of masks on cograssmannian permutations that can be used in Deodhar's formula for Kazhdan-Lusztig basis elements of the Iwahori-Hecke algebra. The constructions are respectively based on a formula of…
As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…
Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…
We provide an algorithm to construct a multicomplex for any lower Bruhat interval of $F_4$, such that its rank--generating function equals that of the Bruhat interval. For Weyl groups, it is always possible to find such a multicomplex…