English
Related papers

Related papers: Scattered Sentences have Few Separable Randomizati…

200 papers

Zaremba's 1971 conjecture predicts that every integer appears as the denominator of a finite continued fraction whose partial quotients are bounded by an absolute constant. We confirm this conjecture for a set of density one.

Number Theory · Mathematics 2013-07-15 Jean Bourgain , Alex Kontorovich

The Hanf number for a set $S$ of sentences in $L_{\omega_1,\omega}$ (or some other logic) is the least infinite cardinal $\kappa$ such that for all $\varphi\in S$, if $\varphi$ has models in all infinite cardinalities less than $\kappa$,…

Logic · Mathematics 2016-11-02 Sergey Goncharov , Julia Knight , Ioannis Souldatos

The main result of the present note states that it is consistent with the ZFC axioms of set theory (relying on Martin's Maximum MM axiom), that every Asplund space of density character $\omega_1$ has a renorming with the Mazur intersection…

Functional Analysis · Mathematics 2008-04-04 Miroslav Bacak , Petr Hajek

The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…

Combinatorics · Mathematics 2019-07-03 Zhen Cui , Ze-Chun Hu

We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as "the first array cell contains the array length,"…

Formal Languages and Automata Theory · Computer Science 2016-05-13 Przemysław Daca , Thomas A. Henzinger , Andrey Kupriyanov

A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…

Logic in Computer Science · Computer Science 2014-05-23 Antti Valmari

We prove versions of Khintchine's Theorem (1924) for approximations by rational numbers whose numerators lie in randomly chosen sets of integers, and we explore the extent to which the monotonicity assumption can be removed. Roughly…

Number Theory · Mathematics 2018-12-19 Felipe A. Ramírez

We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic…

Logic in Computer Science · Computer Science 2012-04-26 Dietrich Kuske

The Littlewood Conjecture in Diophantine approximation can be thought of as a problem about covering the plane by a union of hyperbolas centered at rational points. In this paper we consider the problem of translating the center of each…

Number Theory · Mathematics 2016-10-28 Alan Haynes , Henna Koivusalo

We show that adding a random real number destroys a large fragment of Martin's axiom, namely Martin's axiom for partial orders that have precalibre-$\aleph_1$, thus answering an old question of J. Roitman [9]. We also answer a question of…

Logic · Mathematics 2019-08-30 Joan Bagaria , Saharon Shelah

This work is motivated by a question at the heart of unsupervised learning approaches: Assume we are collecting a number K of (subjective) opinions about some event E from K different agents. Can we infer E from them? Prima facie this seems…

Information Theory · Computer Science 2018-05-15 Janis Nötzel , Walter Swetly

In this paper, we study recent neural generative models for text generation related to variational autoencoders. Previous works have employed various techniques to control the prior distribution of the latent codes in these models, which is…

Computation and Language · Computer Science 2018-11-01 Ondřej Cífka , Aliaksei Severyn , Enrique Alfonseca , Katja Filippova

The paper is the second of our series of notes aimed to bring back in circulation some bright ideas of early modern set theory, mainly due to Harrington and Sami, which have never been adequately presented in set theoretic publications. We…

Logic · Mathematics 2018-11-27 Vladimir Kanovei , Vassily Lyubetsky

We prove that the abundance conjecture holds on a variety $X$ with mild singularities if $X$ has many reflexive differential forms with coefficients in pluricanonical bundles, assuming the Minimal Model Program in lower dimensions. This…

Algebraic Geometry · Mathematics 2025-08-22 Vladimir Lazić , Thomas Peternell

Recently, it has been shown that every recursively enumerable language can be generated by a scattered context grammar with no more than three nonterminals. However, in that construction, the maximal number of nonterminals simultaneously…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Tomáš Masopust , Alexander Meduna

This note examines the implications of randomly selecting vectors from an infinite-dimensional Hilbert space on linear independence, assuming that for all $k$, the first $k$ vectors follow an absolutely continuous law with respect to a…

Functional Analysis · Mathematics 2025-10-07 Nizar El Idrissi , Hicham Zoubeir

Ellenberg proved that the abc conjecture would follow if this conjecture were known for sums $a+b=c$ such that $D\mid abc$ for some integer~$D$. Mochizuki proved a theorem with an opposite restriction, that the full abc conjecture would…

Number Theory · Mathematics 2020-10-20 Machiel van Frankenhuijsen

A complete theory ${\mathcal T}$ of partial order is an FLD$_1$-theory iff some (equivalently, any) of its models ${\mathbb X}$ admits a finite lexicographic decomposition ${\mathbb X} =\sum _{{\mathbb I}}{\mathbb X} _i$, where ${\mathbb…

Logic · Mathematics 2026-01-07 Miloš S. Kurilić

The remarkable results of Foster and Vohra was a starting point for a series of papers which show that any sequence of outcomes can be learned (with no prior knowledge) using some universal randomized forecasting algorithm and…

Artificial Intelligence · Computer Science 2008-06-27 Vladimir V. V'yugin

We define the scattered subsets of a group as asymptotic counterparts of scattered subspaces of a topological space, and prove that a subset $A$ of a group $G$ is scattered if and only if $A$ contains no piecewise shifted $IP$-subsets. For…

Group Theory · Mathematics 2013-12-30 T. O. Banakh , I. V. Protasov , S. V. Slobodianiuk