Searcharxiv⌕ Search

arXiv subjects

Yuval Roichman

Publications and source records attributed to Yuval Roichman.

At least 37 records · Page 2Linked to original sources
arXiv2016

Schur-positive sets of permutations via products of grid classes

Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets and multisets, based on geometric grid classes and the product operation. Our approach produces many new instances of Schur-positive sets, and provides a broad framework that explains the existence of known such sets that until now were sporadic cases.

math.CO↗
arXiv2016

On rotated Schur-positive sets

The problem of finding Schur-positive sets of permutations, originally posed by Gessel and Reutenauer, has seen some recent developments. Schur-positive sets of pattern-avoiding permutations have been found by Sagan et al and a general construction based on geometric operations on grid classes has been given by the authors. In this paper we prove that horizontal rotations of Schur-positive subsets of permutations are always Schur-positive. The proof applies a cyclic action on standard Young tableaux of certain skew shapes and a jeu-de-taquin type straightening algorithm. As a consequence of the proof we obtain a notion of cyclic descent set on these tableaux, which is rotated by the cyclic action on them.

math.CO↗
arXiv2014

Matrices, Characters and Descents

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 character formulas are invertible, yielding expressions for the cardinalities of sets of combinatorial objects with prescribed descent sets in terms of character values of the symmetric group.

math.CO↗
arXiv2014

Signed arc permutations

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 enumeration formulas with respect to their descent set and major index. Next, we generalize the notion of arc permutations to the hyperoctahedral group in two different directions. We show that these extensions to type $B$ carry interesting analogues of the properties of type $A$ arc permutations, such as characterizations by pattern avoidance, and elegant unsigned and signed enumeration formulas with respect to the flag-major index.

math.CO↗
arXiv2013

On maximal chains in the non-crossing partition lattice

A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ in exactly one element.

math.CO↗
arXiv2013

Arc Permutations

Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are characterized by pattern avoidance. It is also shown that arc permutations carry a natural affine Weyl group action, and that the number of geodesics between a distinguished pair of antipodes in the associated Schreier graph, as well as the number of maximal chains in the weak order on unimodal permutations, are both equal to twice the number of standard Young tableaux of shifted staircase shape. Finally, a bijection from non-unimodal arc permutations to Young tableaux of certain shapes, which preserves the descent set, is described and applied to deduce a conjectured character formula of Regev.

math.CO↗
arXiv2013

The absolute order of a permutation representation of a Coxeter group

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 rank generating polynomial divides the rank generating polynomial of the absolute order on $W$ are investigated when $W$ is finite. Several examples, including a symmetric group action on perfect matchings, are discussed. As an application, a well-behaved absolute order on the alternating subgroup of $W$ is defined.

math.CO↗
arXiv2012

Flag weak order on wreath products

A generating set for the wreath product $\ZZ_r \wr S_n$ which leads to a nicely behaved weak order is presented, and properties of the resulting order are studied.

math.CO↗
arXiv2012

Triangle-Free Triangulations, Hyperplane Arrangements and Shifted Tableaux

Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are deduced. In particular, it is shown that: (1) every diagonal is flipped exactly once in a geodesic between distinguished pairs of antipodes; (2) the number of geodesics between these antipodes is equal to twice the number of Young tableaux of a truncated shifted staircase shape.

math.CO↗
arXiv2011

Enumeration of standard Young tableaux of certain truncated shapes

Unexpected product formulas for the number of standard Young tableaux of certain truncated shapes are found and proved. These include shifted staircase shapes minus a square in the NE corner, rectangular shapes minus a square in the NE corner, and some variations.

math.CO↗
arXiv2009

Triangle-Free Triangulations

The flip operation on colored inner-triangle-free triangulations of a convex polygon is studied. It is shown that the affine Weyl group $\widetilde{C}_n$ acts transitively on these triangulations by colored flips, and that the resulting colored flip graph is closely related to a lower interval in the weak order on $\widetilde{C}_n$. Lattice properties of this order are then applied to compute the diameter.

math.CO↗
arXiv2008

Combinatorial Gelfand Models

A combinatorial construction of a Gelafand model for the symmetric group and its Iwahori-Hecke algebra is presented.

math.RT↗
arXiv2008

A Gelfand Model for Wreath Products

A Gelafand model for wreath products $\Z_r\wr S_n$ is constructed. The proof relies on a combinatorial interpretation of the characters of the model, extending a classical result of Frobenius and Schur.

math.RT↗
arXiv2007

Major Indices and Perfect Bases for Complex Reflection Groups

It is shown that, under mild conditions, a complex reflection group $G(r,p,n)$ may be decomposed into a set-wise direct product of cyclic subgroups. This property is then used to extend the notion of major index and a corresponding Hilbert series identity to these and other closely related groups.

math.CO↗
arXiv2007

The Combinatorics of the Garsia-Haiman Modules for Hook Shapes

Several bases of the Garsia-Haiman modules for hook shapes are given, as well as combinatorial decomposition rules for these modules. These bases and rules extend the classical ones for the coinvariant algebra of type $A$. We also give a decomposition of the Garsia-Haiman modules into descent representations.

math.RT↗