English
Related papers

Related papers: Perfect sets of random reals

200 papers

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

Logic · Mathematics 2014-01-03 Jeremy Avigad , Edward Dean , Jason Rute

We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on…

Logic · Mathematics 2009-09-25 Jörg Brendle

Using the method of decisive creatures (math.LO/0601083) we show the consistency of "there is no increasing omega_2 --chain of Borel sets and non(N)=non(M)= omega_2=2^omega". Hence, consistently, there are no monotone hulls for the ideal M…

Logic · Mathematics 2014-07-18 Andrzej Roslanowski , Saharon Shelah

We give in this paper additional answers to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:"A Decade of Concurrency", Springer LNCS 803 (1994), 583-621], proving new topological properties of omega…

Logic in Computer Science · Computer Science 2011-01-20 Olivier Finkel

We show the finiteness of perfect powers in orbits of polynomial dynamical systems over an algebraic number field. We also obtain similar results for perfect powers represented by ratios of consecutive elements in orbits. Assuming the…

Number Theory · Mathematics 2021-09-24 Alina Ostafe , Lukas Pottmeyer , Igor E. Shparlinski

Schinzel and W\'ojcik have shown that if $\alpha, \beta$ are rational numbers not $0$ or $\pm 1$, then $\mathrm{ord}_p(\alpha)=\mathrm{ord}_p(\beta)$ for infinitely many primes $p$, where $\mathrm{ord}_p(\cdot)$ denotes the order in…

Number Theory · Mathematics 2021-02-02 Matthew Just , Paul Pollack

We study the structure of a minimum dominating set of $C_{2n+1}^n$, the Cartesian product of $n$ copies of the cycle of size $2n+1$, where $2n+1$ is a prime.

Combinatorics · Mathematics 2009-03-14 Hamed Hatami , Pooya Hatami

We investigate the question of whether $\mathbb Q$ carries an ultrafilter generated by perfect sets (such ultrafilters were called gruff ultrafilters by van Douwen). We prove that one can (consistently) obtain an affirmative answer to this…

Logic · Mathematics 2017-10-23 David Fernández-Bretón , Michael Hrušák

We deal with some pcf investigations mostly motivated by abelian group theory problems and deal their applications to test problems (we expect reasonably wide applications). We prove almost always the existence of aleph_omega-free abelian…

Logic · Mathematics 2017-08-08 Saharon Shelah

Let $k$ be a number field and $B$ be a central simple algebra over $k$ of dimension $p^2$ where $p$ is prime. In the case that $p=2$ we assume that $B$ is not totally definite. In this paper we study sets of pairwise nonisomorphic maximal…

Number Theory · Mathematics 2014-09-04 Benjamin Linowitz

Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…

Combinatorics · Mathematics 2017-01-13 Irene Heinrich , Peter Tittmann

Consider the random process in which the edges of a graph $G$ are added one by one in a random order. A classical result states that if $G$ is the complete graph $K_{2n}$ or the complete bipartite graph $K_{n,n}$, then typically a perfect…

Combinatorics · Mathematics 2020-11-03 Roman Glebov , Zur Luria , Michael Simkin

We prove that CH implies the existence of a Cohen-indestructible mad family such that the Mathias forcing associated to its filter adds dominating reals, while $\mathfrak b=\mathfrak c$ is consistent with the negation of this statement as…

Logic · Mathematics 2019-11-04 Leandro Aurichi , Lyubomyr Zdomskyy

Write $\mathrm{ord}_p(\cdot)$ for the multiplicative order in $\mathbb{F}_p^{\times}$. Recently, Matthew Just and the second author investigated the problem of classifying pairs $\alpha, \beta \in \mathbb{Q}^{\times}\setminus\{\pm 1\}$ for…

Number Theory · Mathematics 2021-09-01 Sergei Konyagin , Paul Pollack

We consider the reverse math strength of the statement $\mathsf{C\text-DM}$:"Every completely determined Borel set is measurable." Over $\mathsf{WWKL}_0$, we obtain the following results analogous to the previously studied category case.…

Logic · Mathematics 2021-05-20 Linda Westrick

We investigate in detail relationships between the set ${\mathfrak B}^\infty$ of all infinite ``biconvex'' sets in the positive root system $\Delta_+$ of an arbitrary untwisted affine Lie algebra ${\mathfrak g}$ and the set ${\mathcal…

Quantum Algebra · Mathematics 2007-05-23 Ken Ito

We show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we…

Logic · Mathematics 2022-08-02 Jonathan Schilhan

We characterize the completely determined Borel subsets of HYP as exactly the omega_1^{ck} subsets of HYP. As a result, HYP believes there is a Borel well-ordering of the reals, that the Borel Dual Ramsey Theorem fails, and that every Borel…

Logic · Mathematics 2022-03-03 Henry Towsner , Rose Weisshaar , Linda Westrick

In J. Symbolic Logic,51(4): 957-968, 1986, Pawlikowski proved that, if $r$ is a random real over $\mathbf{N}$, and $c$ is Cohen real over $\mathbf{N}[r]$, then (a) in $\mathbf{N}[r][c]$ there is a Cohen real over $\mathbf{N}[c]$, and (b)…

Logic · Mathematics 2021-09-03 Miguel A. Cardona

Let R be a ring (not necessarily with 1) and G be a finite group of automorphisms of R. The set B(R, G) of primes p such that p | |G| and R is not p-torsion free, is called the set of bad primes. When the ring is |G|-torsion free, i.e.,…

Rings and Algebras · Mathematics 2017-04-25 Volodymyr Bavula , Vyacheslav Futorny