English
Related papers

Related papers: Perfect sets of random reals

200 papers

Posner and Robinson (1981) proved that if $S \subseteq \omega$ is non-computable, then there exists a $G \subseteq \omega$ such that $S \oplus G \geq_T G'$. Shore and Slaman (1999) extended this result to all $n \in \omega$, by showing that…

Logic · Mathematics 2012-09-17 Adam R. Day , Damir D. Dzhafarov

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…

Commutative Algebra · Mathematics 2020-06-09 Alberto Dennunzio , Enrico Formenti , Darij Grinberg , Luciano Margara

We investigate the relationship between the sizes of the sum and difference sets attached to a subset of {0,1,...,N}, chosen randomly according to a binomial model with parameter p(N), with N^{-1} = o(p(N)). We show that the random subset…

Number Theory · Mathematics 2010-09-15 Peter Hegarty , Steven J. Miller

A monomial algebra B is defined as a quotient of a polynomial ring by a monomial ideal, which is an ideal generated by a finite set of monomials. In this paper, we determine the automorphism group of a monomial algebra B, under the…

Algebraic Geometry · Mathematics 2026-04-28 Roberto Díaz , Alvaro Liendo , Gonzalo Manzano-Flores , Andriy Regeta

Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in…

Commutative Algebra · Mathematics 2012-10-05 Zike Deng

The $\Omega$ numbers-the halting probabilities of universal prefix-free machines-are known to be exactly the Martin-L{\"o}f random left-c.e. reals. We show that one cannot uniformly produce, from a Martin-L{\"o}f random left-c.e. real…

Logic in Computer Science · Computer Science 2023-06-22 Laurent Bienvenu , Barbara Csima , Matthew Harrison-Trainor

This work introduces the first in-depth study of h-free and h-full elements in abelian monoids, providing a unified approach for understanding their role in various mathematical structures. Let m be an element of an abelian monoid, with…

Number Theory · Mathematics 2025-06-03 Sourabhashis Das , Wentang Kuo , Yu-Ru Liu

In problems such as variable selection and graph estimation, models are characterized by Boolean logical structure such as presence or absence of a variable or an edge. Consequently, false positive error or false negative error can be…

Methodology · Statistics 2025-04-15 Armeen Taeb , Peter Bühlmann , Venkat Chandrasekaran

Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph…

Commutative Algebra · Mathematics 2007-09-06 Seth Sullivant

We consider the following problem for various infinite time machines. If a real is computable relative to large set of oracles such as a set of full measure or just of positive measure, a comeager set, or a nonmeager Borel set, is it…

Logic · Mathematics 2017-10-18 Merlin Carl , Philipp Schlicht

In this paper we present a simple approach to big Ramsey combinatorics of the Cantor set $2^\omega$. Using Infinite Dual Ramsey Theorem of Carlson and Simpson, we show that $2^\omega$, viewed as a topological space, has finite big Ramsey…

Logic · Mathematics 2026-02-24 Dragan Mašulović

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim

In this paper we prove that if there is a Borel-cover gamma-set of cardinality the continuum, then there is one which is not hereditary. A set of reals X is a Borel-cover gamma-set iff for every countable family of Borel sets which is an…

Logic · Mathematics 2007-05-23 Arnold W. Miller

In this work we discuss two urn models with general weight sequences $(A,B)$ associated to them, $A=(\alpha_n)_{n\in\N}$ and $B=(\beta_m)_{m\in\N}$, generalizing two well known P\'olya-Eggenberger urn models, namely the so-called sampling…

Combinatorics · Mathematics 2010-05-11 Markus Kuba

We study maximal orthogonal families of Borel probability measures on $2^\omega$ (abbreviated m.o. families) and show that there are generic extensions of the constructible universe $L$ in which each of the following holds: (1) There is a…

Logic · Mathematics 2011-06-22 Vera Fischer , Sy-David Friedman , Asger Tornquist

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…

Rings and Algebras · Mathematics 2021-05-10 Daizhan Cheng , Zhengping Ji

Fix a prime number $p$. Inspired by the notion of $F$-pure or $F$-split singularities, we study the condition that a Noetherian ring with $p$ in its Jacobson radical is pure inside some perfectoid (classical) ring, a condition we call…

Algebraic Geometry · Mathematics 2024-09-27 Bhargav Bhatt , Linquan Ma , Zsolt Patakfalvi , Karl Schwede , Kevin Tucker , Joe Waldron , Jakub Witaszek

In this paper we consider a notion of universal sets for ideals. We show that there exist universal sets of minimal Borel complexity for classic ideals like null subsets of $2^\omega$ and meager subsets of any Polish space, and demonstrate…

General Topology · Mathematics 2019-07-22 Aleksander Cieślak , Marcin Michalski

We show that, for each real number $\alpha > 0$ and odd integer $k\ge 5$ there is an integer $c$ such that, if $M$ is a simple binary matroid with $|M| \ge \alpha 2^{r(M)}$ and with no $k$-element circuit, then $M$ has critical number at…

Combinatorics · Mathematics 2014-03-10 Jim Geelen , Peter Nelson

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

Logic · Mathematics 2017-09-26 Milos Kurilic