English
Related papers

Related papers: Kurepa trees, continuous images, and perfect set p…

200 papers

We consider the following problem: Given a finite set of straight line segments in the plane, determine the positions of a minimal number of points on the segments, from which guards can see all segments. This problem can be interpreted as…

Computational Geometry · Computer Science 2015-03-14 Valentin E. Brimkov

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…

Logic · Mathematics 2009-09-25 Saharon Shelah

We here investigate on the complexity of computing the \emph{tree-length} and the \emph{tree-breadth} of any graph $G$, that are respectively the best possible upper-bounds on the diameter and the radius of the bags in a tree decomposition…

Computational Complexity · Computer Science 2016-01-11 Guillaume Ducoffe , Sylvain Legay , Nicolas Nisse

Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…

Combinatorics · Mathematics 2012-06-15 Shuchao Li , Shujing Wang

For $p\in [1,\infty]$, we define a smooth manifold structure on the set $AC_{L^p}([a,b],N)$ of absolutely continuous functions $\gamma\colon [a,b]\to N$ with $L^p$-derivatives for all real numbers $a<b$ and each smooth manifold $N$ modeled…

Functional Analysis · Mathematics 2025-05-30 Matthieu F. Pinaud

We study product set growth in groups with acylindrical actions on quasi-trees and, more generally, hyperbolic spaces. As a consequence, we show that for every surface $S$ of finite type, there exist $\alpha,\beta>0$ such that for any…

Group Theory · Mathematics 2025-09-24 Alice Kerr

Let $G$ be a graph on $n$ vertices. For $i\in \{0,1\}$ and a connected graph $G$, a spanning forest $F$ of $G$ is called an $i$-perfect forest if every tree in $F$ is an induced subgraph of $G$ and exactly $i$ vertices of $F$ have even…

Combinatorics · Mathematics 2021-07-09 Gregory Gutin , Anders Yeo

We prove that one can perfectly pack degenerate graphs into complete or dense $n$-vertex quasirandom graphs, provided that all the degenerate graphs have maximum degree $o(\frac{n}{\log n})$, and in addition $\Omega(n)$ of them have at most…

Combinatorics · Mathematics 2019-06-28 Peter Allen , Julia Böttcher , Dennis Clemens , Anusch Taraz

There is a forgetful map from the mapping class group of a punctured surface to that of the surface with one fewer puncture. We prove that finitely generated purely pseudo-Anosov subgroups of the kernel of this map are convex cocompact in…

Geometric Topology · Mathematics 2007-09-10 Richard P. Kent , Christopher J. Leininger , Saul Schleimer

In this paper, we present a complete characterization of mutual-visibility sets in trees. It is shown that a subset $S$ is a mutual-visibility set of a tree $T$ if and only if it coincides with the set of leaves of the Steiner subtree…

Combinatorics · Mathematics 2026-05-20 Tonny K B , Shikhi M

Let $G$ be a countable branch group of automorphisms of a spherically homogeneous rooted tree. Under some assumption on finitarity of $G$, we construct, for each sequence $\omega\in\{0,1\}^\Bbb N$, an irreducible unitary representation…

Dynamical Systems · Mathematics 2025-03-07 Alexandre I. Danilenko , Artem Dudko

We study some topological properties of trees with the interval topology. In particular, we characterize trees which admit a 2-fibered compactification and we present two examples of trees whose one-point compactifications are Rosenthal…

General Topology · Mathematics 2012-10-23 Wiesław Kubiś , Aníbal Moltó

Working in Zermelo-Fraenkel Set Theory with Atoms over an $\omega$-categorical $\omega$-stable structure, we show how \emph{infinite} constructions over definable sets can be encoded as \emph{finite} constructions over the Stone-\v{C}ech…

Logic in Computer Science · Computer Science 2024-02-13 Michał R. Przybyłek

We study analogues of Cartan decompositions of Lie groups for totally disconnected locally compact groups. It is shown using these decompositions that a large class of totally disconnected locally compact groups acting on trees and…

Group Theory · Mathematics 2025-03-28 Max Carter , George A. Willis

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

A topological group $G$ is {\em sequentially $h$-complete} if all the continuous homomorphic images of $G$ are sequentially complete. In this paper we give necessary and sufficient conditions on a complete group for being compact, using the…

Group Theory · Mathematics 2011-09-27 Gábor Lukács

For a given metric space $(P,\phi)$, a tree cover of stretch $t$ is a collection of trees on $P$ such that edges $(x,y)$ of trees receive length $\phi(x,y)$, and such that for any pair of points $u,v\in P$ there is a tree $T$ in the…

Computational Geometry · Computer Science 2025-08-26 Artur Bikeev , Andrey Kupavskii , Maxim Turevskii

We give exact values and bounds on the isoperimetric peak of complete trees, improving on known results. For the complete $q$-ary tree of depth $d$, if $q\ge 5$, then we find that the isoperimetric peak equals $d$, completing an open…

Combinatorics · Mathematics 2025-11-11 Anthony Bonato , Lazar Mandic , Trent G. Marbach , Matthew Ritchie

Our aim is to prove that if T is a complete first order theory, which is not superstable (no knowledge on this notion is required), included in a theory T_1 then for any lambda > |T_1| there are 2^lambda models of T_1 such that for any two…

Logic · Mathematics 2026-05-07 Saharon Shelah

In this paper, we introduce the prime trees associated with a finite subset $P$ of the set of all prime numbers, and provide conditions under which the tree is of finite type. Moreover, we compute the density of finite-type subsets $P$. As…

Number Theory · Mathematics 2026-02-02 Yusuke Fujiyoshi