Related papers: A Tree Sperner Lemma
Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…
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…
We prove that the class of trees with unique minimum edge-vertex dominating sets is equivalent to the class of trees with unique minimum paired dominating sets.
I will give a presentation of an abstract approach to finite Ramsey theory found in an earlier paper of mine. I will prove from it a common generalization of Deuber's Ramsey theorem for regular trees and a recent Ramsey theorem of Jasinski…
We introduce a notion of connected perimeter for planar sets defined as the lower semi-continuous envelope of perimeters of approximating sets which are measure-theoretically connected. A companion notion of simply connected perimeter is…
We analyze the eigenvalues of the adjacency matrices of a wide variety of random trees. Using general, broadly applicable arguments based on the interlacing inequalities for the eigenvalues of a principal submatrix of a Hermitian matrix and…
There is a well-known correspondence between infinite trees and ultrametric spaces which can be interpreted as an equivalence of categories and comes from considering the end space of the tree. In this equivalence, uniformly continuous maps…
The tree share structure proposed by Dockins et al. is an elegant model for tracking disjoint ownership in concurrent separation logic, but decision procedures for tree shares are hard to implement due to a lack of a systematic theoretical…
Construction of phylogenetic trees and networks for extant species from their characters represents one of the key problems in phylogenomics. While solution to this problem is not always uniquely defined and there exist multiple methods for…
We treat problems of fair division, their various interconnections, and their relations to Sperner's lemma and the KKM theorem as well as their variants. We prove extensions of Alon's necklace splitting result in certain regimes and relate…
We prove that the free uniform spanning forest of any bounded degree proper plane graph is connected almost surely, answering a question of Benjamini, Lyons, Peres and Schramm. We provide a quantitative form of this result, calculating the…
We extend the classical Mercer theorem to reproducing kernel Hilbert spaces whose elements are functions from a measurable space $X$into $\mathbb C^n$. Given a finite measure $\mu$ on $X$, we represent the reproducing kernel $K$ as…
We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
We show that if a strictly positive joint probability distribution for a set of binary random variables factors according to a tree, then vertex separation represents all and only the independence relations enclosed in the distribution. The…
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…
We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.
We introduce and examine some special classes of invariant types$\unicode{x2014}$bi-invariant, strongly bi-invariant, extendibly invariant, and reliably invariant types$\unicode{x2014}$and show that they are related to certain…
We prove endpoint and sparse-like bounds for Bergman projectors on nonhomogeneous, radial trees $X$ that model manifolds with possibly unbounded geometry. The natural Bergman measures on $X$ may fail to be doubling, and even locally…
Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…