English
Related papers

Related papers: A Kuratowski closure-complement variant whose solu…

200 papers

A famous result of Hausdorff states that a sphere with countably many points removed can be partitioned into three pieces A,B,C such that A is congruent to B (i.e., there is an isometry of the sphere which sends A to B), B is congruent to…

Metric Geometry · Mathematics 2021-02-09 Randall Dougherty

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…

Logic · Mathematics 2014-11-26 Márton Elekes , Tamás Keleti

In this paper we give a different approach to determining the cardinality of $h$-fold sumsets $hA$ when $A\subset \mathbb{Z}^d$ has $d+2$ elements. This enables us to provide more general result with a shorter and simpler proof. We also…

Number Theory · Mathematics 2022-11-10 Ilija Vrećica

Let $C$ be the classical middle third Cantor set. It is well known that $C+C = [0,2]$ (Steinhaus, 1917). (Here $+$ denotes the Minkowski sum.) Let $U$ be the set of $z \in [0,2]$ which have a unique representation as $z = x + y$ with $x, y…

Classical Analysis and ODEs · Mathematics 2022-10-20 Kevin G. Hare , Nikita Sidorov

The Wadge hierarchy was originally defined and studied only in the Baire space (and some other zero-dimensional spaces). We extend it here to arbitrary topological spaces by providing a set-theoretic definition of all its levels. We show…

Logic · Mathematics 2019-11-11 Victor Selivanov

We give a Kuratowski-type classification of a graph-defined class of minimal piecewise-linear obstructions to embeddability in the 3-sphere. A finite simplicial complex \(X\) is called critical for \(S^3\) if \(|X|\) does not embed in…

Geometric Topology · Mathematics 2026-05-13 Mario Eudave-Muñoz , Makoto Ozawa

The dot-depth hierarchy of Brzozowski and Cohen classifies the star-free languages of finite words. By a theorem of McNaughton and Papert, these are also the first-order definable languages. The dot-depth rose to prominence following the…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Thomas Place , Marc Zeitoun

We establish that if $d \geq 2k + 6$ and $q$ is odd and sufficiently large with respect to $\alpha \in (0,1)$, then every set $A\subseteq \mathbf{F}_q^d$ of size $|A| \geq \alpha q^d$ will contain an isometric copy of every spherical…

Combinatorics · Mathematics 2023-01-27 Neil Lyall , Akos Magyar , Hans Parshall

We consider a family of continued fraction expansions of any number in the unit closed interval $[0,1]$ whose digits are differences of consecutive non-positive integer powers of an integer $m \geq 2$. For this expansion, we apply the…

Number Theory · Mathematics 2013-08-22 Dan Lascu , Katsunori Kawamura

We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from graph theory. The input to the Weighted Diverse Bases problem…

Data Structures and Algorithms · Computer Science 2021-01-13 Fedor V. Fomin , Petr A. Golovach , Fahad Panolan , Geevarghese Philip , Saket Saurabh

A sequence of integers of the form $\lfloor n^{\alpha}\rfloor$ $(n=1,2,\ldots)$ for some fixed non-integral $\alpha>1$ is called a Piatetski-Shapiro sequence, where $\lfloor x\rfloor$ denotes the integer part of $x$. Let…

Number Theory · Mathematics 2025-09-11 Kota Saito

It is known how to compute the Zariski closure of a finitely generated monoid of matrices and, more generally, of a set of matrices specified by a regular language. This result was recently used to give a procedure to compute all polynomial…

Formal Languages and Automata Theory · Computer Science 2025-10-28 Rida Ait El Manssour , Mahsa Naraghi , Mahsa Shirmohammadi , James Worrell

We develop an untyped framework for the multiverse of set theory. $\mathsf{ZF}$ is extended with semantically motivated axioms utilizing the new symbols $\mathsf{Uni}(\mathcal{U})$ and $\mathsf{Mod}(\mathcal{U, \sigma})$, expressing that…

Logic · Mathematics 2021-07-01 Paul K. Gorbow , Graham E. Leigh

Much mathematical writing exists that is, explicitly or implicitly, based on set theory, often Zermelo-Fraenkel set theory (ZF) or one of its variants. In ZF, the domain of discourse contains only sets, and hence every mathematical object…

Logic in Computer Science · Computer Science 2020-05-29 Ciarán Dunne , J. B. Wells , Fairouz Kamareddine

In this paper, we consider certain cardinals in ZF (set theory without AC, the Axiom of Choice). In ZFC (set theory with AC), given any cardinals C and D, either C <= D or D <= C. However, in ZF this is no longer so. For a given infinite…

Logic · Mathematics 2016-09-06 Lorenz Halbeisen , Saharon Shelah

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…

Logic · Mathematics 2025-10-16 Yifan Hu , Ruihuan Mao , Guozhen Shen

This paper presents a new solution to the containment problem for extended regular expressions that extends basic regular expressions with intersection and complement operators and consider regular expressions on infinite alphabets based on…

Formal Languages and Automata Theory · Computer Science 2014-10-14 Matthias Keil , Peter Thiemann

Using a dictionary translating a variety of classical and modern covering properties into combinatorial properties of continuous images, we get a simple way to understand the interrelations between these properties in ZFC and in the realm…

Logic · Mathematics 2010-11-02 Boaz Tsaban , Lyubomyr Zdomskyy

Consider a variant of the usual story about the iterative conception of sets. As usual, at every stage, you find all the (bland) sets of objects which you found earlier. But you also find the result of tapping any earlier-found object with…

Logic · Mathematics 2024-04-23 Tim Button

Let $D$ be a bounded Lipschitz domain of $\mathbb{R}^d$. We consider the complement value problem $$ \left\{\begin{array}{l}(\Delta+a^{\alpha}\Delta^{\alpha/2}+b\cdot\nabla+c)u+f=0\ \ {\rm in}\ D,\\ u=g\ \ {\rm on}\ D^c.…

Probability · Mathematics 2019-11-27 Wei Sun