English
Related papers

Related papers: A bijection between noncrossing and nonnesting par…

200 papers

Let $\ell,k$ be fixed positive integers. In an earlier work, the first and third authors established a bijection between $\ell$-cores with first part equal to $k$ and $(\ell-1)$-cores with first part less than or equal to $k$. This paper…

Combinatorics · Mathematics 2008-04-10 Chris Berg , Brant Jones , Monica Vazirani

We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection between partial matchings avoiding three…

Combinatorics · Mathematics 2010-09-24 William Y. C. Chen , Neil J. Y. Fan , Alina F. Y. Zhao

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…

Group Theory · Mathematics 2017-11-02 Christian Lange , Marina A. Mikhailova

We start with an ``algebraic'' RSK-correspondence due to Noumi and Yamada. Given a matrix $X$, we consider a pyramidal array of solid minors of $X$. It turns out that this array satisfies an algebraic variant of octahedron recurrence. The…

Combinatorics · Mathematics 2007-05-23 V. I. Danilov , G. A. Koshevoy

We give a combinatorial model for the bounded derived category of graded modules over the dual numbers in terms of arcs on the integer line with a point at infinity. Using this model we describe the lattice of thick subcategories of the…

Representation Theory · Mathematics 2016-11-08 Sira Gratz , Greg Stevenson

We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde , Igor Pak

We define a bijection that transforms an alternating sign matrix A with one -1 into a pair (N,E) where N is a (so called) ``neutral'' alternating sign matrix (with one -1) and E is an integer. The bijection preserves the classical…

Combinatorics · Mathematics 2007-05-23 Pierre Lalonde

We relate general maps to bipartite maps through a bijection of type slit-slide-sew. We provide an involution on arbitrary genus maps with even degree faces. This enables a full interpretation of the relation between general and bipartite…

Combinatorics · Mathematics 2026-04-23 Jérémie Bettinelli , Dimitri Korkotashvili

For each finite classical group $G$, we classify the subgroups of $G$ which act transitively on a $G$-invariant set of subspaces of the natural module, where the subspaces are either totally isotropic or nondegenerate. Our proof uses the…

Group Theory · Mathematics 2020-12-15 Michael Giudici , S. P. Glasby , Cheryl E. Praeger

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…

Combinatorics · Mathematics 2009-11-17 Jing Qin , Christian M. Reidys

We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…

Combinatorics · Mathematics 2022-08-17 Fufa Beyene , Roberto Mantaci

The counting of partitions according to their genus is revisited. The case of genus 0 -- non-crossing partitions -- is well known. Our approach relies on two pillars: first a functional equation between generating functions, originally…

Combinatorics · Mathematics 2023-05-04 Jean-Bernard Zuber

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

Combinatorics · Mathematics 2022-12-12 Agnieszka Czyżewska-Jankowska , Piotr Śniady

We study and classify a class of representations (called generalized geometric representations) of a Coxeter group of finite rank. These representations can be viewed as a natural generalization of the geometric representation. The…

Representation Theory · Mathematics 2023-12-11 Hongsheng Hu

We give a bijection between the set of self-conjugate partitions and that of ordinary partitions. Also, we show the relation between hook lengths of self conjugate partition and corresponding partition via the bijection. As a corollary, we…

Combinatorics · Mathematics 2018-11-27 Hyunsoo Cho , JiSun Huh , Jaebum Sohn

Compact quantum groups can be studied by investigating their co-representation categories in analogy to the Schur-Weyl/Tannaka-Krein approach. For the special class of (unitary) "easy" quantum groups these categories arise from a…

Combinatorics · Mathematics 2019-07-29 Alexander Mang , Moritz Weber

In this paper, we introduce polynomial time algorithms that generate random 3-noncrossing partitions and 2-regular, 3-noncrossing partitions with uniform probability. A 3-noncrossing partition does not contain any three mutually crossing…

Combinatorics · Mathematics 2009-10-15 Jing Qin , Christian M. Reidys

We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…

Combinatorics · Mathematics 2025-12-08 Jérémie Bettinelli , Dimitri Korkotashvili

We give a precise and general description of gerbes valued in arbitrary crossed module and over an arbitrary differential stack. We do it using only Lie groupoids, hence ordinary differential geometry. We prove the coincidence with the…

Differential Geometry · Mathematics 2013-06-25 Mohammad Jawad Azimi

We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…

Combinatorics · Mathematics 2026-05-14 Nathan Reading