Alec Kriebel

An elementary counterexample to Long’s clique equality

Read the paper (PDF) · Download PDF · Supporting ZIP · Zenodo record

Plain-English explanation · Read on this page · Collaboration


Abstract

For the full ring of integers of ℚ(√10), both the unit-difference graph and the graph allowing unit or prime-element differences have clique number 2, while the least norm of a nonzero prime ideal is 2. Thus the two sides of the equality asked about in Long's Question 7.2 in arXiv:1512.04620v1 are 2 and 4. The proof uses the classical nonprincipal ideal (2, √10) and its two-element residue field. We include the elementary arithmetic and specify the prime-element convention, which is essential to the conclusion. No novelty or historical priority claim is made.

The idea in plain English

Color the integers of ℚ(√10) by whether the constant coefficient is even or odd. Every allowed edge joins different colors. This forces both clique numbers to be two, while the proposed formula gives four.

The precise result

In O = ℤ[√10], join two elements if their difference is a unit. In the larger graph also allow prime-element differences, where a prime element generates a proper prime ideal. Both graphs have clique number 2. The least norm of a nonzero prime ideal is 2, so the two sides of Long’s Question 7.2 are 2 and 4.

Why the parity coloring works

The even-constant-term elements form the prime ideal P = (2, √10), with residue field ℤ/2ℤ. If P had a generator, its norm would force a2 − 10b2 = ±2, which is impossible modulo 5. A prime element in P would generate P because both ideals would be nonzero and prime, hence maximal. Thus neither a unit nor a prime element lies in P.

Elements of the same color differ by an element of P. The unit difference between 0 and 1 makes the bound of two exact.

Scope

The graph uses prime elements in the usual ideal-theoretic sense. If the definition also allows irreducible elements or differences generating proper powers of prime ideals, the graph changes. For example, 2 is irreducible here and (2) = P2.

Background and prior work

The note uses the exact question in Long’s first arXiv version, §§7.1–7.2. The prime-difference convention follows the discussion in Long’s paper on exceptional sequences. The ideal calculation is classical.

Status and AI use

Unrefereed preprint. AI tools assisted substantially in developing, writing and checking the work. Independent human review is welcome.

Read the paper

Open the published PDF · Download PDF · Original PDF on Zenodo

Supporting materials

Download Prime_Difference_Counterexample_Verification_v1.0.zip · Original support archive on Zenodo

Collaborate on this result

I welcome independent checks of the ideal argument and comparisons with related graph definitions in the primary literature, or substantive work toward a revised exposition.

Authorship and responsibilities would be discussed in relation to substantive contributions. Contact Alec.

Cite this paper

Kriebel, Alec (2026). An elementary counterexample to Long’s clique equality. Version 1.0. Zenodo. 10.5281/zenodo.23444093.

Download BibTeX

Licensing

The deposited work is available under Creative Commons Attribution 4.0.