Related papers: On full Souslin trees
Building on recent work of Krueger and the second author, we prove the consistency of the Guessing Model Principle at $\omega_2$ together with the existence of an almost Kurepa Suslin tree. In particular, it is consistent that the Guessing…
Maxmin trees are labeled trees with the property that each vertex is either a local maximum or a local minimum. Such trees were originally introduced by Postnikov, who gave a formula to count them and different combinatorial interpretations…
In this paper we examine the relationship between hyperconvex hulls and metric trees. After providing a linking construction for hyperconvex spaces, we show that the four-point property is inherited by the hyperconvex hull, which leads to…
We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.
The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these…
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
This article is a conceptual exposition on the structure of the tree. It demonstrates an evolutionary design that the tree possesses in the perspective of a structural engineer.
We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…
In response to a well-known open question ``Does every complete geometric graph on $2n\/$ vertices have a partition of its edge set into $n\/$ plane spanning trees?" we provide an affirmative answer when the complete geometry graph is in…
The Sackin index is an important measure for the balance of phylogenetic trees. We investigate two extensions of the Sackin index to the class of galled trees and two of its subclasses (simplex galled trees and normal galled trees) where we…
In this note, we prove a conjecture of Puder on an extension of the co-growth formula to any non-negative function defined on a bi-regular tree. A key component of our proof is the establishment of a resolvent identity, which serves as an…
We built some congruences on semigroups, from where a decomposition of quasi-separative semigroups was obtained.
For horocyclic products of percolation subtrees of regular trees, we show almost sure amenability. Under a symmetry condition concerning the growth of the two percolation trees, we show the existence of an increasing Foelner sequence (which…
Let $T$ be a tree on $n$ vertices. We can regard the edges of $T$ as transpositions of the vertex set; their product (in any order) is a cyclic permutation. All possible cyclic permutations arise (each exactly once) if and only if the tree…
We prove that any quasigroup admissing complete or quasicomplete mapping has a prolongation to a quasigroup having one element more.
This is a large audience version of our previous work (see math.AG/0301146) in which we prove the existence of an (exact) equivalence between the category of coherent analytic sheaves and the category of $\bar{\partial}$-coherent sheaves.…
A congruence $\varepsilon$ on a semigroup $S$ is perfect if for any congruence classes $x\varepsilon$ and $y\varepsilon$ their product as subsets of $S$ coincides (as a set) with the congruence class $(xy)\varepsilon$. Perfect congruences…
In this paper we are interested in the following question: Given an arbitrary Steiner triple system $S$ on $m$ vertices and any 3-uniform hypertree $T$ on $n$ vertices, is it necessary that $S$ contains $T$ as a subgraph provided $m \geq…
In this paper two new graph operations are introduced, and with them the S-trees are studied in depth. This allows to find \(\{-1,0,1\}\)-basis for all the fundamental subspaces of the adjacency matrix of any tree, and to understand in…
Sumner's universal tournament conjecture states that any tournament on $2n-2$ vertices contains a copy of any directed tree on $n$ vertices. We prove an asymptotic version of this conjecture, namely that any tournament on $(2+o(1))n$…