Related papers: Invariant spanning trees for quadratic rational ma…
Spanning trees of complete bipartite graphs exhibit a rich interaction between degree sequences and graph structure. In this paper, we obtain lower bounds on the number of isomorphism classes of spanning trees in $K_{a,b}, 2 \leq a \leq b$…
We consider a real-valued path; it is possible to associate a tree to this path, and we explore the relations between the tree, the properties of $p$-variation of the path, and integration with respect to the path. In particular, the…
We study canonical decompositions of postcritically finite branched coverings of the 2-sphere, as defined by K.~Pilgrim. We show that every hyperbolic cycle in the decomposition does not have a Thurston obstruction. It is thus Thurston…
We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…
For a given graph $G$, a maximum internal spanning tree of $G$ is a spanning tree of $G$ with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem is to find a maximum internal spanning tree of the given…
We compute the invariant subspace of the rational group ring of a surface, truncated by powers of the augmentation ideal, under the action of the mapping class group. The surface is compact, oriented with one boundary component. This…
We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees…
We study inductive limits of higher-dimensional noncommutative tori, which we call noncommutative protori. We compute the Elliott invariants for broad classes of unital and nonunital systems, including toric maps, Morita-corner embeddings,…
Recent work of Dylan Thurston gives a condition for when a post-critically finite branched self-cover of the sphere is equivalent to a rational map. We apply D. Thurston's positive criterion for rationality to give a new proof of a theorem…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
This work addresses the intrinsic relationship between trees and networks (i.e. graphs). A complete (invertible) mapping is presented which allows trees to be mapped into weighted graphs and then backmapped into the original tree without…
In this paper new numerical invariants of structurally unstable vector fields in the plane are found. One of the main tools is an improved asymptotics of sparkling saddle connections that occur when a separatrix loop of a hyperbolic saddle…
We give new general formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay (1983) for regular graphs. The general answer involves a quantity for infinite graphs that we call…
Treating neural network inputs and outputs as random variables, we characterize the structure of neural networks that can be used to model data that are invariant or equivariant under the action of a compact group. Much recent research has…
We study dynamical systems acting on the path space of a stationary (non-simple) Bratteli diagram. For such systems we explicitly describe all ergodic probability measures invariant with respect to the tail equivalence relation (or the…
This article is dedicated to the computation of an explicit presentation of some asymptotically rigid mapping class groups, namely the braided Higman-Thompson groups. To do so, we use the action of these groups on the spine complex, a…
We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative…
Analyzing embedded simplicial complexes, such as triangular meshes and graphs, is an important problem in many fields. We propose a new approach for analyzing embedded simplicial complexes in a subdivision-invariant and isometry-invariant…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
The scramble number of a graph is an invariant recently developed to study chip-firing games and divisorial gonality. In this paper we introduce the screewidth of a graph, based on a variation of the existing literature on tree-cut…