Related papers: Taffy, Trees, and Tangles
We prove that every graph has a canonical tree of tree-decompositions that distinguishes all principal tangles (these include the ends and various kinds of large finite dense structures) efficiently. Here `trees of tree-decompositions' are…
Tropical friezes are the tropical analogues of Coxeter-Conway frieze patterns. In this note, we study them using triangulated categories. A tropical frieze on a 2-Calabi-Yau triangulated category $\mathcal{C}$ is a function satisfying a…
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from…
We introduce combinatorial multivector fields, associate with them multivalued dynamics and study their topological features. Our combinatorial multivector fields generalize combinatorial vector fields of Forman. We define isolated…
We investigate the combinatorial analogues, in the context of normal surfaces, of taut and transversely measured (codimension 1) foliations of 3-manifolds. We establish that the existence of certain combinatorial structures, a priori weaker…
We describe two ways to construct finite rational morphisms between fiber products of rational elliptic surfaces with section and some Calabi--Yau manifolds. We use them to construct correspondences between such fiber products that admit at…
A novel computational model (CoDD) utilizing combinatory logic to create higher-order decision trees is presented. A theoretical analysis of general intelligence in terms of the formal theory of pattern recognition and pattern formation is…
We prove a lower bound on the number of spanning two-forests in a graph, in terms of the number of vertices, edges, and spanning trees. This implies an upper bound on the average cut size of a random two-forest. The main tool is an identity…
We study the set of rational curves of a certain topological type in general members of certain families of Calabi-Yau threefolds. For some families we investigate to what extent it is possible to conclude that this set is finite. For other…
In recent work, we conjectured that Calabi-Yau threefolds defined over $\mathbb{Q}$ and admitting a supersymmetric flux compactification are modular, and associated to (the Tate twists of) weight-two cuspidal Hecke eigenforms. In this work,…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a…
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…
Random forests are widely used in regression. However, the decision trees used as base learners are poor approximators of linear relationships. To address this limitation we propose RaFFLE (Random Forest Featuring Linear Extensions), a…
A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths…
The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…
The time-ordered multilayer integrals have long been cited as major challenges in the analytical study of cosmological correlators and wavefunction coefficients. The recently proposed family tree decomposition technique solved these time…
We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and…
We define mosaics, which are naturally in bijection with Knutson-Tao puzzles. We define an operation on mosaics, which shows they are also in bijection with Littlewood-Richardson skew-tableaux. Another consequence of this construction is…
We provide a formal, simple and intuitive theory of rational decision making including sequential decisions that affect the environment. The theory has a geometric flavor, which makes the arguments easy to visualize and understand. Our…