相关论文: The canary tree
A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…
Generalized trees, we call them O-trees, are defined as hierarchical partial orders, i.e., such that the elements larger than any one are linearly ordered. Quasi-trees are, roughly speaking, undirected O-trees. For O-trees and quasi-trees,…
A Concept Tree is a structure for storing knowledge where the trees are stored in a database called a Concept Base. It sits between the highly distributed neural architectures and the distributed information systems, with the intention of…
Suppose that there's no transitive model of ZFC + there's a strong cardinal, and let K denote the core model. It is shown that if \delta has the tree property then \delta^{+K} = \delta^+ and \delta is weakly compact in K.
We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…
We study the structured rainbow Ramsey theory at uncountable cardinals. When compared to the usual rainbow Ramsey theory, the variation focuses on finding a rainbow subset that not only is of a certain cardinality but also satisfies certain…
A quasiconformal tree $T$ is a (compact) metric tree that is doubling and of bounded turning. We call $T$ trivalent if every branch point of $T$ has exactly three branches. If the set of branch points is uniformly relatively separated and…
In this paper, we study the independence of shifts defined on $\mathbb{N}^d$ ($\mathbb{N}^d$ shift) and trees (tree-shift). Firstly, for the completeness of the article, we provide a proof that an $\mathbb{N}^d$ shift has positive…
In this paper we study the theories of the infinite-branching tree and the $r$-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of…
From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet…
We propose a new formalism for quantum field theory which is neither based on functional integrals, nor on Feynman graphs, but on marked trees. This formalism is constructive, i.e. it computes correlation functions through convergent rather…
A $k$-block in a graph $G$ is a maximal set of at least $k$ vertices no two of which can be separated in $G$ by removing less than $k$ vertices. It is separable if there exists a tree-decomposition of adhesion less than $k$ of $G$ in which…
Tangle structure trees, introduced in [3], offer a unified data structure that displays all the tangles of a graph or data set together with certificates for the non-existence of any other tangles, either locally or overall. In this paper…
We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…
For a model of molecular evolution to be useful for phylogenetic inference, the topology of evolutionary trees must be identifiable. That is, from a joint distribution the model predicts, it must be possible to recover the tree parameter.…
Any algebraic connection on a vector bundle on a smooth complex algebraic curve determines an irregular class and in turn a fission tree at each puncture. The fission trees are the discrete data classifying the admissible deformation…
A set D of vertices of a graph G with vertex set V is irredundant if each non-isolated vertex of G[D] has a neighbour in V-D that is not adjacent to any other vertex in D. The upper irredundance number IR(G) is the largest cardinality of an…
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…
We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.