English
Related papers

Related papers: Provably $\Delta^0_2$ and weakly descending chains

200 papers

For each subset of Baire space, we define, in away similar to a common proof of the Cantor-Bendixson Theorem, a sequence of decreasing subsets S_alpha of N^N, indexed by ordinals. We use this to obtain two new characterizations of the…

Logic · Mathematics 2012-01-25 Samuel Alexander

We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of these sets for the standard notions of finite learning,…

Logic · Mathematics 2013-03-01 Achilles Beros

A set of integers $S \subset \mathbb{N}$ is an $\alpha$-strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on $\alpha$, more specifically if $| (x+w) - (y+z) | \geq \max \{…

Combinatorics · Mathematics 2019-12-09 David Fabian , Juanjo Rué , Christoph Spiegel

We revisit Kapranov and Voevodsky's idea of spaces modelled on combinatorial pasting diagrams, now as a framework for higher-dimensional rewriting and the basis of a model of weak omega-categories. In the first part, we elaborate on…

Category Theory · Mathematics 2020-07-30 Amar Hadzihasanovic

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

Category Theory · Mathematics 2025-12-23 Clémence Chanavat , Amar Hadzihasanovic

We call a space $X$ {\it weakly linearly Lindel\"of} if for any family $\mathcal{U}$ of non-empty open subsets of $X$ of regular uncountable cardinality $\kappa$, there exists a point $x\in X$ such that every neighborhood of $x$ meets…

General Topology · Mathematics 2016-10-17 I. Juhász , V. V. Tkachuk , R. G. Wilson

Consider a discrete-time one-dimensional supercritical branching random walk. We study the probability that there exists an infinite ray in the branching random walk that always lies above the line of slope $\gamma-\epsilon$, where $\gamma$…

Probability · Mathematics 2010-02-16 Nina Gantert , Yueyun Hu , Zhan Shi

In the present paper we prove a weak form of sandwich classification for the overgroups of the subsystem subgroup $E(\Delta,R)$ of the Chevalley group $G(\Phi,R)$ where $\Phi$ is a simply laced root sysetem and $\Delta$ is its sufficiently…

Group Theory · Mathematics 2023-05-30 Pavel Gvozdevsky

Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…

Combinatorics · Mathematics 2008-05-15 Martin Nehez , Daniel Olejar , Michal Demetrian

In this paper, we propose a mild condition, named Condition $(**)$, for collections of sequence of integers and show that for any measure preserving system the Pinsker $\sigma$-algebra is a characteristic $\sigma$-algebra for the averages…

Dynamical Systems · Mathematics 2022-01-19 Jian Li , Kairan Liu

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

Combinatorics · Mathematics 2026-02-24 Simone Costa , Stefano Della Fiore

Let $G$ be a $t$-tough graph of order $n$ and minimum degree $\delta$ with $t>1$. It is proved that if $\delta\ge(n-2)/3$ then each longest cycle in $G$ is a dominating cycle.

Combinatorics · Mathematics 2012-01-10 Zh. G. Nikoghosyan

In this paper, we introduce a hierarchy dividing the set $\{\sigma \in \Pi^1_2 : \Pi^1_1$-$\mathsf{CA}_0 \vdash \sigma\}$. Then, we give some characterizations of this set using weaker variants of some principles equivalent to…

Logic · Mathematics 2024-11-25 Yudai Suzuki , Keita Yokoyama

The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…

Logic · Mathematics 2014-10-15 Ian Herbert

The P\'osa-Seymour conjecture asserts that every graph on $n$ vertices with minimum degree at least $(1 - 1/(r+1))n$ contains the $r^{th}$ power of a Hamilton cycle. Koml\'os, S\'ark\"ozy and Szemer\'edi famously proved the conjecture for…

Combinatorics · Mathematics 2022-08-29 Domagoj Bradač

We prove a Law of Iterated Logarithm for random walks on a family of diagonal products constructed by Brieussel and Zheng (2021). This provides a wide variety of new examples of Law of Iterated Logarithm behaviours for random walks on…

Probability · Mathematics 2022-05-12 Gideon Amir , Guy Blachar

We give a level-by-level analysis of the Weak Vop\v{e}nka Principle for definable classes of relational structures (WVP), in accordance with the complexity of their definition, and we determine the large-cardinal strength of each level.…

Logic · Mathematics 2020-12-22 Joan Bagaria , Trevor Wilson

We recall some classical results relating normality and some natural weakenings of normality in $\Psi$-spaces over almost disjoint families of branches in the Cantor tree to special sets of reals like $Q$-sets, $\lambda$-sets and…

General Topology · Mathematics 2021-12-21 Vinicius Rodrigues , Victor dos Santos Ronchim , Paul Szeptycki

We determine the sharp asymptotic scale of the probability that two uniformly random permutations are comparable in weak Bruhat order, showing that $\mathbb{P}(\sigma_1 \preceq_W \sigma_2)=\exp\Bigl(\bigl(-\tfrac12+o(1)\bigr)\,n\log…

We introduce the family of axioms, denoted $\operatorname{Slice}_\kappa$, that claim the existence of strictly increasing decompositions of the form $$2^{\delta}=\bigcup_{\alpha<\kappa} 2^{\delta}\cap M_\alpha,$$ where $\delta<\kappa$, and…

Logic · Mathematics 2023-09-29 Ziemowit Kostana , Saharon Shelah