相关论文: A bijective proof of the hook-length formula for s…
Consider a sequence of integral matrices $\mathcal{A}=(A_n)_{n\in\N}$, and a $d$-tuple function ${\bf r}=(r_1,\ldots,r_d)\colon \N\to (0,\frac{1}{2})$. For a fixed vector ${\bm \alpha},$ we are interested in the set $\mathcal{T}_{{\bm…
We show that the Mallows measure on permutations of $1,\ldots,n$ arises as the law of the unique Gale-Shapley stable matching of the random bipartite graph conditioned to be perfect, where preferences arise from a total ordering of the…
In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the…
A perfect matching in a bipartite graph embedded on a torus defines a height function on the graph's faces and an associated height change vector in $\Z^2$. These matchings are enumerated by a combination of four evaluations of a bivariate…
This paper is the sequel to [PTVV] (IHES Vol. 117, 2013). We develop a general and flexible context for differential calculus in derived geometry, including the de Rham algebra and polyvector fields. We then introduce the formalism of…
Dietzfelbinger and Weidling [DW07] proposed a natural variation of cuckoo hashing where each of $cn$ objects is assigned $k = 2$ intervals of size $\ell$ in a linear (or cyclic) hash table of size $n$ and both start points are chosen…
We present an explicit closed-form formula for the vertices of the classical cut polytope $\operatorname{CUT}(n)$, defined as the convex hull of cut vectors of the complete graph $K_n$. Our derivation proceeds via a related polytope,…
The jeu de taquin process produced a standard Young tableau from a skew standard Young tableau by shifting its entries to the northwest. We generalize this process to posets: certain partial numberings of any poset are shifted upward. A…
We prove a formula for the multiplication of equivariant first Chern classes of tautological bundles of type A bow varieties with respect to the stable envelope basis. This formula naturally generalizes the classical Chevalley-Monk formula…
There is a natural bijection between permutations obtainable using a stack (those avoiding the pattern 312) and permutations obtainable using a queue (those avoiding 321). This bijection is equivalent to one described by Simion and Schmidt…
We consider the problem of characterizing the convex hull of the graph of a bilinear function $f$ on the $n$-dimensional unit cube $[0,1]^n$. Extended formulations for this convex hull are obtained by taking subsets of the facets of the…
We consider families of finite sets that we call shellable and that have been characterized by Chang and by Hirst and Hughes as being the families of sets that admit unique solutions to Hall's marriage problem. In this paper, we introduce a…
Chess tableaux are a special kind of standard Young tableaux where, in the chessboard coloring of the Young diagram, even numbers always appear in white cells and odd numbers in black cells. If, for $\lambda$ a partition of $n$,…
We present a simple combinatorial proof of Postnikov's hook length formula for binary trees.
On the ground of a general theorem concerning the admissibility of the structural rules in sequent calculi with additional atomic rules, we develop a proof theoretic analysis for several extensions of the ${\bf G3[mic]}$ sequent calculi…
This thesis captures the ongoing development of twisted cubes, which is a modification of cubes (in a topological sense) where its homotopy type theory does not require paths or higher paths to be invertible. My original motivation to…
A notion of cyclic descents on standard Young tableaux (SYT) of rectangular shape was introduced by Rhoades, and extended to certain skew shapes by the last two authors. The cyclic descent set restricts to the usual descent set when the…
We consider maps on orientable surfaces. A map is called \emph{unicellular} if it has a single face. A \emph{covered map} is a map (of genus $g$) with a marked unicellular spanning submap (which can have any genus in $\{0,1,...,g\}$). Our…
In this paper, we deal with reversing and extended symmetries of shifts generated by bijective substitutions. We provide equivalent conditions for a permutation on the alphabet to generate a reversing/extended symmetry, and algorithms how…
We study the factorizations of the permutation $(1,2,...,n)$ into $k$ factors of given cycle types. Using representation theory, Jackson obtained for each $k$ an elegant formula for counting these factorizations according to the number of…