Related papers: Constructing non-uniquely ergodic arational trees
In this paper, the problem of pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding patterns of length one and two are obtained. Lagrange inversion formula is…
The goal of this paper is to construct a category of motivic "sheaves" on an algebraic variety defined over a subfield of C, using Nori's method. This categoryis abelian and it possesses faithful exact realization functors to the…
The paper proposes a new variant of a decision tree, called an Extreme Learning Tree. It consists of an extremely random tree with non-linear data transformation, and a linear observer that provides predictions based on the leaf index where…
Simple constructions are given for finite semifields that include as special cases both old semifields and recently constructed semifields.
In this paper adapting to $p$-adic case some methods of real valued Gibbs measures on Cayley trees we construct several $p$-adic distributions on the set $\mathbb{Z}_p$ of $p$-adic integers. Moreover, we give conditions under which these…
We survey techniques for constructing spaces with non-trivial self covers. These processes include methods for building low and high dimension continua which non-trivially self. We also discuss several related group theoretic and…
This article introduces tree substitutions as a tool to give explicit geometric representations of the dynamical systems generated by a particular set of automorphisms of the free group.
We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…
In this paper we study a new variant of graph arboricity, which requires all the forests to have the same number of edges (up to a difference of 1). We prove that the new variant, which we call equitable arboricity, is equivalent to…
We investigate a parametric extension of the classical s-dimensional Halton sequence, where the bases are special Pisot numbers. In a one- dimensional setting the properties of such sequences have already been in- vestigated by several…
We develop a technique for the construction of random fields on algebraic structures. We deal with two general situations: random fields on homogeneous spaces of a compact group and in the spin-line bundles of the 2-sphere. In particular,…
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…
We study marginally compact macromolecular trees that are created by means of two different fractal generators. In doing so, we assume Gaussian statistics for the vectors connecting nodes of the trees. Moreover, we introduce bond-bond…
Balancing square and rectangular tables by rotation has been a interesting way to illustrate the intermediate value theorem. The aim of this note is to show that the balancing act but with non-rectangular tables can be a nice application of…
Given a category with a bifunctor and natural isomorphisms for associativity, commutativity and left and right identity we do not assume that extra constraining diagrams hold. We introduce groupoids of coupling trees to describe a version…
In this note, we construct new solutions to the heterotic $\mathrm{G}_2$-system with non-abelian gauge group, both compact and non-compact, on certain $2$-step nilmanifolds and $3$-Sasakian manifolds. Our approach is based on an ansatz that…
We consider the creation conditions of diverse hierarchical trees both analytically and numerically. A connection between the probabilities to create hierarchical levels and the probability to associate these levels into a united structure…
Let T1, T2,.... Tk be spanning trees in a graph G. If for any pair of vertices u and v of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges then T1, T2,.... Tk are called edge-disjoint spanning trees in G.…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
The properties of randomly evolving special trees having defined and analyzed already in two earlier papers (arXiv:cond-mat/0205650 and arXiv:cond-mat/0211092) have been investigated in the case when the continuous time parameter converges…