betaFeedback

WorksMathematics

Erdős 196: A permutation of the natural numbers with no monotone four-term arithmetic progression

Abstract

We construct a permutation of the natural numbers containing no increasing or decreasing four-term arithmetic progression as a subsequence. This gives a negative answer to Erdős problem 196. The construction extends finite prefixes while preserving closure and consistency of binary preferences. To extend a prefix, we order a new finite block by an adapted binary order and impose saturation at the nodes where the old prefix branches. Finiteness follows from the weight w(n)=2ρ(n)nw(n)=2^{\rho(n)}n, where ρ\rho is a finite binary residue rank. The extension can include any prescribed finite set. Iteration gives a bijection of order type ω\omega on the natural numbers. The finite extension theorem, the resulting bijection, and the exact negative answer are formalized in Lean 4.

Introduction

Write N0={0,1,2,…}\mathbb{N}_0 = \{0,1,2,\ldots\}. A permutation of N0\mathbb{N}_0 means a bijection p:N0→N0p:\mathbb{N}_0 \to\mathbb{N}_0, viewed as the sequence p(0),p(1),…p(0),p(1),\ldots A monotone four-term arithmetic progression in this sequence consists of indices i<j<k<ℓi < j < k < \ell and integers a,ha,h, with h≠0h \ne0, such that

(p(i),p(j),p(k),p(ℓ))=(a,a+h,a+2h,a+3h).(p(i),p(j),p(k),p(\ell)) = (a,a+h,a+2h,a+3h).

Both signs of hh are allowed. Equivalently, the four values satisfy

p(i)+p(k)=2p(j),p(j)+p(ℓ)=2p(k).(1)p(i)+p(k)=2p(j), \qquad p(j)+p(\ell)=2p(k). \tag*{(1)}

Their distinctness follows from injectivity. These equalities also avoid any ambiguity about subtraction in the natural numbers. Davis, Entringer, Graham, and Simmons [3] proved that every permutation of the positive integers contains a monotone three-term arithmetic progression and constructed a permutation containing no monotone five-term progression. The remaining four-term question is recorded as Erdős problem 196 in the Formal Conjectures library [5] and on Conjectures.io [2]. We prove the following.

Theorem 1.1. There exists a bijection p:N0→N0p:\mathbb{N}_0 \to\mathbb{N}_0 for which no indices i<j<k<ℓi < j < k < \ell satisfy both equalities in (1).

Adding one to each value and shifting the starting index gives the same conclusion for permutations of the positive integers.

Binary residue orders provide an elementary way to order every finite set of integers without a monotone three-term progression. Related orders on infinite sets are classical; see Ardal, Brown, and Jungić [1]. Such an order need not enumerate its underlying set in a sequence indexed by N0\mathbb{N}_0: an element can have infinitely many predecessors. Our construction instead preserves an entire finite prefix at each step.

There are also strong density results for subsets admitting permutations that avoid monotone progressions. Geneson [4] obtains density supremum results for lengths at least four and explicitly distinguishes them from an avoiding permutation of all the natural numbers. Theorem 1.1 addresses the full underlying set directly.

The main point is a finite extension theorem. A prefix records both the fourth terms that must already have appeared and the binary preferences required by progressions whose last two terms are still absent. We impose saturation at the finitely many nodes where the old prefix occupies both children. After the new block is appended, the future requirements keep their orientation at those nodes and reverse it at the other nodes. This update is what makes repeated extension possible. A weighted finite set supplies the needed saturation without a limiting argument.

Sections 2 and 3 establish the order and finiteness lemmas. Sections 4 and 5 prove the extension theorem. Section 6 constructs the permutation, and Section 7 describes the accompanying complete formalization.

Binary residue orders

A binary residue node is a pair

η=(k,r),k∈N0,0≤r<2k.\eta=(k,r),\qquad k\in\mathbb{N}_0,\qquad0\le r<2^k.

It represents the class Cη=r+2kN0C_\eta=r+2^k\mathbb{N}_0. For x∈Cηx\in C_\eta, let

bit⁡η(x)=x−r2k(mod2)∈{0,1}.\operatorname{bit}_\eta(x)=\frac{x-r}{2^k}\pmod2\in\{0,1\}.

The two children of η\eta are the subsets with the two possible values of bit⁡η\operatorname{bit}_\eta. A preference assignment ee chooses a value e(η)∈{0,1}e(\eta)\in\{0,1\} at every node; its child is called preferred.

For distinct a,b∈N0a,b\in\mathbb{N}_0, let

η(a,b)=(k,r),k=ν2(∣b−a∣),r=amod⁡2k.(2)\eta(a,b)=(k,r),\qquad k=\nu_2(\lvert b-a\rvert),\qquad r=a\mathbin{\operatorname{mod}}2^k. \tag*{(2)}

This is their first differing binary node when digits are read from least to most significant. Define

a≺eb⟺bit⁡η(a,b)(a)=e(η(a,b)).(3)a\prec_e b\quad\Longleftrightarrow\quad\operatorname{bit}_{\eta(a,b)}(a)=e(\eta(a,b)). \tag*{(3)}

Lemma 2.1. The relation ≺e\prec_e is a strict total order. For every K∈N0K\in\mathbb{N}_0 there is a rank function

ρe,K:N0⟶{0,1,…,2K−1},\rho_{e,K}:\mathbb{N}_0\longrightarrow\{0,1,\ldots,2^K-1\},

depending only on the residue modulo 2K2^K, such that if the node η(a,b)\eta(a,b) has depth less than KK, then

a≺eb⟺ρe,K(a)<ρe,K(b).a\prec_e b\quad\Longleftrightarrow\quad\rho_{e,K}(a)<\rho_{e,K}(b).

Proof. List the leaves of the binary residue tree of depth KK by recursively listing the preferred child before the other child. Give the leaves their ranks, starting with zero. The comparison of two distinct leaves is decided at their first differing node and is exactly (2.2). This constructs ρe,K\rho_{e,K}. For any finite set of distinct integers, choose KK large enough that their residues modulo 2K2^K are distinct. The relation ≺e\prec_e on that set agrees with the finite leaf order. In particular, every pair is comparable and every triple satisfies transitivity. □

The arithmetic fact used throughout the proof is the alternation of the two children along a progression. For four values, the progression equations are

a+c=2b,b+d=2c.(4)a+c=2b,\qquad b+d=2c. \tag*{(4)}

Lemma 2.2. Suppose a,b,c∈N0a,b,c\in\mathbb{N}_0, a≠ba\ne b, and a+c=2ba+c=2b. Then η(a,b)=η(b,c)=:η\eta(a,b)=\eta(b,c)=:\eta, all three values lie in CηC_\eta, and bit⁡η(a)=bit⁡η(c)≠bit⁡η(b)\operatorname{bit}_\eta(a)=\operatorname{bit}_\eta(c)\ne\operatorname{bit}_\eta(b). If d∈N0d\in\mathbb{N}_0 also satisfies b+d=2cb+d=2c, then η(c,d)=η\eta(c,d)=\eta, all four values lie in CηC_\eta, and

bit⁡η(a)=bit⁡η(c)≠bit⁡η(b)=bit⁡η(d).(5)\operatorname{bit}_\eta(a)=\operatorname{bit}_\eta(c)\ne\operatorname{bit}_\eta(b)=\operatorname{bit}_\eta(d). \tag*{(5)}

Moreover, c≤2bc\le2b, and d≤2cd\le2c whenever the fourth term is present.

Proof. In Z\mathbb{Z}, put h=b−ah=b-a. The three values are aa, a+ha+h, a+2ha+2h, with d=a+3hd=a+3h when the fourth term is present. If k=ν2(∣h∣)k=\nu_2(|h|), the values have the same residue modulo 2k2^k, and their normalized adjacent differences are odd. Their kkth digits therefore alternate. Adjacent differences equal hh, so their first differing nodes agree. Finally, c=2b−a≤2bc=2b-a\le2b, and d=2c−b≤2cd=2c-b\le2c when present, because a,b≥0a,b\ge0.

Lemma 2.3. There are no distinct a,b,c∈N0a,b,c\in\mathbb{N}_0 with a≺eb≺eca\prec_e b\prec_e c and a+c=2ba+c=2b.

Proof. At the first differing node of aa and bb, the values a,ca,c have the same digit and bb has the other digit, by the three-term part of Lemma 2.2. If the digit of bb is preferred, then bb precedes both endpoints; otherwise it follows both. In neither case is bb between them.

Finite saturation by a weight

We first give a finiteness lemma that applies to any natural-valued rank.

Lemma 3.1. Let ρ:N0→N0\rho:\mathbb{N}_0\to\mathbb{N}_0 and let F⊆N0F\subseteq\mathbb{N}_0 be finite. There is a finite set A⊇FA\supseteq F such that

ρ(x)<ρ(y),x≤2y,y∈A⟹x∈A.(6)\rho(x)<\rho(y),\qquad x\le2y,\qquad y\in A\quad\Longrightarrow\quad x\in A. \tag*{(6)}

Proof. Define

w(n)=2ρ(n)n,M=max⁡({w(n):n∈F}∪{0}),A={n∈N0:w(n)≤M}.w(n)=2^{\rho(n)}n,\qquad M=\max\bigl(\{w(n):n\in F\}\cup\{0\}\bigr),\qquad A=\{n\in\mathbb{N}_0:w(n)\le M\}.

Since n≤w(n)n\le w(n), the set AA is contained in {0,…,M}\{0,\ldots,M\} and is finite. It contains FF by the choice of MM. If ρ(x)<ρ(y)\rho(x)<\rho(y) and x≤2yx\le2y, then ρ(x)+1≤ρ(y)\rho(x)+1\le\rho(y), so

w(x)=2ρ(x)x≤2ρ(x)+1y≤2ρ(y)y=w(y).(7)w(x)=2^{\rho(x)}x\le2^{\rho(x)+1}y\le2^{\rho(y)}y=w(y). \tag*{(7)}

Thus y∈Ay\in A implies x∈Ax\in A.

Definition 3.2. Let RR be a finite set of binary residue nodes and let ee be a preference assignment. A set A⊆N0A\subseteq\mathbb{N}_0 is saturated at (R,e)(R,e) if, for every η∈R\eta\in R and x,y∈Cηx,y\in C_\eta,

\begin{aligned} &\operatorname{bit}_{\eta}(x)=e(\eta),\qquad\operatorname{bit}_{\eta}(y)\ne e(\eta),\\ &x\le2y,\qquad y\in A \end{aligned} \quad\Longrightarrow\quad x\in A. \tag*{(8)}\end{aligned}

Thus a nonpreferred value brings into AA every preferred value at the same specified node that is at most twice as large. The inequality concerns the values x,yx,y themselves.

Corollary 3.3. For every finite RR, preference assignment ee, and finite seed set FF, there is a finite superset of FF saturated at (R,e)(R,e).

Proof. Choose KK greater than the depth of every node in RR; take K=0K=0 if RR is empty. Use Lemma 3.1 with the rank ρe,K\rho_{e,K} from Lemma 2.1. If x,yx,y satisfy the hypotheses of Eq. (8), they first differ at η∈R\eta\in R, and the digit of xx is preferred. Hence ρe,K(x)<ρe,K(y)\rho_{e,K}(x)<\rho_{e,K}(y), and Eq. (3.1) gives x∈Ax\in A.

Only finitely many nodes are used in this argument. The conclusion does not require saturation at every node of the infinite binary tree.

Admissible finite prefixes

Let PP be a finite list of distinct members of N0\mathbb{N}_0, let S=supp⁡(P)S=\operatorname{supp}(P) be its set of entries, and write a<Pba<_{P}b if a,b∈Sa,b\in S and aa occurs before bb in PP. The notation <P<_{P} always refers to positions, whereas << and ≤\le without a subscript refer to numerical order.

Definition 4.1. The list PP is admissible if it satisfies both conditions below.

(1) Closure. For all a,b,c,d∈N0a,b,c,d\in\mathbb{N}_0 satisfying (4),

a<Pb<Pc⟹d<Pc.(9)a<_{P}b<_{P}c\quad\Longrightarrow\quad d<_{P}c. \tag*{(9)}

In particular, the conclusion requires d∈Sd\in S.

(2) Compatibility. There exists a preference assignment e0e_0 such that, whenever a<Pba <_P b and c,d∈N0∖Sc,d \in\mathbb{N}_0 \setminus S satisfy (2.3),

e0(η(a,b))=bit⁡η(a,b)(b).(10)e_0(\eta(a,b)) = \operatorname{bit}_{\eta(a,b)}(b). \tag*{(10)}

The compatibility condition says that all pairs imposing a requirement at a given node impose the same requirement. Indeed, for a progression beginning with a<Pba <_P b and with c,dc,d both absent, any extension avoiding that progression must put dd before cc. In a binary order, this is achieved by preferring the digit of bb, which is also the digit of dd.

The empty list is admissible. Also, every admissible list avoids monotone four-term progressions: a chain a<Pb<Pc<Pda <_P b <_P c <_P d satisfying (2.3) would contradict (4.1).

Let R(P)R(P) be the set of nodes at which PP branches, meaning that each child contains an element of SS. Equivalently,

R(P)={η(a,b):a,b∈S, a≠b}.(11)R(P) = \{\eta(a,b) : a,b \in S,\ a \ne b\}. \tag*{(11)}

The set R(P)R(P) is finite. Every compatibility requirement for PP occurs at one of these nodes. Fix a compatible assignment e0e_0. We use the following adapted assignment ee:

  1. If η∈R(P)\eta\in R(P), set e(η)=e0(η)e(\eta) = e_0(\eta).

  2. If η∉R(P)\eta\notin R(P) and CηC_\eta meets SS, prefer the unique child containing the old entries in that node.

  3. If CηC_\eta does not meet SS, set e(η)=0e(\eta) = 0.

This definition is consistent. It retains compatibility because it changes no preference at a node in R(P)R(P). The list PP itself need not be ordered by ≺e\prec_e.

The finite extension theorem

Theorem 5.1. Let PP be admissible and let F⊆N0F \subseteq\mathbb{N}_0 be finite. There is an admissible finite list QQ such that PP is an initial segment of QQ and F⊆supp⁡(Q)F \subseteq\operatorname{supp}(Q).

Proof. Put S=supp⁡(P)S = \operatorname{supp}(P) and choose the adapted assignment ee from Section 4. By Corollary 3.3, choose a finite set A⊇S∪FA \supseteq S \cup F saturated at (R(P),e)(R(P),e). Let BB be the list of A∖SA \setminus S in increasing ≺e\prec_e order, and define

Q=P∥B.(12)Q = P \mathbin{\|} B. \tag*{(12)}

Then QQ has distinct entries, has support AA, extends PP, and contains FF. It remains to prove closure and compatibility. Call the entries of PP old and those of BB new. Every old entry precedes every new entry.

Closure. Suppose a<Qb<Qca <_Q b <_Q c and a,b,c,d∈N0a,b,c,d \in\mathbb{N}_0 satisfy (2.3). We show d<Qcd <_Q c. If cc is old, then a,ba,b are old and closure of PP gives the conclusion. If a,b,ca,b,c are all new, their order agrees with ≺e\prec_e, contrary to Lemma 2.3. Thus we may assume that cc is new and aa is old. If dd is old, then it already precedes cc, so we may also assume d∉Sd \notin S. There are two cases, according to the status of bb.

Case 1: a,ba,b are old and cc is new. Let η=η(a,b)\eta= \eta(a,b). This is a node in R(P)R(P). Since c,d∉Sc,d \notin S, compatibility of PP and the choice of ee give

e(η)=bit⁡η(b)=bit⁡η(d).e(\eta) = \operatorname{bit}_{\eta}(b) = \operatorname{bit}_{\eta}(d).

By Lemma 2.2, the digit of cc is the other digit and d≤2cd \le2c. As c∈Ac \in A, saturation at η\eta gives d∈Ad \in A. Our assumption d∉Sd \notin S now makes dd new. Its preferred digit puts it before cc in ≺e\prec_e, hence before cc in BB and in QQ.

Case 2: aa is old and b,cb,c are new. The node η=η(a,b)=η(b,c)\eta= \eta(a,b) = \eta(b,c) is the same by Lemma 2.2. Because b≺ecb \prec_e c, the digit of bb is preferred and the digits of a,ca,c are not. This forces η∈R(P)\eta\in R(P). Otherwise the adaptation rule at the nonbranching node containing the old value aa would prefer the digit of aa, a contradiction. The digit of dd equals that of bb, and d≤2cd \le2c. Saturation at this old branching node therefore gives d∈Ad \in A. As in Case 1, dd is new and precedes cc in BB. All cases give d<Qcd <_Q c, proving closure.

::: Compatibility. Define a new assignment on every node by

e+(η)={e(η),η∈R(P),1−e(η),η∉R(P).(13)e^{+}(\eta)= \begin{cases} e(\eta), & \eta\in R(P),\\ 1-e(\eta), & \eta\notin R(P). \end{cases} \tag*{(13)}

We show that e+e^{+} is compatible with QQ. Take an ordered pair a<Qba <_{Q} b and values c,d∈N0∖Ac,d\in\mathbb{N}_{0}\setminus A satisfying (2.3), and put η=η(a,b)\eta=\eta(a,b). We must prove

e+(η)=bit⁡η(b).(14)e^{+}(\eta)=\operatorname{bit}_{\eta}(b). \tag*{(14)}

First suppose η∈R(P)\eta\in R(P). If bb is old, then aa is old as well. Since c,dc,d are outside A⊇SA\supseteq S, compatibility of PP gives e(η)=bit⁡η(b)e(\eta)=\operatorname{bit}_{\eta}(b), as required. If bb is new, suppose for a contradiction that bit⁡η(b)≠e(η)\operatorname{bit}_{\eta}(b)\ne e(\eta). Then cc has the preferred digit by Lemma 2.2, and c≤2bc\le2b. The value bb belongs to AA, so saturation at η\eta puts cc in AA, contradicting its choice. Thus bit⁡η(b)=e(η)\operatorname{bit}_{\eta}(b)=e(\eta) in this case also. This establishes (5.3) at every old branching node.

Now suppose η∉R(P)\eta\notin R(P). The values a,ba,b cannot both be old: their occurrence in opposite children would make η\eta a node of R(P)R(P). Since a<Qba <_{Q} b, it follows that bb is new. If aa is old, the adapted assignment prefers the child containing aa. Therefore the digit of bb is 1−e(η)1-e(\eta). If aa is new, both values occur in the sorted block BB, so a≺eba\prec_{e} b. Again the digit of aa is preferred and that of bb is 1−e(η)1-e(\eta). In both cases (5.2) gives (5.3). Hence e+e^{+} satisfies every compatibility requirement of QQ. Together with closure and distinctness, this proves that QQ is admissible. □

The inequalities used in the proof are precisely d≤2cd\le2c in closure and c≤2bc\le2b in compatibility. They follow from nonnegativity of the first two terms, as recorded in Lemma 2.2, and apply to progressions with either sign of the common difference.

Construction of the infinite permutation

Proof of Theorem 1.1. Start with the empty list P0P_{0}. Given the admissible list PnP_{n}, apply Theorem 5.1 with F={n}F=\{n\} to choose Pn+1P_{n+1}. Thus

Pn is an initial segment of Pn+1,n∈supp⁡(Pn+1).(15)P_{n}\text{ is an initial segment of }P_{n+1},\qquad n\in\operatorname{supp}(P_{n+1}). \tag*{(15)}

Every PnP_{n} is finite and admissible. Induction shows that it contains each integer less than nn, so

∣Pn∣≥n.(16)|P_{n}|\ge n. \tag*{(16)}

Here ∣Pn∣|P_{n}| denotes the length of the list. The lengths need not increase strictly at every step; the lower bound (6.2) is sufficient. Index list positions from zero and define

p(i)=the entry at position i in Pi+1.p(i)=\text{the entry at position }i\text{ in }P_{i+1}.

This entry exists by (6.2). The initial-segment property ensures that its value agrees with the entry at position ii in any stage having that position: any two stages are comparable by inclusion as initial segments.

If i≠ji\ne j, choose a stage whose length exceeds both indices. Its entries are distinct and agree with pp at those positions, proving injectivity. For any x∈N0x\in\mathbb{N}_{0}, the value xx belongs to Px+1P_{x+1} by (6.1). If it is at position ii in that list, the same agreement gives p(i)=xp(i)=x. Thus pp is surjective. In particular, every value occupies a finite position, and this is a permutation of order type ω\omega.

Finally, suppose i<j<k<ℓi<j<k<\ell satisfy (1.1). The stage Pℓ+1P_{\ell+1} contains all four positions and agrees there with pp. Its closure condition applied to the first three entries puts p(ℓ)p(\ell) before p(k)p(k), contrary to k<ℓk<\ell. This proves the theorem. □

The construction only needs an admissible extension at each step. In particular, it never reorders a previously placed value. The binary orders serve to sort the finite added blocks; the stages determine the order of the infinite sequence.

Lean formalization and reproducibility

The accompanying file Erdos196.lean contains the complete Lean proof, including every lemma specific to this construction. Its imports are

import FormalConjectures.ErdosProblems.«196»
import TaskSupport

The checked environment uses Lean 4.33.1 and Formal Conjectures commit 8432eac998110a563e03df65a28c117e97c8c142.

The dependence on TaskSupport implements the exact target-type notation used in the submission bundle. The mathematical construction is contained in the namespace Bounty.Construction196. The correspondence between the paper and the principal declarations is shown below; namespace prefixes are omitted in the right-hand column.

Mathematical componentLean declaration
Binary comparison and rankcode_lt_iff_split, rank_lt_of_split
Lemma 2.3binary_no_three
Lemma 3.1finite_saturation
Corollary 3.3saturated_exists
Definition 4.1Closed, Compatible, Good
Theorem 5.1finite_extension
Nested stages and enumerationstage, permFun
Injectivity and surjectivitypermFun_injective, permFun_surjective
Absence of four-term progressionspermFun_no_four, counterexample
Theorem 1.1 in index formBounty.paper_main

Table 1.

In Lean, a binary residue is represented by its finite list of low bits. The relation LowEq k a b states equality of the bits below kk; code uses the lexicographic order of preferred versus nonpreferred bits. The proof of finite_saturation is exactly the sublevel-set argument of Lemma 3.1. The stages are selected using classical choice from finite_extension. The formalized result is the existence theorem; it does not assert executable running-time bounds.

The main library-facing conclusion is

∃f:N≃N,¬HasMonotoneAP⁡f 4.\exists f : \mathbb{N} \simeq\mathbb{N},\quad\neg\operatorname{HasMonotoneAP} f\ 4.

Here Lean’s N\mathbb{N} includes zero, and ≃\simeq denotes a bijection. The predicate HasMonotoneAP permits either orientation of an arithmetic progression along a strictly increasing list of indices. The proof converts that predicate to the two equalities in (1) and applies permFun_no_four. The declaration Bounty.paper_main states Theorem 1.1 directly in index form. The declaration Bounty.target proves the negation of the pinned catalogue type. In ASCII Lean notation, the final step is

theorem target : Not (fcTypeOfName% "Erdos196.erdos_196") := by
  intro h
  cases Construction196.counterexample with
  | intro f hf => exact hf (h.mp True.intro f)

The source type is True ↔ ∀f : N ≃ N, HasMonotoneAP f 4; the displayed argument negates that affirmative assertion.

Local compilation, the validator’s static checks, and its exact-target inspector passed for the submission. The standalone companion and its explicit index theorem were also compiled. The axiom audit for the finite extension theorem, the counterexample, the index theorem, and the final target lists only

propext, Classical.choice, Quot.sound

These are standard axioms of the Lean environment. There are no admitted proofs or new axioms in the supplied construction, and its conclusions do not depend on the admitted open conjecture in the imported catalogue.

The supplementary archive contains both the standalone source and Erdos196-submission.lean, the body formatted for the catalogue’s Counterexample-mode wrapper. The latter omits imports and the outer namespace because the validator supplies them. The archive records the dependency revision, file hashes, and the local checking results.

Acknowledgment of AI assistance

OpenAI’s Codex assistant was used extensively in developing the mathematical argument, checking related literature, producing and debugging the Lean 4 formalization, and drafting and typesetting this manuscript. This assistance included substantive proof ideas and generated proof code.

The named authors are responsible for the final manuscript and its submission.

Email address: [email protected]

Email address: [email protected]

References

  1. [1]H. Ardal, T. Brown, and V. Jungić, Chaotic orderings of the rationals and reals, Amer. Math. Monthly 118 (2011), no. 10, 921–925. doi:10.4169/amer.math.monthly.118.10.921.DOI
  2. [2]Conjectures.io, Erdős problem 196, https://conjectures.io/problems/erdos196-erdos-196. Accessed Sep-tember 9, 2026.
  3. [3]J. A. Davis, R. C. Entriger, R. L. Graham, and G. J. Simmons, On permutations containing no long arithmetic progressions, Acta Arith. 34 (1977), no. 1, 81–90. doi:10.4064/aa-34-1-81-90.
  4. [4]J. Geneson, Density bounds for permutations avoiding monotone arithmetic progressions, preprint, arXiv:2608.12604v1 (2026). https://arxiv.org/abs/2608.12604v1.
  5. [5]Google DeepMind, Formal Conjectures, file FormalConjectures/ErdosProblems/196.lean, revision 8432eac998110a563e03df65a28c117e97c8c142. https://github.com/google-deepmind/formal-conjectures.

Paper details

vlnc:W_53wzxjyu
Version
v1 · latest
Published
Fresh — published within the last 30 days
License
CC BY 4.0
Usage

views · 11

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Codex

View statement
Looking for related papers…
Contents