English
Related papers

Related papers: Mycielski among trees

200 papers

We prove a result on perfect cliques with respect to countably many G-delta relations on a complete metric space. As an application, we show that a Polish group contains a free subgroup generated by a perfect set as long as it contains any…

Logic · Mathematics 2015-10-20 Martin Doležal , Wiesław Kubiś

We work in the realm of sets of reals. We prove that in the Miller model and in a model constructed by Goldstern-Judah-Shelah all universally meager sets have size at most $\omega_1$. Some relations between combinatorial covering properties…

Logic · Mathematics 2025-12-18 Valentin Haberl , Piotr Szewczak , Lyubomyr Zdomskyy

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Logic in Computer Science · Computer Science 2026-02-20 Henning Urbat , Thorsten Wißmann

By the Galvin-Mycielski-Solovay theorem, a subset $X$ of the line has Borel's strong measure zero if and only if $M+X\neq\mathbb{R}$ for each meager set $M$. A set $X\subseteq\mathbb{R}$ is meager-additive if $M+X$ is meager for each meager…

General Topology · Mathematics 2018-06-19 Ondrej Zindulka

This paper is about the local geometry of a real surfaces. It introduces machinery for studying families of subsets which are determined by conditions which are similar to base conditions, but also involve positivity/non-negativity. The…

alg-geom · Mathematics 2008-02-03 Dean Alvis , Bernard Johnston , James Madden

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

The coarse similarity class $[A]$ of $A$ is the set of all $B$ whose symmetric difference with $A$ has asymptotic density 0. There is a natural metric $\delta$ on the space $\mathcal{S}$ of coarse similarity classes defined by letting…

Logic · Mathematics 2021-06-25 Denis R. Hirschfeldt , Carl G. Jockusch, , Paul E. Schupp

A perfect triangle is a triangle with rational sides, medians, and area. In this article, we use a similar strategy due to Pocklington to show that if $\Delta$ is a perfect triangle, then it cannot be an isosceles triangle. It gives a…

Number Theory · Mathematics 2020-12-14 Mehdi Makhul

It is shown that there exists a nontrivial uniform algebra that is Dirichlet on its maximal ideal space and has a dense set of elements that are exponentials. This answers a 65-year-old question of John Wermer and a 17-year-old question of…

Complex Variables · Mathematics 2025-12-23 Alexander J. Izzo

We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…

Group Theory · Mathematics 2007-05-23 Lee Mosher , Michah Sageev , Kevin Whyte

With each of the usual tree forcings I (e.g., I = Sacks forcing S, Laver forcing L, Miller forcing M, Mathias forcing R, etc.) we associate a sigma--ideal i^0 on the reals as follows: A \in i^0 iff for all T \in I there is S \leq T (i.e. S…

Logic · Mathematics 2016-09-06 Jörg Brendle

For a given ring (domain) in $\overline{\mathbb{R}}^n$ we discuss whether its boundary components can be separated by an annular ring with modulus nearly equal to that of the given ring. In particular, we show that, for all $n\ge 3\,,$ the…

Complex Variables · Mathematics 2020-06-03 Anatoly Golberg , Toshiyuki Sugawa , Matti Vuorinen

A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…

Logic · Mathematics 2018-11-05 Chitat Chong , Wei Li , Wei Wang , Yue Yang

Konig's theorem states that the covering number and the matching number of a bipartite graph are equal. We prove a generalisation of this result, in which each point in one side of the graph is replaced by a subtree of a given tree. The…

Combinatorics · Mathematics 2007-05-23 Ron Aharoni , Eli Berger , Ran Ziv

The classical Minkowski formula is extended to spacelike codimension-two submanifolds in spacetimes which admit "hidden symmetry" from conformal Killing-Yano two-forms. As an application, we obtain an Alexandrov type theorem for spacelike…

Differential Geometry · Mathematics 2016-07-05 Mu-Tao Wang , Ye-Kai Wang , Xiangwen Zhang

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…

Logic · Mathematics 2023-10-11 Paul Shafer

In this paper, we study necessary and sufficient conditions for the existence of categorical universal coverings using open covers of a given space $X$. As some applications, first we present a generalized version of the Shelah Theorem…

Algebraic Topology · Mathematics 2013-11-05 Ali Pakdaman , Hamid Torabi , Behrooz Mashayekhy

A foliation $(M,\mathcal{F})$ is said to be $2$--calibrated if it admits a closed 2-form $\omega$ making each leaf symplectic. By using approximately holomorphic techniques, a sequence $W_k$ of $2$--calibrated submanifolds of…

Differential Geometry · Mathematics 2018-07-31 David Martínez Torres , Álvaro del Pino , Francisco Presas

Minkowski's classical existence theorem provides necessary and sufficient conditions for a Borel measure on the unit sphere of Euclidean space to be the surface area measure of a convex body. The solution is unique up to a translation. We…

Metric Geometry · Mathematics 2020-08-18 Rolf Schneider

A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…

Combinatorics · Mathematics 2025-07-29 Micha Christoph , Nemanja Draganić , António Girão , Eoin Hurley , Lukas Michel , Alp Müyesser