相关论文: Potential isomorphism and semi-proper trees

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…

We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…

Starting from a stationary set of supercompact cardinals we find a generic extension in which the tree property holds at every regular cardinal between $\aleph_2$ and $\aleph_{\omega^2}$.

Several variants of the Halpern-L\"auchli Theorem for trees of uncountable height are investigated. For $\kappa$ weakly compact, we prove that the various statements are all equivalent. We show that the strong tree version holds for one…

Assuming the existence of a strong cardinal and a measurable cardinal above it, we construct a model of $ZFC$ in which for every singular cardinal $\delta$, $\delta$ is strong limit, $2^\delta=\delta^{+3}$ and the tree property at…

The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common…

Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…

We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…

Let $\mathrm{cof}(\mu)=\mu$ and $\kappa$ be a supercompact cardinal with $\mu<\kappa$. Assume that there is an increasing and continuous sequence of cardinals $\langle\kappa_\xi\mid \xi<\mu\rangle$ with $\kappa_0:=\kappa$ and such that, for…

For an inaccessible cardinal $\kappa$, the super tree property (ITP) at $\kappa$ holds if and only if $\kappa$ is supercomact. However, just like the tree property, it can hold at successor cardinals. We show that ITP holds at the successor…

We construct a pair of non-isomorphic, bipartite graphs which are not distinguished by counting the number of homomorphisms to any tree. This answers a question motivated by Atserias et al. (LICS 2021). In order to establish the…

In this paper we prove that the tree property can hold on regular cardinals in an interval which overlaps a strong limit cardinal. This is a crucial milestone in the long term project, tracing back to a question raised by Foreman and…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We first identify (up to linear isomorphism) the Lipschitz free spaces of quasiarcs. By decomposing quasiconformal trees into quasiarcs as done in an article of David, Eriksson-Bique, and Vellis, we then identify the Lipschitz free spaces…

The reconstruction of a central tendency `species tree' from a large number of conflicting gene trees is a central problem in systematic biology. Moreover, it becomes particularly problematic when taxon coverage is patchy, so that not all…

This work is a part of my upcoming thesis [7]. We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2)…

In this paper we elaborate on the structure of the semigroup tree and the regularities on the number of descendants of each node observed earlier. These regularites admit two different types of behavior and in this work we investigate which…

In recent years several classes of structured matrices are extended to classes of tensors in the context of tensor complementarity problem. The tensor complementarity problem is a class of nonlinear complementarity problem where the…

We prove that given a fixed finite tree $P$, almost all trees contain $P$ as a subtree. Moreover, the inclusion can be made so that it induces an embedding of the corresponding (quantum) automorphism groups, thereby providing generic…

This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…