Related papers: Vexillary signed permutations revisited
We establish combinatorial and inductive formulas for Kazhdan-Lusztig polynomials associated to covexillary elements in classical types, extending results of Boe, Lascoux-Sch\"{u}tzenberger, Sankaran-Vanchinathan, and Zelevinsky for…
We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…
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…
In this paper, we present an algorithm that enumerates a certain class of signed permutations, referred to as grid signed permutation classes. In the case of permutations, the corresponding grid classes are of interest because they are…
A conjecture of J. Huh and B. Sturmfels predicts that the sign of the Euler characteristic of a complex very affine variety depends only on the parity of the dimension. The conjecture is true for locally complete intersections. Beyond this…
We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…
We present some corollaries to a symplectic primed shifted tableaux version of Tokuyama's identity expressed in terms of other combinatorial constructs, namely generalised $U$-turn alternating sign matrices and strict symplectic…
An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…
In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…
We study three aspects of commutation classes of reduced decompositions: the number of commutation classes, the structures of their corresponding graphs, and the enumeration of subnetworks, a concept recently introduced by Warrington [21].…
Many important statistics of signed permutations are realized in the corresponding permutation tableaux or bare tableaux of type $B$: Alignments, crossings and inversions of signed permutations are realized in the corresponding permutation…
We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions of Steingrimsson and Williams (math.CO/0507149), in particular, on the distribution of the bistatistic…
Splines are central objects for the interpolation of discrete data via piecewise smooth paths. Their iterated-integral signature is an infinite collection of tensors which characterizes paths almost uniquely. We study truncations of this…
This is a Reply to: Comment on "Spectral Signatures of the Fulde-Ferrell-Larkin-Ovchinnikov Order Parameter in One-Dimensional Optical Lattices" R. A. Molina J. Dukelksy, and P. Schmitteckert, Phys. Rev. Lett. 102, 168901 (2009)
The concept of signatures and expected signatures is vital in data science, especially for sequential data analysis. The signature transform, a Cartan type development, translates paths into high-dimensional feature vectors, capturing their…
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
A conjecture by R. Stanley on a class of alternating permutations, which is proved by R. Chapman and L. Williams states that alternating permutations with the maximal number of fixed points is equidistributed with derangements. We extend…
We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…
We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map from the hull(closure of the set of translates) to the sequence of embedding operations through which we…
Stanley introduced in 1986 the order polytope and the chain polytope for a given finite poset. These polytopes contain much information about the poset and have given rise to important examples in polyhedral geometry. In 1993, Reiner…