English
Related papers

Related papers: More on trees and Cohen reals

200 papers

Recently Iwasawa theory for graphs is developing. A significant achievement includes an analogue of Iwasawa class number formula, which describes the asymptotic growth of the numbers of spanning trees for $\mathbb{Z}_p$-coverings of graphs.…

Combinatorics · Mathematics 2024-07-25 Takenori Kataoka

This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show…

Logic · Mathematics 2026-02-20 Derek Levinson , Nam Trang , Trevor Wilson

We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…

Machine Learning · Computer Science 2008-07-21 François Denis , Amaury Habrard , Rémi Gilleron , Marc Tommasi , Édouard Gilbert

We provide analogues of the results from [FMR11, CMMR13] in the reference list (which correspond to the case $\kappa = \omega$) for arbitrary $\kappa$-Souslin quasi-orders on any Polish space, for $\kappa$ an infinite cardinal smaller than…

Logic · Mathematics 2019-03-19 Alessandro Andretta , Luca Motto Ros

Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…

Combinatorics · Mathematics 2023-01-18 Valentin Goranko , Ruaan Kellerman , Alberto Zanardo

We consider weighted generating functions of trees where the weights are products of functions of the sizes of the subtrees. This work begins with the observation that three different communities, largely independently, found substantially…

Combinatorics · Mathematics 2014-12-19 Bradley R. Jones , Karen Yeats

We extend A. Miller's framework of $\alpha$-forcing to the case of a regular uncountable cardinal $\kappa = \kappa^{<\kappa}$ and apply it to study the structure of the $\kappa$-Borel hierarchy on subspaces of the generalized Baire space…

Logic · Mathematics 2026-03-10 Nick Chapman

A $k$-ended tree is a tree with at most $k$ leaves. In this note, we give a simple proof for the following theorem. Let $G$ be a connected graph and $k$ be an integer ($k\geq 2$). Let $S$ be a vertex subset of $G$ such that $\alpha_{G}(S)…

Combinatorics · Mathematics 2018-10-29 Pham Hoang Ha

There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…

Logic · Mathematics 2008-03-25 Wesley Calvert , Sergey S. Goncharov , Julia F. Knight

Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…

Logic · Mathematics 2018-03-09 Vera Fischer , Daniel T. Soukup

We study effective randomness-preserving transformations of path-incompressible trees. Some path-incompressible trees with infinitely many paths do not compute perfect path-random trees with computable oracle-use. Sparse perfect…

Combinatorics · Mathematics 2024-01-11 George Barmpalias , Xiaoyan Zhang

The proofs that the real numbers are denumerable will be shown, i.e., that there exists one-to-one correspondence between the natural numbers $N$ and the real numbers $\Re$. The general element of the sequence that contains all real numbers…

General Mathematics · Mathematics 2007-05-23 Slavica Vlahovic , Branislav Vlahovic

This article is a supplementary document for the CoPPar Tree paper, providing a detailed correctness proof for the CoPPar architecture.

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-26 Xincheng Yang , Kyle Hale

We calculate the exact number of contours of size $n$ containing a fixed vertex in $d$-ary trees and provide sharp estimates for this number for more general trees. We also obtain a characterization of the locally finite trees with…

Combinatorics · Mathematics 2016-12-21 Noga Alon , Rodrigo Bissacot , Eric Ossami Endo

We associate with a plane meromorphic curve f a tree model T(f) based on its contact structure. Then we give a description of the y-derivative of f (resp. the Jacobien J(f,g)) in terms of T(f) (resp. T(fg)). We also characterize the…

Algebraic Geometry · Mathematics 2013-10-14 Abdallah Assi

Let $K$ be a complete discretely valued field with the residue field $\kappa$. Assume that cohomological dimension of $\kappa$ is less than or equal to $1$ (for example, $\kappa$ is an algebraically closed field or a finite field). Let $F$…

Algebraic Geometry · Mathematics 2023-07-06 Sumit Chandra Mishra

Tree properties are introduced by Shelah, and it is well-known that a theory has TP (the tree property) if and only if it has TP$_1$ or TP$_2$. In any simple theory (i.e., a theory not having TP), forking supplies a good independence notion…

Logic · Mathematics 2019-07-05 Enrique Casanovas , Byunghan Kim

Building upon work of L\"{u}cke and Schlicht, we study (higher) Kurepa trees through the lens of higher descriptive set theory, focusing in particular on various perfect set properties and representations of sets of branches through trees…

Logic · Mathematics 2024-12-02 Chris Lambie-Hanson , Šárka Stejskalová

We show that it is consistent that the continuum is as large as you wish, and for each uncountable cardinal $\kappa$ below the continuum, there are a subset $T$ of the reals and a family $A$ of countable subsets of $T$ such that (1) both…

Logic · Mathematics 2010-03-15 Lajos Soukup

We give characterizations for the existence of traces for first order Sobolev spaces defined on regular trees.

Functional Analysis · Mathematics 2021-12-28 Pekka Koskela , Khanh Ngoc Nguyen , Zhuang Wang