Related papers: Taffy, Trees, and Tangles
"Interaction trees" (ITrees) are a general-purpose data structure for representing the behaviors of recursive programs that interact with their environments. A coinductive variant of "free monads," ITrees are built out of uninterpreted…
Diagrammatic notation has become a ubiquitous computational tool; early examples include Penrose's graphical notation for tensor calculus, Feynman's diagrams for perturbative quantum field theory, and Cvitanovic's birdtracks for Lie…
We prove a multivariate Lagrange-Good formula for functionals of uncountably many variables and investigate its relation with inversion formulas using trees. We clarify the cancellations that take place between the two aforementioned…
We study the rationality of some geometrically rational three-dimensional conic and quadric surface bundles, defined over the reals and more general real closed fields, for which the real locus is connected and the intermediate Jacobian…
We develop a theoretical framework for the analysis of oblique decision trees, where the splits at each decision node occur at linear combinations of the covariates (as opposed to conventional tree constructions that force axis-aligned…
By using the Calkin-Wilf tree, we prove the irrationality of numbers of the form $\alpha=\frac{\sqrt{N}+p}{q}$ where $N$ is a positive integer which is not a perfect square, $p$ is a rational integer such that $p^2<N$ and $q$ is a positive…
We give a concise and pedagogical introduction to Feynman diagrams. After discussing a toy model which requires only undergraduate mathematics, we focus on relativistic quantum field theory. We review the derivation of Feynman rules from…
We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…
There are several good reasons you might want to read about uniform spanning trees, one being that spanning trees are useful combinatorial objects. Not only are they fundamental in algebraic graph theory and combinatorial geometry, but they…
We use categorical skew Howe duality to find recursion rules that compute categorified sl(N) invariants of rational tangles colored by exterior powers of the standard representation. Further, we offer a geometric interpretation of these…
In this series of articles we study connections between combinatorics of multidimensional generalizations of Cauchy identity and continuous objects such as multidimensional Brownian motions and Brownian bridges. In Part I of the series we…
The connection between continued fractions and orthogonality which is familiar for $J$-fractions and $T$-fractions is extended to what we call $R$-fractions of type I and II. These continued fractions are associated with recurrence…
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…
Motivated by examples of symmetrically constrained compositions, super convex partitions, and super convex compositions, we initiate the study of partitions and compositions constrained by graph Laplacian minors. We provide a complete…
We note that a rational $3$-tangle diagram is obtained from a combination of four generators. There is an algorithm to distinguish two rational $3$-tangle diagrams up to isotopy. However, there is no perfect classification about rational…
We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics CTL and EF, and first-order logic over…
The Tarskian classical relevant logic TR arises from Tarski's work on the foundations of the calculus of relations and on first-order logic restricted to finitely many variables, presented by Tarski and Givant their book, A Formalization of…
We present computer simulations of three systems of randomly branching polymers in d=3 dimensions: ideal trees and self-avoiding trees with annealed and quenched connectivities. In all cases, we performed a detailed analysis of trees…
Despite widespread interest and practical use, the theoretical properties of random forests are still not well understood. In this paper we contribute to this understanding in two ways. We present a new theoretically tractable variant of…
In this paper, we prove the rational coefficient case of the global ACC for foliated threefolds. Specifically, we consider any lc foliated log Calabi-Yau triple $(X,\mathcal{F},B)$ of dimension $3$ whose coefficients belong to a set…