Related papers: Sweeping up Zeta
We show that a finite group $G$ admitting an automorphism $\alpha$ such that the function $G\rightarrow G$, $g\mapsto g\alpha(g)$, is bijective is necessarily solvable.
We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…
We construct well-behaved extensions of the motivic spectra representing generalized motivic cohomology and connective Balmer--Witt K-theory (among others) to mixed characteristic Dedekind schemes on which 2 is invertible. As a consequence…
We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…
We generalize Aztec diamond theorem (N. Elkies, G. Kuperberg, M. Larsen, and J. Propp, Alternating-sign matrices and domino tilings, Journal Algebraic Combinatoric, 1992) by showing that the numbers of tilings of a certain family of regions…
In this paper, a question due to Heckenberger, Shareshian and Welker on racks in [7] is positively answered. A rack is a set together with a selfdistributive bijective binary operation. We show that the lattice of subracks of every finite…
We offer streamlined proofs of fundamental theorems regarding the index theory for partial self-maps of an infinite set that are bijective between cofinite subsets.
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we obtain a number of new…
We show that the map $\pi_\ast \mathrm{MString}\to \pi_\ast \mathrm{tmf}$ induced by the Ando-Hopkins-Rezk orientation is surjective. This proves an unpublished claim of Hopkins and Mahowald. We do so by constructing an $\mathbf{E}_1$-ring…
We say two posets are "doppelg\"angers" if they have the same number of $P$-partitions of each height $k$. We give a uniform framework for bijective proofs that posets are doppelg\"angers by synthesizing $K$-theoretic Schubert calculus…
Let F_*(X, Y) be the space of base-point-preserving maps from a connected finite CW complex X to a connected space Y. Consider a CW complex of the form X cup_{alpha}e^{k+1} and a space Y whose connectivity exceeds the dimension of the…
We prove a combinatorial version of Thom's Isotopy Lemma for projection maps applied to any complex or real toric variety. Our results are constructive and give rise to a method for associating the Whitney strata of the projection to the…
In their work on `Coxeter-like complexes', Babson and Reiner introduced a simplicial complex $\Delta_T$ associated to each tree $T$ on $n$ nodes, generalizing chessboard complexes and type A Coxeter complexes. They conjectured that…
The scaling limit of large simple outerplanar maps was established by Caraceni using a bijection due to Bonichon, Gavoille and Hanusse. The present paper introduces a new bijection between outerplanar maps and trees decorated with ordered…
Given an open, bounded, planar set $\Omega$, we consider its $p$-Cheeger sets and its isoperimetric sets. We study the set-valued map $\mathfrak{V}:[\frac12,+\infty)\rightarrow\mathcal{P}((0,|\Omega|])$ associating to each $p$ the set of…
We give a description of the well known Zeta map on Dyck paths which sends the dinv,area statistics to the area,bounce statistics. Our description uses Dyck paths area sequences and can be implemented easily.
We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…
We give direct bijective proofs of the symmetry of the distributions of the number of ascents and descents over standard Young tableaux of shape $\lambda$, where $\lambda$ is a rectangle $(n,n,\dots,n)$ or a truncated staircase…
We study heaps of pieces for lattice paths, which give a combinatorial visualization of lattice paths. We introduce two types of heaps: type $I$ and type $II$. A heap of type $I$ is characterized by peaks of a lattice path. We have a…
We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…