相关论文: Hubbard forests

The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…

In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes…

We consider classes of graphs, which we call thick graphs, that have the vertices of a corresponding thin graph replaced by cliques and the edges replaced by cobipartite graphs In particular, we consider the case of thick forests, which we…

This paper deepens the connections between critically finite rational maps and finite subdivision rules. The main theorem is that if f is a critically finite rational map with no periodic critical points, then for any sufficiently large…

Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…

We introduce two definitions of $G$-equivariant partitions of a finite $G$-set, both of which yield $G$-equivariant partition complexes. By considering suitable notions of equivariant trees, we show that $G$-equivariant partitions and…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

This paper develops a theory of polynomial maps from commutative semigroups to arbitrary groups and proves that it has desirable formal properties when the target group is locally nilpotent. We apply this theory to solve Waring's Problem…

We define a bivariate polynomial for unlabeled rooted trees and show that the polynomial of an unlabeled rooted tree $T$ is the generating function of a class of subtrees of $T$. We prove that the polynomial is a complete isomorphism…

A decision tree is commonly restricted to use a single hyperplane to split the covariate space at each of its internal nodes. It often requires a large number of nodes to achieve high accuracy, hurting its interpretability. In this paper,…

For quantum systems described by finite matrices, linear and affine maps of matrices are shown to provide equivalent descriptions of evolution of density matrices for a subsystem caused by unitary Hamiltonian evolution in a larger system;…

Determining the range of complex maps plays a fundamental role in the study of several complex variables and operator theory. In particular, one is often interested in determining when a given holomorphic function is a self-map of the unit…

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. For a graph G with a certain reflective symmetry, we generalize a result of Ciucu-Yan-Zhang factorizing the spanning tree…

We compute the continuous bounded cohomology of the full automorphism groups of regular trees in all positive degrees, with coefficients arising from any irreducible continuous unitary representations. To the author's knowledge, this seems…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

Hash codes are a very efficient data representation needed to be able to cope with the ever growing amounts of data. We introduce a random forest semantic hashing scheme with information-theoretic code aggregation, showing for the first…

A split-by-edges tree of a graph G on n vertices is a binary tree T where the root = V(G), every leaf is an independent set in G, and for every other node N in T with children L and R there is a pair of vertices {u, v} in N such that L = N…

Building on early work by Stevo Todorcevic, we describe a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize…

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…