Related papers: Trees
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
In [Dugan-Glennon-Gunnells-Steingrimsson-2019], the authors introduce tiered trees to define combinatorial objects counting absolutely indecomposable representations of certain quivers, and torus orbits on certain homogeneous varieties. In…
Parking functions of length $n$ are well known to be in correspondence with both labelled trees on $n+1$ vertices and factorizations of the full cycle $\sigma_n=(0\,1\,\cdots\,n)$ into $n$ transpositions. In fact, these correspondences can…
A general formalism is developed that allows the construction of field theory on quantum spaces which are deformations of ordinary spacetime. The symmetry group of spacetime is replaced by a quantum group. This formalism is demonstrated for…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
I review the formalism, Feynman rules, and combinatorics that constrain a field to propagate ``classically", strictly in tree diagrams, either by itself, or interacting with other, purely quantum fields. The perturbation theory is…
The past few years have seen intensive research efforts carried out in some apparently unrelated areas of dynamic systems -- delay-tolerant networks, opportunistic-mobility networks, social networks -- obtaining closely related insights.…
We prove a common generalization of the celebrated Sauer-Spencer packing theorem and a theorem of Brandt concerning finding a copy of a tree inside a graph. This proof leads to the characterization of the extremal graphs in the case of…
We introduce Tree Decision Diagrams (TDD) as a model for Boolean functions that generalizes OBDD. They can be seen as a restriction of structured d-DNNF; that is, d-DNNF that respect a vtree $T$. We show that TDDs enjoy the same…
The solution of some equations involving functional derivatives is given as a series indexed by planar binary trees. The terms of the series are given by an explicit recursive formula. Some algebraic properties of these series are…
In this paper we start a systematic study of quantum field theory on random trees. Using precise probability estimates on their Galton-Watson branches and a multiscale analysis, we establish the general power counting of averaged Feynman…
This manuscript proposes to extend the information set of time-series regression trees with latent stationary factors extracted via state-space methods. In doing so, this approach generalises time-series regression trees on two dimensions.…
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
Quantum graphs model processes in complex systems represented as spatial networks in various fields of natural science and technology. An example is the oscillations of elastic string networks, the nodes of which, besides the continuity…
In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
When one tries to take into account the non-trivial vacuum structure of Quantum Field Theory, the standard functional-integral tools such as generating functionals or transitional amplitudes, are often quite inadequate for such purposes.…
For temporal magnitudes describing, in details, processes of particles scattering for a long time at each necessity case a particular, ad hoc reception were used. However the desirability of general approach basing on concepts of quantum…
We develop a theory of umkehr maps for twisted generalized homology theories. In this theory, interesting umkehr maps, including generalizations of important classical ones, are induced by cartesian morphisms of a certain category opfibred…