Search arXivSearch

arXiv · 2509.14595

Monochromatic 4-AP avoidance in 2-colorings of Z/pZ for primes p >= 5 and a computation of W_c(4,2)

Abstract

We study 2-colorings of Z/pZ that avoid monochromatic 4-term arithmetic progressions for every step d with p not dividing d. We prove a complete classification for primes: such a coloring exists if and only if p is in {5, 7, 11}. When solutions exist, the minimal period equals p, and we enumerate them up to dihedral symmetries and a global color swap. Nonexistence for all other primes combines DRAT-verified UNSAT certificates for 13 ≤ p ≤ 997 with a cyclic van der Waerden corollary that forces nonexistence for every prime p ≥ 34. Using the same SAT/DRAT pipeline on composite moduli (restricted to non-degenerate windows), we certify the exact cyclic van der Waerden value W_c(4,2) = 34: we find a witness at M = 33 and produce a DRAT-verified UNSAT certificate at M = 34. For all M ≥ 35 the bound W_c(4,2) ≤ W(4,2) = 35 implies unavoidability. All scripts and proof logs are provided for exact reproduction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Keane Maverick Irawan. 2025-09-19. Monochromatic 4-AP avoidance in 2-colorings of Z/pZ for primes p >= 5 and a computation of W_c(4,2). https://arxiv.org/abs/2509.14595

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO