Related papers: Bijections on m-level Rook Placements

We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive…

We prove a closed formula for the integrals of the top Segre classes of tautological bundles over the Hilbert schemes of points of a K3 surface X. We derive relations among the Segre classes via equivariant localization of the virtual…

Three-dimensional convex bodies can be classified in terms of the number and stability types of critical points on which they can balance at rest on a horizontal plane. For typical bodies these are nondegenerate maxima, minima, and…

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

We give a combinatorial proof of a recent result of B\'ona by constructing a bijection from the set of all neighbors of leaves of increasing trees of size $n$ to the set of derangements of length $n$.

The recollement approach to the representation theory of sequences of algebras is extended to pass basis information directly through the globalisation functor. The method is hence adapted to treat sequences that are not necessarily towers…

We study entry loci of varieties and their irreducibility from the perspective of $X$-ranks with respect to a projective variety $X$. These loci are the closures of the points that appear in an $X$-rank decomposition of a general point in…

We study the cobordism of manifolds with boundary, and its applications to codimension 2 embeddings $M^m\subset N^{m+2}$, using the method of the algebraic theory of surgery. The first main result is a splitting theorem for cobordisms of…

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…

We establish monotone bijections between the Farey sequences of order m and the halfsequences of Farey subsequences associated with the rank m elements of the Boolean lattice of subsets of a 2m-set. We also present a few related…

This paper is mainly concerned with applying the theory of M-regularity developed in the previous math.AG/0110003 to the study of linear series given by multiples of ample line bundles on abelian varieties. We define a new invariant of a…

We discuss the role of K3 surfaces in the context of Mercat's conjecture in higher rank Brill-Noether theory. Using liftings of Koszul classes, we show that Mercat's conjecture in rank 2 fails for any number of sections and for any gonality…

Graph theory and enumerative combinatorics are two branches of mathematical sciences that have developed astonishingly over the past one hundred years. It is especially important to point out that graph theory employs combinatorial…

We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random…

We study lax functors between bicategories as a generalized concept of monads and describe generalized notions and theorems of formal monad theory for lax functors. Our first approach is to use the 2-monad whose lax algebras are lax…

In this paper, we confirm a conjecture of Laborde-Zubieta on the enumeration of corners in tree-like tableaux. Our proof is based on Aval, Boussicault and Nadeau's bijection between tree-like tableaux and permutation tableaux, and Corteel…

A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the…

Another bijective proof of Stanley's hook-content formula for the generating function for semistandard tableaux of a given shape is given that does not involve the involution principle of Garsia and Milne. It is the result of a merge of the…

The rook polynomial is a generating function that enumerates the number of ways to place rooks, with no two in the same row or column, on a collection of cells regarded as a pruned chessboard. In combinatorial commutative algebra, special…