English
Related papers

Related papers: Sweeping up Zeta

200 papers

We study four bijections, which are promotion, evacuation, rowmotion, and rowvacuation, on generalized Dyck paths in rational Catalan combinatorics. We define the maps on generalized Dyck paths, which have their origins in maps on Dyck…

Combinatorics · Mathematics 2026-04-01 Keiichi Shigechi

Given a finite acyclic quiver Q with path algebra kQ, Ingalls and Thomas have exhibited a bijection between the set of Morita equivalence classes of support-tilting modules and the set of thick subcategories of mod kQ and they have…

Representation Theory · Mathematics 2015-12-01 Mustafa A. A. Obaid , S. Khalid Nauman , Wafaa M. Fakieh , Claus Michael Ringel

A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of…

Combinatorics · Mathematics 2023-10-26 Arnau Padrol , Eva Philippe

We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…

Combinatorics · Mathematics 2017-03-08 Markus Fulmek

Extending Wigner's theorem we give a characterization of positive maps of $B(H)$ into itself which map the set of rank k projections onto itself.

Operator Algebras · Mathematics 2016-04-21 Erling Størmer

Inspired by the Stochastic processes described by the Feller Coupling and Chinese Restaurant Processes, we create four different bijections from words in the set $[1]\times [2] \times\cdot \times[n]$ to $S_n$. We then compose these maps…

Combinatorics · Mathematics 2022-07-19 William Chang

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Combinatorics · Mathematics 2012-01-13 Edinah K. Gnang , Chetan Tonde

We show that our algorithm for inverting the sweep map on (2n, n)-Dyck paths works for any (kn, n)-Dyck path, where k is an arbitrary positive integer.

Combinatorics · Mathematics 2017-03-30 Erin Milne

The enumeration of linear $\lambda$-terms has attracted quite some attention recently, partly due to their link to combinatorial maps. Zeilberger and Giorgetti (2015) gave a recursive bijection between planar linear normal $\lambda$-terms…

Combinatorics · Mathematics 2025-11-11 Wenjie Fang

In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of two dimensional zonotopes, using dynamical systems and order theory. We show that the sets of partitions ordered with a simple…

Combinatorics · Mathematics 2025-10-20 M. Latapy

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

Combinatorics · Mathematics 2013-01-25 Olcay Coşkun , Müge Taşkın

Given a coprime pair $(m,n)$ of positive integers, rational $(m,n)$-Dyck paths are lattice paths in the $m\times n$ rectangle that never go below the diagonal. The sweep map of a rational $(m,n)$-Dyck paths $D$ is the rational Dyck path…

Combinatorics · Mathematics 2015-05-06 Guoce Xin

The set of acyclic orientations of a connected graph with a given sink has a natural poset structure. We give a geometric proof of a result of Jim Propp: this poset is the disjoint union of distributive lattices.

Combinatorics · Mathematics 2022-10-07 Richard Ehrenborg , MLE Slone

We introduce the notion of fully simple maps, which are maps with non self-intersecting disjoint boundaries. In contrast, maps where such a restriction is not imposed are called ordinary. We study in detail the combinatorics of fully simple…

Mathematical Physics · Physics 2023-07-07 Gaëtan Borot , Elba Garcia-Failde

We give a bijective proof of the Aztec diamond theorem, stating that there are $2^{n(n+1)/2}$ domino tilings of the Aztec diamond of order $n$. The proof in fact establishes a similar result for non-intersecting families of $n+1$ Schr\"oder…

Combinatorics · Mathematics 2012-09-25 Frédéric Bosio , Marc A. A. Van Leeuwen

The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features…

Combinatorics · Mathematics 2021-03-12 Carmen Bruckmann , Peter F. Stadler , Marc Hellmuth

The alternating sign matrices-descending plane partitions (ASM-DPP) bijection problem is one of the most intriguing open problems in bijective combinatorics, which is also relevant to integrable combinatorics. The notion of a signed set and…

Combinatorics · Mathematics 2024-10-30 Takuya Inoue

We construct growth bijections for bipolar oriented planar maps and for Schnyder woods. These give direct combinatorial proofs of several counting identities for these objects. Our method mainly uses two ingredients. First, a slit-slide-sew…

Combinatorics · Mathematics 2026-01-09 Jérémie Bettinelli , Éric Fusy , Baptiste Louf

We present a bijection between permutation matrices and descending plane partitions without special parts, which respects the quadruple of statistics considered by Behrend, Di Francesco and Zinn--Justin. This bijection involves the…

Combinatorics · Mathematics 2018-09-10 Markus Fulmek

In this paper we provide extensions of the $\lambda$-Lemma (also known as Inclination Lemma) for piecewise smooth vector fields and maps. In order to achieve our main result, we investigate the regularity of time-T-maps of piecewise smooth…

Dynamical Systems · Mathematics 2025-07-16 Claudio A. Buzzi , Paulo Santana , Luan V. M. F. Silva