Related papers: Trees
As data are increasingly modeled as graphs for expressing complex relationships, the tree pattern query on graph-structured data becomes an important type of queries in real-world applications. Most practical query languages, such as XQuery…
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical…
A perturbative formulation of algebraic field theory is presented, both for the classical and for the quantum case, and it is shown that the relation between them may be understood in terms of deformation quantization.
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
Tree-level Feynman diagrams in a cubic scalar theory can be given a metric such that each edge has a length. The space of metric trees is made out of orthants joined where a tree degenerates. Here we restrict to planar trees since each…
In the present article the author extends the Fourier transform to a more general class of functions; First to power-law functions with integer and half-integer exponents then to the widely used quantum statistics function (Fermi-Dirac and…
We obtain a general characterization of discrete-time all-pass rational matrix functions from state-space representations. It can be employed to address model reduction problems in the same vein of the theory developed by Glover in the…
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. More precisely, we show how to express partition functions as…
We show that variants of the classical reflection functors from quiver representation theory exist in any abstract stable homotopy theory, making them available for example over arbitrary ground rings, for quasi-coherent modules on schemes,…
We extend Forester's rigidity theorem so as to give a complete characterization of rigid group actions on trees (an action is rigid if it is the only reduced action in its deformation space, in particular it is invariant under automorphisms…
In mathematical physics, time-dependent Green's functions (GFs) are the solutions of differential equations of the first and second time derivatives. Habitually, the time-dependent GFs are Fourier transformed into the frequency space. Then,…
The predictions of the standard model of particle physics are highly successful in spite of the fact that several parts of the underlying quantum field theoretical framework are analytically problematic. Indeed, it has long been suggested,…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…
Extending the work of Freese, we further develop the theory of generalized trigonometric functions. In particular, we study to what extent the notion of polar form for the complex numbers may be generalized to arbitrary associative…
Hartle's generalized quantum mechanics in the sum-over-histories formalism is used to describe a nonabelian gauge theory. Predictions are made for certain alternatives, with particular attention given to coarse-grainings involving the…
Based on decision trees, many fields have arguably made tremendous progress in recent years. In simple words, decision trees use the strategy of "divide-and-conquer" to divide the complex problem on the dependency between input features and…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…
The algebraic theory of third-order tensors under the $t$-product is naturally formulated over the complex field via Fourier block diagonalization. However, many applications require real-valued representations. In this paper, we…