English
Related papers

Related papers: More on trees and Cohen reals

200 papers

We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.

Group Theory · Mathematics 2011-10-21 Maciej Malicki

In this first paper, we look at the following question: are the properties of the Fibonacci tree still true if we consider a finitely generated tree by the same rules but rooted at a black node? The direct answer is no, but new properties…

Formal Languages and Automata Theory · Computer Science 2019-04-30 Maurice Margenstern

The article describes the structural and algorithmic relations between Cartesian trees and Lyndon Trees. This leads to a uniform presentation of the Lyndon table of a word corresponding to the Next Nearest Smaller table of a sequence of…

Data Structures and Algorithms · Computer Science 2017-12-27 Maxime Crochemore , Luis M. S. Russo

In this short note we discuss recent results on hook length formulas of trees unifying some earlier results, and explain hook length formulas naturally associated to families of increasingly labelled trees.

Combinatorics · Mathematics 2010-04-13 Markus Kuba

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…

Combinatorics · Mathematics 2013-02-12 Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

Imagine being able to ask questions to a black box model such as "Which adversarial examples exist?", "Does a specific attribute have a disproportionate effect on the model's prediction?" or "What kind of predictions could possibly be made…

Machine Learning · Computer Science 2021-05-19 Laurens Devos , Wannes Meert , Jesse Davis

We prove a revised version of Laver's indestructibility theorem which slightly improves over the classical result. An application yields the consistency of $(\kappa^+,\kappa)\notcc(\aleph\_1,\aleph\_0)$ when $\kappa$ is supercompact. The…

Logic · Mathematics 2007-05-23 Bernhard Koenig

In this paper, we investigate properties of countable stationary towers. We derive the regularity properties of sets of reals in $L(\mathbf R)$ from some properties of countable stationary towers without explicit use of strong large…

Logic · Mathematics 2020-10-27 Yo Matsubara , Toshimichi Usuba

Trees of finite cone type have appeared in various contexts. In particular, they come up as simplified models of regular tessellations of the hyperbolic plane. The spectral theory of the associated Laplacians can thus be seen as induced by…

Spectral Theory · Mathematics 2014-03-19 Matthias Keller , Daniel Lenz , Simone Warzel

We continue the investigations in the author's book on cardinal arithmetic, assuming some knowledge of it. We deal with the cofinality of (S_{<= aleph_0}(kappa), subseteq) for kappa real valued measurable (Section 3), densities of box…

Logic · Mathematics 2016-09-06 Saharon Shelah

We present an overview of results on the question of whether the non-stationary ideal of an uncountable regular cardinal $\kappa$ can be defined by a $\Pi_1$-formula using parameters of hereditary cardinality at most $\kappa$. These results…

Logic · Mathematics 2024-04-18 Philipp Lücke

Building on early work by Stevo Todorcevic, we describe a theory of stationary subtrees of trees of successor-cardinal height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize…

Logic · Mathematics 2015-07-22 Ari Meir Brodsky

In this third paper, we revisit the question to which extent the properties of the trees associated to the tilings $\{p,4\}$ of the hyperbolic plane are still true if we consider a finitely generated tree by the same rules but rooted at a…

Discrete Mathematics · Computer Science 2019-09-05 Maurice Margenstern

Starting with infinitely many supercompact cardinals, we show that the tree property at every cardinal $\aleph_n$, $1 < n <\omega$, is consistent with an arbitrary continuum function below $\aleph_\omega$ which satisfies $2^{\aleph_n} >…

Logic · Mathematics 2019-07-09 Sarka Stejskalova

We construct a large family of normal $\kappa$-complete $\mathbb{R}_\kappa$-embeddable non-special $\kappa^+$-Aronszajn trees which have no club isomorphic subtrees using an instance of the proxy principle of Brodsky-Rinot.

Logic · Mathematics 2022-11-29 John Krueger

If $\kappa$ is regular and $2^{<\kappa}\leq\kappa^+$, then the existence of a weakly presaturated ideal on $\kappa^+$ implies $\square^*_\kappa$. This partially answers a question of Foreman and Magidor about the approachability ideal on…

Logic · Mathematics 2020-10-01 Sean Cox , Monroe Eskew

We investigate the behavior of cardinal characteristics of the reals under extensions that do not add new ${<}\kappa$-sequences (for some regular $\kappa$). As an application, we show that consistently the following cardinal characteristics…

Logic · Mathematics 2021-05-18 Martin Goldstern , Jakob Kellner , Diego A. Mejía , Saharon Shelah

Despite widespread interest and practical use, the theoretical properties of random forests are still not well understood. In this paper we contribute to this understanding in two ways. We present a new theoretically tractable variant of…

Machine Learning · Statistics 2013-10-08 Misha Denil , David Matheson , Nando de Freitas

Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…

Combinatorics · Mathematics 2017-02-08 Song Guo , Victor J. W. Guo

In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.

Combinatorics · Mathematics 2016-02-19 Sebastian M. Cioabă , Xiaofeng Gu
‹ Prev 1 3 4 5 6 7 10 Next ›