English
Related papers

Related papers: Note on the bijectivity of the Pak-Stanley labelli…

200 papers

Let $\mathscr{C}$ be an extriangulated category with enough projectives and injectives. We give a new definition of tilting subcategories of $\mathscr{C}$ and prove it coincides with the definition given in [19]. As applications, we…

Representation Theory · Mathematics 2024-09-13 Zhiwei Zhu , Jiaqun Wei

We define a birational version of the stability of cotangent sheaves for complex projective manifolds, and more generally for smooth orbifolds. We then show, using standard conjectures in birational classification, that these cotangent…

Complex Variables · Mathematics 2010-08-31 Frederic Campana

The aim of this paper is twofold. We first provide a new orientation theorem which gives a natural and simple proof of a result of Gao, Yang \cite{GY} on matroid-reachability-based packing of mixed arborescences in mixed graphs by reducing…

Combinatorics · Mathematics 2023-11-21 Zoltán Szigeti

Let $M$ be a closed oriented surface of genus $g\ge 1$, let $B_n(M)$ be the braid group of $M$ on $n$ strings, and let $SB_n(M)$ be the corresponding singular braid monoid. Our purpose in this paper is to prove that the desingularization…

Geometric Topology · Mathematics 2007-05-23 Luis Paris

In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…

Combinatorics · Mathematics 2013-12-03 Andy Hardt , Pete McNeely , Tung Phan , Justin M. Troyka

Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of…

Combinatorics · Mathematics 2007-11-06 Adam Van Tuyl , Rafael H. Villarreal

We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for…

Combinatorics · Mathematics 2014-03-21 Guillaume Chapuy , Valentin Féray , Eric Fusy

We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…

Combinatorics · Mathematics 2021-06-15 Olivier Bernardi

We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…

Combinatorics · Mathematics 2015-07-07 Ilke Canakci , Ralf Schiffler

We define two refinements of the skew length statistic on simultaneous core partitions. The first one relies on hook lengths and is used to prove a refined version of the theorem stating that the skew length is invariant under conjugation…

Combinatorics · Mathematics 2016-09-16 Robin Sulzgruber

We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…

Logic · Mathematics 2017-05-26 Grigory K. Olkhovikov

Many scientific and combinatorial problems admit multiple correct solutions, not a single label. Standard supervised learning resolves this ambiguity by choosing one solution as the target, but this hidden selector can be arbitrary,…

Machine Learning · Computer Science 2026-05-11 Caleb Jore , Jialin Liu

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

In 2006, Chapoton defined a class of Tamari intervals called "new intervals" in his enumeration of Tamari intervals, and he found that these new intervals are equi-enumerated with bipartite planar maps. We present here a direct bijection…

Combinatorics · Mathematics 2021-06-18 Wenjie Fang

The class of Parikh word representable graphs were recently introduced. In this work, we further develop its general theory beyond the binary alphabet. Our main result shows that this class is equivalent to the class of bipartite…

Combinatorics · Mathematics 2018-12-27 Wen Chean Teh , Zhen Chuan Ng , Muhammad Javaid , Zi Jing Chern

This paper is partly a survey of certain kinds of results and proofs in additive combinatorics, and partly a discussion of how useful the finite-dimensional Hahn-Banach theorem can be. The most interesting single result is probably a…

Combinatorics · Mathematics 2014-02-26 W. T. Gowers

We construct weight-preserving bijections between column strict shifted plane partitions with one row and alternating sign trapezoids with exactly one column in the left half that sums to $1$. Amongst other things, they relate the number of…

Combinatorics · Mathematics 2022-09-12 Hans Höngesberg

We provide an alternative, simpler proof of the existence of thick triangulations for noncompact $\mathcal{C}^1$ manifolds. Moreover, this proof is simpler than the original one given in \cite{pe}, since it mainly uses tools of elementary…

Geometric Topology · Mathematics 2010-05-12 Emil Saucan , Meir Katchalski

A binomial coefficient identity due to Zhi-Wei Sun is the subject of half a dozen recent papers that prove it by various analytic techniques and establish a generalization. Here we give a simple proof that uses weight-reversing involutions…

Combinatorics · Mathematics 2007-05-23 David Callan

We describe a formal correctness proof of RANKING, an online algorithm for online bipartite matching. An outcome of our formalisation is that it shows that there is a gap in all combinatorial proofs of the algorithm. Filling that gap…

Logic in Computer Science · Computer Science 2023-03-01 Mohammad Abdulaziz , Christoph Madlener