中文
相关论文

相关论文: On power sets

200 篇论文

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

综合数学 · 数学 2007-05-23 Marina V. Semenova , Friedrich Wehrung

A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…

逻辑 · 数学 2016-05-04 Philipp Hieronymi

For a countable ordinal epsilon we construct a Sigma^0_2 subset of the Cantor space for which one may force aleph_epsilon translations with intersections of size 2i, but such that it has no perfect set of such translations in any ccc…

逻辑 · 数学 2022-04-21 Andrzej Roslanowski , Saharon Shelah

Natural philosophy integrates scientific observation with abstract frameworks, often using a mathematical Ansatz to hypothesise about physical phenomena. Exploring the possibility of other universes, however, challenges assumptions that…

物理学史与哲学 · 物理学 2026-01-21 Jonathan M. M. Hall

In this paper we prove that every set $A\subset\mathbb{Z}$ satisfying the inequality $\sum_{x}\min(1_A*1_A(x),t)\le(2+\delta)t|A|$ for $t$ and $\delta$ in suitable ranges, then $A$ must be very close to an arithmetic progression. We use…

组合数学 · 数学 2015-06-02 Przemysław Mazur

We give a new proof for Godel's second incompleteness theorem, based on Kolmogorov complexity, Chaitin's incompleteness theorem, and an argument that resembles the surprise examination paradox. We then go the other way around and suggest…

逻辑 · 数学 2010-11-24 Shira Kritchman , Ran Raz

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

组合数学 · 数学 2015-06-02 Przemysław Mazur

Except for a limited number of cases, a complete classification of the Diophantine sets of polynomial rings and fields of rational functions seems out of reach at present. We contribute to this problem by proving that several natural sets…

数论 · 数学 2022-10-20 Natalia Garcia-Fritz , Hector Pasten , Thanases Pheidas

Suppose that $A$ is a finite, nonempty subset of a cyclic group of either infinite or prime order. We show that if the difference set $A-A$ is ``not too large'', then there is a nonzero group element with at least as many as…

数论 · 数学 2022-10-19 Vsevolod F. Lev , Ilya D. Shkredov

A classical theorem due to Mycielski states that an equivalence relation $E$ having the Baire property and meager equivalence classes must have a perfect set of pairwise inequivalent elements. We consider equivalence relations with…

逻辑 · 数学 2016-05-31 Ohad Drucker

Pilz's conjecture states that for any finite set $A=\{a_1,a_2,\dots,a_k\}$ of positive integers and positive integer $n$ in the union of the sets $\{a_1,2a_1,\dots,na_1\},\dots, \{a_k,2a_k,\dots,na_k\}$ (considered as a multiset) at least…

组合数学 · 数学 2024-09-24 János Nagy , Péter Pál Pach

It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…

逻辑 · 数学 2021-11-30 Saeed Salehi

We prove that for every partially ordered set $P$, there exists $c(P)$ such that every family $\mathcal{F}$ of subsets of $[n]$ ordered by inclusion and which contains no induced copy of $P$ satisfies $\sum_{F\in \mathcal{F}}1/{n\choose…

组合数学 · 数学 2015-06-24 Arès Méroueh

Let $K$ denote the middle third Cantor set and ${\cal A}:= \{3^n : n = 0,1,2, >... \} $. Given a real, positive function $\psi$ let $ W_{\cal A}(\psi)$ denote the set of real numbers $x$ in the unit interval for which there exist infinitely…

数论 · 数学 2007-05-23 Jason Levesley , Cem Salp , Sanju Velani

A completeness conjecture is advanced concerning the free small-colimit completion P(A) of a (possibly large) category A. The conjecture is based on the existence of a small generating-cogenerating set of objects in A. We sketch how the…

范畴论 · 数学 2009-09-29 Brian J. Day

This paper investigates how global decision problems over arithmetically represented domains acquire reflective structure through class-quantification. Arithmetization forces diagonal fixed points whose verification requires reflection…

计算复杂性 · 计算机科学 2025-11-19 Milan Rosko

We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…

经典分析与常微分方程 · 数学 2011-03-01 Allison Lewko , Mark Lewko

We formulate a property $P$ on a class of relations on the natural numbers, and formulate a general theorem on $P$, from which we get as corollaries the insolvability of Hilbert's tenth problem, G\"odel's incompleteness theorem, and…

逻辑 · 数学 2018-12-05 Tarek Sayed Ahmed

We prove a general criterion for an irrational power series $f(z)=\displaystyle\sum_{n=0}^{\infty}a_nz^n$ with coefficients in a number field $K$ to admit the unit circle as a natural boundary. As an application, let $F$ be a finite field,…

数论 · 数学 2022-06-03 Jason P. Bell , Keira Gunn , Khoa D. Nguyen , J. C. Saunders

For a set of nonnegative integers $A$, denote by $R_{A}(n)$ the number of unordered representations of the integer $n$ as the sum of two different terms from $A$. In this paper we partially describe the structure of the sets, which have…

数论 · 数学 2020-01-07 Sándor Z. Kiss , Csaba Sándor