English
Related papers

Related papers: Strongly increasing sequences

200 papers

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

Combinatorics · Mathematics 2011-04-15 Jarosław Grytczuk , Jakub Kozik , Marcin Witkowski

The classical dynamics of a particle that is driven by a rapidly oscillating potential (with frequency $\omega$) is studied. The motion is separated into a slow part and a fast part that oscillates around the slow part. The motion of the…

Chaotic Dynamics · Physics 2007-05-23 Saar Rahav , Eli Geva , Shmuel Fishman

We study the distribution of the length of longest increasing subsequences in random permutations of $n$ integers as $n$ grows large and establish an asymptotic expansion in powers of $n^{-1/3}$. Whilst the limit law was already shown by…

Probability · Mathematics 2024-03-19 Folkmar Bornemann

We define a variant of the Goodstein process based on fast-growing functions and show that it terminates, but this fact is not provable in Kripke-Platek set theory or other theories of strength the Bachmann-Howard ordinal. We moreover show…

Logic · Mathematics 2022-05-17 David Fernández-Duque , Andreas Weiermann

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

We show that it is provable in PA that there is an arithmetically definable sequence $\{\phi_{n}:n \in \omega\}$ of $\Pi^{0}_{2}$-sentences, such that - PRA+$\{\phi_{n}:n \in \omega\}$ is $\Pi^{0}_{2}$-sound and $\Pi^{0}_{1}$-complete - the…

Logic · Mathematics 2026-02-13 Rupert McCallum

We define the $\aleph_{1.5}$ chain condition. The corresponding forcing axiom is a generalization of Martin's Axiom and implies certain uniform failures of club--guessing on $\omega_1$ that don't seem to have been considered in the…

Logic · Mathematics 2015-01-26 David Asperó , Miguel Angel Mota

We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…

Logic · Mathematics 2015-08-18 Borisa Kuzeljevic , Stevo Todorcevic

Let V be the universe of sets and V_{\alpha} the sets of rank \leq\alpha. We develop some axiom schemata for set theory based on the following three assumptions: 1. V \models ZFC 2. V is large with respect to the class of ordinals 3. V is…

Logic · Mathematics 2016-09-06 Garvin Melles

Under the assumption that $\delta$ is a Woodin cardinal and $\GCH$ holds, I show that if $F$ is any class function from the regular cardinals to the cardinals such that (1) $\kappa<\cf(F(\kappa))$, (2) $\kappa<\lambda$ implies…

Logic · Mathematics 2012-07-31 Brent Cody

For a finite set $A$ of size $n$, an ordering is an injection from $\{1,2,\ldots,n\}$ to $A$. We present results concerning the asymptotic properties of the length $L_n$ of the longest arithmetic subsequence in a random ordering of an…

Combinatorics · Mathematics 2021-09-30 Marcel K. Goh , Rosie Y. Zhao

We introduce a new model of preferential attachment with fitness, and establish a time reversed duality between the model and a system of branching-coalescing particles. Using this duality, we give a clear and concise explanation for the…

Probability · Mathematics 2020-04-24 Nic Freeman , Jonathan Jordan

Let $X_1, X_2, ..., X_n, ... $ be a sequence of iid random variables with values in a finite alphabet $\{1,...,m\}$. Let $LI_n$ be the length of the longest increasing subsequence of $X_1, X_2, ..., X_n.$ We express the limiting…

Probability · Mathematics 2007-05-23 Christian houdré , Trevis J. Litherland

In this letter a generic counterexample to the strong cosmic censor conjecture is exhibited. More precisely---taking into account that the conjecture lacks any precise formulation yet---first we make sense of what one would mean by a…

General Relativity and Quantum Cosmology · Physics 2015-10-07 Gabor Etesi

Consider the property $(\aleph_{\omega + 1},\aleph_{\omega + 2},\ldots) \twoheadrightarrow (\aleph_1,\aleph_2,\ldots)$. Here we will show that this property with the addition of the General Continuum Hypothesis implies projective…

Logic · Mathematics 2021-12-16 Dominik Adolf

We present natural constructions of trees and gaps using a quite general construction scheme. In particular, we solve a natural problem about $(\omega_1, \omega_1)$-gaps. As it is well known $(\omega_1, \omega_1)$-gaps can sometimes be…

Logic · Mathematics 2016-08-16 Fulgencio Lopez , Stevo Todorcevic

We define extender sequences, generelizing measure sequences from Radin Forcing. Using the extender sequences we combine Gitik-Magidor forcing for adding many Prikry sequences with Radin forcing. This forcing satisfies Prikry like…

Logic · Mathematics 2007-05-23 Carmi Merimovich

We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…

Logic · Mathematics 2023-06-13 Tamás Csernák , Lajos Soukup

We consider weighted sums of independent random variables regulated by an increment sequence. We provide operative conditions that ensure strong law of large numbers for such sums to hold in both the centered and non-centered case. The…

Probability · Mathematics 2021-03-11 Luca Avena , Conrado da Costa

We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…

Logic in Computer Science · Computer Science 2025-04-08 Vera Koponen , Yasmin Tousinejad