Math-5789 · mathematics · Number theory

Math-5789

7.2 (Long) — Clique numbers in unit- and prime-difference graphs

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Retain $\mathcal O_k$ as in the source's item 7.1, whose statement is not supplied. In the usual number-field interpretation it is the ring of integers of a number field $k$; any further restriction on $k$ is unknown. Consider simple undirected graphs on the vertex set $\mathcal O_k$: distinct $x,y$ are adjacent in $\Gamma_{\mathrm{unit}}$ when $x-y\in\mathcal O_k^\times$, and are adjacent in $\Gamma_{\mathrm{prime}}$ when their difference is either a unit or a prime. The word "also" is retained, so the second graph includes the unit edges. Under the usual prime-element convention, a prime is an element generating a nonzero prime ideal; replacing it by an arbitrary irreducible element could change the graph and requires source clarification.

Write $\omega(\Gamma)$ for the clique number, the supremum of the cardinalities of vertex subsets whose distinct pairs are adjacent, and put \[ q_{\min}(k)=\min_{I\text{ nonzero prime ideal of }\mathcal O_k}|\mathcal O_k/I| \] in the finite-residue-field setting intended here. The source records the bound \[ \omega(\Gamma_{\mathrm{prime}}) \leq \omega(\Gamma_{\mathrm{unit}})\,q_{\min}(k). \] Question (Long). Is this inequality an equality, for $\mathcal O_k$ in the intended class? That is, does \[ \omega(\Gamma_{\mathrm{prime}}) =\omega(\Gamma_{\mathrm{unit}})\,q_{\min}(k) \] hold? The inequality and equality question are one source item. The excerpt does not establish the missing field hypotheses, prime-element convention, finiteness or attainment of clique numbers, or the scope of the quantifier over $k$. These cannot be resolved by replacing the second graph with a prime-only graph or by changing the recorded bound.

Short English statement

The source gives an upper bound for the clique number of the graph whose differences are units or primes, in terms of the unit graph and smallest prime-ideal residue field. Long asks whether the bound is always sharp in the ring class specified by the missing item 7.1.

Sources

  • Local UnsolvedMath registry, permanent ID 10900050, source code catalogue entry; attribution Long, subsection 7.2, "Clique numbers in unit- and prime-difference graphs." Explicit dependence on item 7.1 is retained.
  • Delp, Hoffoss and Manning, Problems In Groups, Geometry, and Three-Manifolds (2015), subsection 7.2, PDF page 6. Supplied URLs: https://arxiv.org/pdf/1512.04620#page=6 and https://arxiv.org/abs/1512.04620; recorded access 2026-07-29; extraction source-tex checked against rendered PDF text. The inequality and its equality question share the single printed label.
  • Supplied status open and OPEN-TRIAGE. The summary reports no verified result and no specifically addressing publication located in a web search whose cap was reached. This limited search assessment is not an independently verified absence of literature. The 2015 source presents the item as open; no complete modern primary-literature audit is recorded. Status evidence and redistribution terms of the publicly accessible author-submitted TeX and PDF remain NEEDS_REVIEW.

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.