33 problems
Given coprime positive integers and , let be the set of rational -Dyck paths, and let be the sweep map that sorts the steps of a path accord…
For , a left Gog or GOGAm trapezoid of shape is obtained from the corresponding triangle by retaining the leftmost diagonals. Left Gog–GOGAm trapezoid con…
A quartic Eulerian orientation without alternating vertices is a quartic Eulerian orientation belonging to the subclass obtained by excluding alternating vertices. Bousquet-Mélou a…
Lecture hall position conjecture. If , then
Let be the set of permutations of , and let be the statistics defined by … … … and let be the largest such that appe…
Let , let be either or , and call a permutation -avoiding if it contains no subsequence order-isomorphic to . Let -stack-sortable permutations be t…
Let be the set of permutations of length that become the identity after applications of the stack-sorting operation, and let denote…
Let be a unit interval parking function, let denote the Foata transform, and let denote the outcome permutation of . Foata transfo…
Let , , and . A permutation is -stack-sortable if it can be sorted using applications of the stack-sorting operator, and it avoids a patte…
Let and denote the sets of shallow permutations of size avoiding the patterns and , respectively. For a permutation ,…
Let be the complete split graph, and let be the set of sorted recurrent configurations on . For a configuration , write…
Inverse-permutation conjecture. The map maps every permutation to its inverse.
Fixed-point conjecture. There is only fixed point of , namely the identity permutation, corresponding to the word .
Let be a positive integer. An up-down permutation of size is a permutation of whose successive entries alternately rise and fall, and a permutation avoid…
Three symmetry conjectures for di-sk trees. Over di-sk trees, the following symmetries should hold:
A double-tandem walk is a walk for which the starting point is , and and denote the minimal - and -coordinates visited during the w…
Tenner's conjecture. Iteration of the map suffices to produce a bijection: for every -regular, -distinct partition , there exists an integer de…
Unified bijection conjecture. A unified bijection for essentially irreducible toroidal -angulations should exist.
Let be a standard Young tableau and let be its corresponding vacillating tableau. Let evacuation, also called the Schützenberger involution, act on , and let reversal ac…
Let standard Young tableaux be concatenated when their row lengths all have the same parity, and let vacillating tableaux of shape be concatenated in the corresponding…
Garsia–Milne iteration conjecture. In the worst case, requires iterations.
Let and be positive integers, and let be a type with denoting its size. A small -Fuss-Schröder p…
Bijection conjecture. The following families are in bijection: hesitating excursions of length in the quadrant; hesitating axis-walks of length in the octant; and hesitat…
Let be the set of all fillings of Young diagrams with positive integers. For a filling , let and den…
Doubled-chamber conjecture. The set of oscillating lattice walks of length in starting at and ending at the boundary