相关论文: Constructing non-uniquely ergodic arational trees

Searching spatial data is an important operation for scientific simulations which are performed mostly with periodic boundary conditions. An R-Tree is a well known tree data structure used to contain spatial objects and it is capable of…

A constructive method is given for obtaining cospectral vertices in undirected graphs, along with an operation that preserves this construction. We prove that the construction yields cospectral vertices, as well as strongly cospectral…

We study, using the example of general covariance, to what extent a would-be non-abelian extension of free field abelian gauge theory can be helped by a field redefinition; answer - not much! However, models resulting from dimensional…

Most decision tree induction algorithms are based on a greedy top-down recursive partitioning strategy for tree growth. In this paper, we propose several methods for induction of decision trees and their ensembles based on evolutionary…

This is a guide to the construction of nonlinear number fields, which includes new points not found in our earlier article ``Geometric Galois theory, nonlinear number fields and a Galois group interpretation of the idele class group''.

We construct a general class of Calabi--Yau threefolds from fiber products of rational elliptic surfaces with section, generalizing a construction of Schoen to include all Kodaira fiber types. The resulting threefolds each have two elliptic…

A new construction of naturally reductive spaces is presented. This construction gives a large amount of new families of naturally reductive spaces. First the infinitesimal models of the new naturally reductive spaces are constructed. A…

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…

We present a consistent and highly scalable local approach to learn the causal structure of a linear Gaussian polytree using data from interventional experiments with known intervention targets. Our methods first learn the skeleton of the…

We extend the theory of ergodic optimization and maximizing measures to the non-commutative field of C*-dynamical systems. We then employ this ergodic optimization machinery to provide an alternate characterization of unique erogdicity of…

The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [Commutative semifields from projection mappings, Designs, Codes and Cryptography, 61 (2011), 187--196]. We…

Symmetric Jacobi matrices on one sided homogeneous trees are studied. Essential selfadjointness of these matrices turns out to depend on the structure of the tree. If a tree has one end and infinitely many origin points the matrix is always…

The aim of the present paper is on the one hand to produce examples supporting the conclusion of Y. Namikawa in Remark 2.8 of \cite{N} and improving considerations of Example 1.11 of the same paper. On the other hand, it is intended to give…

We give a systematic construction of inverse-closed (Banach) subalgebras in general higher-dimensional non-commutative tori

We develop the combinatorics of leveled trees in order to construct explicit resolutions of (co)operads and (co)operadic (co)bimodules. We build explicit cofibrant resolutions of operads and operadic bimodules in spectra analogous to the…

We extend the construction of bad fields of characteristic zero to the case of arbitrary prescribed divisible green torsion.

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…

In this paper we define a notion of gerbed tower, and use this notion to give a geometric representation of cohomological classes.

Arboreal networks are a generalization of rooted trees, defined by keeping the tree-like structure, but dropping the requirement for a single root. Just as the class of cographs is precisely the class of undirected graphs that can be…

Recent theory work has found that a special type of spatial partition tree - called a random projection tree - is adaptive to the intrinsic dimension of the data from which it is built. Here we examine this same question, with a combination…