English
Related papers

Related papers: Operations with slicely countably determined sets

200 papers

We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in $o$-minimal expansions of fields. Using it, we…

Logic · Mathematics 2020-02-28 Artem Chernikov , David Galvin , Sergei Starchenko

In 1934, Whitney raised the question of how to recognize whether a function f defined on a closed subset X of Euclidean space is the restriction of a function that is continuously differentiable to order p. A necessary and sufficient…

Algebraic Geometry · Mathematics 2007-05-23 E. Bierstone , P. D. Milman , W. Pawlucki

We shall establish some properties of thin $\sigma$-ideals of compact sets in compact metric spaces (in particular, the $\sigma$-ideals of compact null-sets for thin subadditive capacities), and we shall refine the celebrated theorem of…

General Topology · Mathematics 2019-12-10 Roman Pol , Piotr Zakrzewski

We introduce the split principles and show that they bear tight connections to large cardinal properties such as inaccessibility, weak compactness, subtlety, almost ineffability and ineffability, as well as classical combinatorial objects…

Logic · Mathematics 2024-11-26 Gunter Fuchs , Kaethe Minden

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

Number Theory · Mathematics 2025-03-07 Alina Ostafe , Carl Pomerance , Igor E. Shparlinski

The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.

Formal Languages and Automata Theory · Computer Science 2015-09-02 Eric Rowland , Jeffrey Shallit

We study uniform and non-uniform model sets in arbitrary locally compact second countable (lcsc) groups, which provide a natural generalization of uniform model sets in locally compact abelian groups as defined by Meyer and used as…

Dynamical Systems · Mathematics 2020-02-14 Michael Björklund , Tobias Hartnick , Felix Pogorzelski

Starting from a result of Stewart, Tijdeman and Ruzsa on iterated difference sequences, we introduce the notion of iterated compositions of linear operations. We prove a general result on the stability of such compositions (with bounded…

Number Theory · Mathematics 2010-05-21 Norbert Hegyvári , Francois Hennecart , Alain Plagne

In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept was extended to more general stochastic transition systems…

Logic in Computer Science · Computer Science 2020-09-24 Patricia Bouyer , Thomas Brihaye , Mickael Randour , Cédric Rivière , Pierre Vandenhove

We derive new estimates on analytic capacities of finite sequences in the unit disc in Besov spaces with zero smoothness, which sharpen the estimates obtained by N.K.Nikolski in 2005 and, for a range of parameters, are optimal. The work is…

Complex Variables · Mathematics 2024-07-16 Anton Baranov , Michael Hartz , Ilgiz Kayumov , Rachid Zarouf

We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…

Symbolic Computation · Computer Science 2024-11-21 Lucas Michel , Pierre Mathonet , Naïm Zénaïdi

We provide a class of necessary and sufficient conditions for the discreteness of spectrum of Schr\"odinger operators with scalar potentials which are semibounded below. The classical discreteness of spectrum criterion by A.M.Molchanov…

Spectral Theory · Mathematics 2007-05-23 Vladimir Maz'ya , Mikhail Shubin

We construct new models of $ZF$ with an uncountable set of reals that has a unique condensation point. This addresses a question by Sierpi\'{n}ski from 1918.

Logic · Mathematics 2018-12-27 Eilon Bilinsky

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

Logic in Computer Science · Computer Science 2007-05-23 Viktor Kuncak , Martin Rinard

Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…

Functional Analysis · Mathematics 2016-10-26 Tomasz Kania , Tomasz Kochanek

In this paper we prove two new abstract compactness criteria in normed spaces. To this end we first introduce the notion of an equinormed set using a suitable family of semi-norms on the given normed space satisfying some natural…

Functional Analysis · Mathematics 2023-06-23 Jacek Gulgowski , Piotr Kasprzak , Piotr Maćkowiak

We introduce a class of states so-called semi-SSPPT (semi super strong positive partial transposition) states in infinite-dimensional bipartite systems by the Cholesky decomposition in terms of operator matrices and show that every…

Quantum Physics · Physics 2019-02-01 Jinchuan Hou , Jinfei Chai

In the literature, the Minkowski-sum and the metric-sum of compact sets are highlighted. While the first is associative, the latter is not. But the major drawback of the Minkowski combination is that, by increasing the number of summands,…

Dynamical Systems · Mathematics 2025-04-16 Ekta Agrawal , Saurabh Verma

We show that the statement ``In every separable pseudometric space there is a maximal non-strictly \delta-separated set.'' implies the axiom of choice for countable families of sets. This gives answers to a question of Dybowski and…

Logic · Mathematics 2026-01-14 Michał Dybowski , Przemyslaw Górka , Paul Howard

This paper clarifies the picture about Dense-choice Counter Machines, which have been less studied than (discrete) Counter Machines. We revisit the definition of "Dense Counter Machines" so that it now extends (discrete) Counter Machines,…

Logic in Computer Science · Computer Science 2009-11-19 Florent Bouchy , Alain Finkel , Pierluigi San Pietro