English
Related papers

Related papers: Nonmeasurable sets in tree structures and Ellentuc…

200 papers

A test space is the set of outcome-sets associated with a collection of experiments. This notion provides a simple mathematical framework for the study of probabilistic theories -- notably, quantum mechanics -- in which one is faced with…

Quantum Physics · Physics 2009-11-10 Alexander Wilce

Kuratowski's 14-set theorem says that in a topological space, 14 is the maximum possible number of distinct sets which can be generated from a fixed set by taking closures and complements. In this article we consider the analogous questions…

General Topology · Mathematics 2007-05-23 David Sherman

We show that under some conditions on a family $\mathcal{A}\subset\bbi$ there exists a subfamily $\mathcal{A}_0\subset\mathcal{A}$ such that $\bigcup \mathcal{A}_0$ is nonmeasurable with respect to a fixed ideal $\bbi$ with Borel base of a…

General Topology · Mathematics 2010-09-07 Robert Ralowski

In this paper we look for the existence of large linear and algebraic structures of sequences of measurable functions with different modes of convergence. Concretely, the algebraic size of the family of sequences that are convergent in…

Functional Analysis · Mathematics 2019-12-19 M. Carmen Calderón-Moreno , Pablo J. Gerlach-Mena , José A. Prado-Bassas

We establish a dynamical version of Kuratowski-Mycielski Theorem on the existence of "large" invariant dependent sets. We apply this result to the study of invariant chaotic sets in topological dynamical systems, simplify many known results…

Dynamical Systems · Mathematics 2021-04-29 Jian Li , Jie Lü , Yuanfen Xiao

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…

Optimization and Control · Mathematics 2016-11-10 Víctor Blanco , Elena Fernández , Justo Puerto

For a given partially ordered set (poset) and a given family of mappings of the poset into itself, we study the problem of the description of joint fixed points of this family. Well-known Tarski's theorem gives the structure of the set of…

Logic · Mathematics 2016-02-05 Dmitrii Serkov

We show that for a metric space with an even number of points there is a 1-Lipschitz map to a tree-like space with the same matching number. This result gives the first basic version of an unoriented Kantorovich duality. The study of the…

Metric Geometry · Mathematics 2016-09-22 Mircea Petrache , Roger Züst

Inspired by Ol'shanskii's work, we provide an axiomatic framework to describe certain irreducible unitary representations of non-discrete unimodular totally disconnected locally compact groups. We then look at the applications to certain…

Group Theory · Mathematics 2022-03-10 Lancelot Semal

The aim of this paper is to establish some results regarding Infinite Iterated Function Systems with the help of the Tarski-Kantorovitch fixed-point principles for maps on partially ordered sets. To this end we introduce two new classes of…

Dynamical Systems · Mathematics 2021-10-12 Bogdan-Alexandru Luchian

This is a draft of a book submitted for publication by the AMS. Its theme is the remarkable interplay, accelerating in the last few decades, between topology and the theory of orderable groups, with applications in both directions. It…

Geometric Topology · Mathematics 2015-11-17 Adam Clay , Dale Rolfsen

We give, for some Borel sets of a product of two Polish spaces, including the Borel sets with countable sections, a Hurewicz-like characterization of those which cannot become a transfinite difference of open sets by changing the two Polish…

Logic · Mathematics 2007-10-02 Dominique Lecomte

The enumeration degrees of sets of natural numbers can be identified with the degrees of difficulty of enumerating neighborhood bases of points in a universal second-countable $T_0$-space (e.g. the $\omega$-power of the Sierpi\'nski space).…

General Topology · Mathematics 2020-09-18 Takayuki Kihara , Keng Meng Ng , Arno Pauly

Let $X$ be a partially ordered set with the property that each family of order intervals of the form $[a,b],[a,\rightarrow )$ with the finite intersection property has a nonempty intersection. We show that every directed subset of $X$ has a…

General Topology · Mathematics 2018-09-25 Rafael Espínola , Andrzej Wiśnicki

In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…

Computational Complexity · Computer Science 2010-06-03 Yongcheng Wu

In 1987, I. Labuda proved a general representation theorem that, as a special case, shows that the topology of local convergence in measure is the minimal topology on Orlicz spaces and $L_{\infty}$. Minimal topologies connect with the…

Functional Analysis · Mathematics 2017-09-19 Marko Kandić , Mitchell A. Taylor

We construct a nonseparable Banach space $\mathcal X$ (actually, of density continuum) such that any uncountable subset $\mathcal Y$ of the unit sphere of $\mathcal X$ contains uncountably many points distant by less than $1$ (in fact, by…

Functional Analysis · Mathematics 2021-06-09 Piotr Koszmider

We define and study an effective version of the Wadge hierarchy in computable quasi-Polish spaces which include most spaces of interest for computable analysis. Along with hierarchies of sets we study hierarchies of k-partitions which are…

Logic in Computer Science · Computer Science 2021-02-16 Victor Selivanov