Related papers: Reduced powers of Souslin trees

To every tree we associate a filtered cochain complex. Its cohomology and the corresponding spectral sequence have clear combinatorial description. If a tree is the Dynkin diagram of a simple plane curve singularity, the graded Euler…

Phylogenetic trees capture evolutionary relationships among species and reflect the forces that shaped them. While many studies rely on branch length information, the topology of phylogenetic trees (particularly their degree of imbalance)…

We obtain an array of consistency results concerning trees and stationary reflection at double successors of regular cardinals $\kappa$, updating some classical constructions in the process. This includes models of…

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…

Constraint automata are an adaptation of B\"uchi-automata that process data words where the data comes from some relational structure S. Every transition of such an automaton comes with constraints in terms of the relations of S. A…

We point out some connections between existence of homogenous sets for certain edge colorings and existence of branches in certain trees. As a consequence, we get that any locally additive coloring (a notion introduced in the paper) of a…

We show that it is possible to add $\kappa^+-$Cohen subsets to $\kappa$ with a Prikry forcing over $\kappa$. This answers a question from \cite{HayutBenhanouGitik}. A strengthening of non-Galvin property is introduced. It is shown to be…

It is shown that for any positive integer n there exists a subnormal weighted shift on a directed tree whose nth power is closed and densely defined while its (n + 1)th power has trivial domain. Similar result for composition operators in…

If the recent observations suggesting a time variation of the fine structure constant are correct, they imply the existence of an ultra light scalar particle. This particle inevitably couples to nucleons through the \alpha-dependence of…

We study (plane) tree-valued Markov chains $(T_n,n \geq 1)$ with uniform backward dynamics and show that they can be obtained by sampling from a real tree. As non--plane trees, every such Markov chain is represented by a weighted real tree.…

We study various types of consistency of honest decision trees and random forests in the regression setting. In contrast to related literature, our proofs are elementary and follow the classical arguments used for smoothing methods. Under…

We advance the Cohn-Umans framework for developing fast matrix multiplication algorithms. We introduce, analyze, and search for a new subclass of strong uniquely solvable puzzles (SUSP), which we call simplifiable SUSPs. We show that these…

Let $\mathcal{T}_n$ be the set of trees with $n$ vertices. Suppose that each tree in $\mathcal{T}_n$ is equally likely. We show that the number of different rooted trees of a tree equals $(\mu_r+o(1))n$ for almost every tree of…

We analyse the high-energy behavior of tree-level graviton Compton amplitudes for particles of mass m and arbitrary spin, concentrating on a combination of forward amplitudes that will be unaffected by eventual cross- couplings to other,…

The characteristics of tree level scattering amplitudes in theories with nonlinear (super)symmetries were recently proposed by Kallosh to be encoded in a simple way directly from the action, based on a background field method. We check this…

We investigate the problem of ordering trees according to their Laplacian energy. More precisely, given a positive integer $n$, we find a class of cardinality approximately $\sqrt{n}$ whose elements are the $n$-vertex trees with largest…

Let $t$ be a rooted tree and $n_i(t)$ the number of nodes in $t$ having $i$ children. The degree sequence $(n_i(t),i\geq 0)$ of $t$ satisfies $\sum_{i\ge 0} n_i(t)=1+\sum_{i\ge 0} in_i(t)=|t|$, where $|t|$ denotes the number of nodes in…

We quantise the reduced theory obtained by substituting the soliton solutions of affine Toda theory into its symplectic form. The semi-classical S-matrix is found to involve the classical Euler dilogarithm.

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

We introduce the split principles and show that they bear tight connections to large cardinal properties such as inaccessibility, weak compactness, subtlety, almost ineffability and ineffability, as well as classical combinatorial objects…