Related papers: A colourful path to matrix-tree theorems
We construct bijections giving three "codes" for trees. These codes follow naturally from the Matrix Tree Theorem of Tutte and have many advantages over the one produced by Prufer in 1918. One algorithm gives explicitly a bijection that is…
This note concerns a one-line diagrammatic proof of the Cayley-Hamilton Theorem. We discuss the proof's implications regarding the "core truth" of the theorem, and provide a generalization. We review the notation of trace diagrams and…
We state and prove a new closure theorem closely related to the classical closure theorems of Poncelet and Steiner. Along the way, we establish a number of theorems concerning conic sections.
In this paper we present a proof of the BMZ Reduction Lemma with a motivational perspective, and state this lemma for maps to manifolds using the classical definition of cohomological dimension. The lemma, proved and utilized in [4], gives…
In this paper, we provide an easy proof of the Four-colour Theorem in a special case indeed.
We prove an analog of the Szemer\'edi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field $\mathrm{R}$. One new ingredient in the proof is an extension of the well…
We introduce and study matrix transfers to achieve elementary models for bivariant $K$-theory. They share lots of common properties with Voevodsky's framed correspondences and lead to symmetric matrix motives of algebraic varieties…
The aim of this short note is to present an elementary, self-contained, and direct proof for the classical Lebesgue decomposition theorem.
The theory of complex trees is introduced as a new approach to study a broad class of self-similar sets. Systems of equations encoded by complex trees tip-to-tip equivalence relations are used to obtain one-parameter families of connected…
This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the…
The main theme of this dissertation is retooling methods to work for different situations. I have taken the method derived by O'Hara and simplified by Zeilberger to prove unimodality of $q$-binomials and tweaked it. This allows us to create…
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…
We show that variants of the classical reflection functors from quiver representation theory exist in any abstract stable homotopy theory, making them available for example over arbitrary ground rings, for quasi-coherent modules on schemes,…
This note presents several results in graph theory inspired by the author's work in the proof theory of linear logic; these results are purely combinatorial and do not involve logic. We show that trails avoiding forbidden transitions,…
The purpose of this article is to show how the isotropy subgroup of leaf permutations on binary trees can be used to systematically identify tree-informative invariants relevant to models of phylogenetic evolution. In the quartet case, we…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…
A one-line proof of a minimax theorem due to Steinerberger is given.
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We produce a new, shorter construction of a minor-universal planar graph.