Related papers: Invariant spanning trees for quadratic rational ma…
We present a construction of new invariant sets for fibred polynomial dynamics with base an irrational rotation over the unit circle, called multi-curves. Furthermore, the local dynamical theory for attracting invariant curves is extended…
The core entropy of polynomials, recently introduced by W. Thurston, is a dynamical invariant which can be defined purely in combinatorial terms, and provides a useful tool to study parameter spaces of polynomials. The theory of core…
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…
A genus one curve of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We describe a general method for investigating the invariant theory of such models. We use it to explain how we found our…
We study the minimal spanning arborescence which is the directed analogue of the minimal spanning tree, with a particular focus on its infinite volume limit and its geometric properties. We prove that in a certain large class of transient…
We investigate the combinatorial and dynamical properties of so-called nearly Euclidean Thurston maps, or NET maps. These maps are perturbations of many-to-one folding maps of an affine two-sphere to itself. The close relationship between…
Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data structures. We show, however, that this still falls short of exploiting all of the…
Associated to a Thurston map $f: S^2 \to S^2$ with postcritical set $P$ are several different invariants obtained via pullback: a relation on the set of free homotopy classes of curves in $S^2- P$, a linear operator on the free $\R$-module…
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…
We consider an algebra of (classical or virtual) tangles over an ordered circuit operad and introduce Conway-type invariants of tangles which respect this algebraic structure. The resulting invariants contain both the coefficients of the…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
In this report, we describe a novel graph invariant for computational graphs (colored directed acylic graphs) and how we used it to generate all distinct computational graphs up to isomorphism for small graphs. The algorithm iteratively…
In recent years there has been a paradigm shift from the study of local task-related activation to the organization and functioning of large-scale functional and structural brain networks. However, a long-standing challenge in this…
A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…
We investigate the break up of the last invariant curve for families of standard maps. Our main result is another evidence of how hard this problem is. We give an example of an analytic mapping with a "pathological" behavior, related to the…
We study the application of IBL-infinity-algebras to string topology and explicitly compute the case of spheres. This involves finding a Green kernel and computing integrals associated to trivalent ribbon graphs, which are similar to…