Arithmetic cusp shapes are dense

In this article we verify an orbifold version of a conjecture of Nimershiem from 1998. Namely, for every flat n-manifold M, we show that the set of similarity classes of flat metrics on M which occur as a cusp cross-section of a hyperbolic (n + 1)-orbifold is dense in the space of similarity classes of flat metrics on M. The set used for density is precisely the set of those classes which arise in arithmetic orbifolds.      

Homogeneous trees are bilipschitz equivalent

We prove that any two locally finite homogeneous trees with valency greater than 3 are bilipschitz equivalent. This implies that the quotienth ¹(G)/h ^k (G), whereh ^k (G) is thekthL ₂-Betti number ofG, is not a quasi-isometry invariant.     

A model in which there are Jech-Kunen trees but there are no Kurepa trees

By an ω₁-tree we mean a tree of power ω₁ and height ω₁. We call an ω₁-tree a Jech-Kunen tree if it hask-many branches for somek strictly between ω₁ and 2^ω1. In this paper we construct the models of CH plus 2^ω1 > ω₂, in which there are Jech-Kunen trees and there are no Kurepa trees. The research of the first author was partially supported by the Basic Research Fund, Israeli Academy of Science, Publ. No. 466.     

The stable trees are nested

We show that we can construct simultaneously all the stable trees as a nested family. More precisely, if $1 < \alpha < \alpha ^{\prime } \le 2$ we prove that hidden inside any $\alpha $ -stable tree we can find a version of an $\alpha ^{\prime }$ -stable tree rescaled by an independent Mittag-Leffler type distribution. This tree can be explicitly constructed by a pruning procedure of the underlying stable tree or by a modification of the fragmentation associated with it. Our proofs are based on a recursive construction due to Marchal which is proved to converge almost surely towards a stable tree.     

Which trees are link graphs?

The link of a vertex v of a graph G is the subgraph induced by all vertices adjacent to v. If all the links of G are isomorphic to L, then G has constant link and L is called a link graph. We investigate the trees of order p≤9 to see which are link graphs. Group theoretic methods are used to obtain constructions of graphs G with constant link L for certain trees L. Necessary conditions are derived for the existence of a graph having a given graph L as its constant link. These conditions show that many trees are not link graphs. An example is given to show that a connected graph with constant link need not be point symmetric.     

Coherent trees that are not Countryman

First, we show that every coherent tree that contains a Countryman suborder is \({\mathbb {R}}\)-embeddable when restricted to a club. Then for a linear order O that can not be embedded into \(\omega \), there exists (consistently) an \({{\mathbb {R}}}\)-embeddable O-ranging coherent tree which is not Countryman. And for a linear order \(O'\) that can not be embedded into \({\mathbb {Z}}\), there exists (consistently) an \({\mathbb {R}}\)-embeddable \(O'\)-ranging coherent tree which contains no Countryman suborder. Finally, we will see that this is the best we can do.     

Subdivided trees are integral sum graphs

A graph G=(V,E) is an integral sum graph (ISG) if there exists a labeling S(G)⊂Z such that V=S(G) and for every pair of distinct vertices u,v∈V, uv is an edge if and only if u+v∈V. A vertex in a graph is called a fork if its degree is not 2. In 1998, Chen proved that every tree whose forks are at distance at least 4 from each other is an ISG. In 2004, He et al. reduced the distance to 3. In this paper we reduce the distance further to 2, i.e. we prove that every tree whose forks are at least distance 2 apart is an ISG.     

Sobolev homeomorphisms are dense in volume preserving automorphisms

In this paper we prove a weak version of Lusin's theorem for the space of Sobolev-$(1,p)$ volume preserving homeomorphisms on closed and connected n-dimensional manifolds, $n\ge 3$, for $p<n?1$. We also prove that if $p>n$ this result is not true. More precisely, we obtain the density of Sobolev-$(1,p)$ homeomorphisms in the space of volume preserving automorphisms, for the weak topology. Furthermore, the regularization of an automorphism in a uniform ball centered at the identity can be done in a Sobolev-$(1,p)$ ball with the same radius centered at the identity.     

Mahler measures in a field are dense modulo 1

Let K be a number field. We prove that the set of Mahler measures M(α), where α runs over every element of K, modulo 1 is everywhere dense in [0, 1], except when or , where D is a positive integer. In the proof, we use a certain sequence of shifted Pisot numbers (or complex Pisot numbers) in K and show that the corresponding sequence of their Mahler measures modulo 1 is uniformly distributed in [0, 1]. Received: 24 March 2006     

The complete finitely axiomatized theories of order are dense

We prove a conjecture of Lauchli and Leonard that every sentence of the theory of linear order which has a model, has a model with a finitely axiomatized theory.     

Simplicial trees are sequentially Cohen–Macaulay

This paper uses dualities between facet ideal theory and Stanley–Reisner theory to show that the facet ideal of a simplicial tree is sequentially Cohen–Macaulay. The proof involves showing that the Alexander dual (or the cover dual, as we call it here) of a simplicial tree is a componentwise linear ideal. We conclude with additional combinatorial properties of simplicial trees.     

Two trees which are self-intersecting when drawn simultaneously

A current topic in graph drawing is the question how to draw two edge sets on the same vertex set, the so-called simultaneous drawing of graphs. The goal is to simultaneously find a nice drawing for both of the sets. It has been found out that only restricted classes of planar graphs can be drawn simultaneously using straight lines and without crossings within the same edge set. In this paper, we negatively answer one of the most often posted open questions namely whether any two trees with the same vertex set can be drawn simultaneously crossing-free in a straight-line way.     

All trees are 1-embeddable and all except stars are 2-embeddable

A graph G with n vertices is said to be embeddable (in its complement) if there is an automorphism φ of K_n such that E(G) ∩ E(φ(G))=. It is known that all trees T with n (≥2) vertices and T K_1,n−1 are embeddable. We say that G is 1-embeddable if, for every edge e, there is an automorphism φ of K_n such that E(G) ∩ E(φ(G))={e};and that it is 2-embeddable if,for every pair e₁, e₂ of edges, there is an automorphism φ of K_n such that E(G) ∩ E(φ(G))={e₁, e₂}. We prove here that all trees with n (3) vertices are 1-embeddable; and that all trees T with n (4) vertices and T K_1,n−1 are 2-embeddable. In a certain sense, this result is sharp.