Papers
Topics
Authors
Recent
Search
2000 character limit reached

Smith's Conjecture: Multi-Domain Insights

Updated 9 July 2026
  • Smith’s Conjecture is a multi-domain concept referring to different conjectural statements in graph theory, algebraic number theory, and quantum field theory.
  • In graph theory, it posits that any two longest cycles in a k-connected graph intersect in at least k vertices, with proofs confirmed in certain high-connectivity regimes.
  • In number theory and QFT, analogous forms predict prime pair distributions and relate tree-level unitarity bounds to renormalizability, guiding ongoing research and highlighting counterexamples.

Searching arXiv for papers on “Smith’s Conjecture” across domains to ground the article. “Smith’s Conjecture” is not a single invariant statement across the arXiv literature represented here. The name appears in at least three distinct technical settings: a graph-theoretic conjecture asserting that in any kk-connected graph any two longest cycles intersect in at least kk vertices (Gutiérrez et al., 2023); the Gross–Smith generalization of Hardy–Littlewood prime pair conjectures to algebraic number fields, presented in one exposition as “Smith’s Conjecture” in number fields (Kuperberg et al., 2020); and Llewellyn Smith’s conjecture in quantum field theory, which ties tree-level unitarity bounds to perturbative renormalizability in local, Lorentz-invariant theories with a positive-definite Hilbert space (Abe et al., 2022). This multiplicity of usage suggests that the term is domain-sensitive rather than canonical.

1. Principal usages of the name

The following table summarizes the three usages documented in the supplied arXiv material.

Domain Conjectural content arXiv
Graph theory Every pair of longest cycles in a kk-connected graph intersect in at least kk vertices (Gutiérrez et al., 2023)
Algebraic number theory Prime-element pairs in OKO_K at fixed difference η\eta are governed by a singular series S(η)\mathfrak{S}(\eta) (Kuperberg et al., 2020)
Quantum field theory Tree-level unitarity bounds are tied to perturbative renormalizability in positive-metric theories (Abe et al., 2022)

In graph theory, the paper “On two conjectures about the intersection of longest paths and cycles” treats Smith’s Conjecture as the diagonal case of a family C(k,r)C(k,r) of cycle-intersection statements:

Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}

The same paper places this beside Hippchen’s path analogue P(k,k)P(k,k) and makes the cycle statement the central object (Gutiérrez et al., 2023).

In algebraic number theory, Gross and Smith formulate a prime-pair conjecture over algebraic number fields, and the supplied exposition explicitly identifies this framework as “Smith’s Conjecture” in number fields. The conjecture is a Hardy–Littlewood-type prediction for prime elements in kk0, with local factors indexed by prime ideals kk1 and a singular series kk2 depending on a fixed nonzero shift kk3 (Kuperberg et al., 2020).

In high-energy theory, the relevant name is more precise: Llewellyn Smith’s conjecture. It concerns the relation between tree-level partial-wave unitarity bounds and perturbative renormalizability. The supplied papers on quadratic gravity analyze its domain of validity and exhibit a counterexample once negative-norm states are present (Abe et al., 2022).

2. Smith’s Conjecture in graph theory

The graph-theoretic formulation is the most literal use of the bare name in the supplied material. Let kk4 be a simple graph, let kk5, and let kk6 be kk7-connected in the sense that every separator kk8 has kk9. If kk0 and kk1 are longest cycles in kk2, Smith’s Conjecture asserts

kk3

The paper formalizes this as kk4 and treats it as the cycle member of a broader family kk5 (Gutiérrez et al., 2023).

A central structural relation is the reduction

kk6

where kk7 is the analogous conjecture for longest paths. The reduction adds a universal vertex kk8 to a kk9-connected graph kk0, producing a kk1-connected graph kk2 in which longest paths kk3 in kk4 become longest cycles kk5 and kk6. Removing kk7 transfers any cycle-intersection lower bound back to a path-intersection lower bound (Gutiérrez et al., 2023).

The paper proves the following cycle theorem:

kk8

for any two longest cycles kk9 in a OKO_K0-connected graph on OKO_K1 vertices. A direct corollary is that Smith’s Conjecture holds whenever

OKO_K2

This confirms the conjecture in a high-connectivity range relative to the order OKO_K3 (Gutiérrez et al., 2023).

The same paper records prior progress: for OKO_K4, OKO_K5 holds. It also cites Chen et al.’s general lower bound

OKO_K6

Thus the current status described in the supplied literature is twofold: exact intersection at level OKO_K7 is known for OKO_K8 and for OKO_K9, while intermediate regimes remain open (Gutiérrez et al., 2023).

3. Proof architecture for the graph-theoretic result

The proof of the bound

η\eta0

is organized around fan constructions, circumference estimates, and inclusion–exclusion. Let η\eta1 and η\eta2 be longest cycles of common length η\eta3, and write

η\eta4

The argument selects a “short” path η\eta5 of length at most η\eta6 from a component of η\eta7 or η\eta8, and without loss takes η\eta9, with endpoints S(η)\mathfrak{S}(\eta)0. Applying the fan lemma to S(η)\mathfrak{S}(\eta)1 and S(η)\mathfrak{S}(\eta)2 with target S(η)\mathfrak{S}(\eta)3 yields two families S(η)\mathfrak{S}(\eta)4 and S(η)\mathfrak{S}(\eta)5 of internally disjoint paths from S(η)\mathfrak{S}(\eta)6 and S(η)\mathfrak{S}(\eta)7 to S(η)\mathfrak{S}(\eta)8, each of size at least S(η)\mathfrak{S}(\eta)9, with distinct endpoints on C(k,r)C(k,r)0 (Gutiérrez et al., 2023).

From the endpoint set C(k,r)C(k,r)1, the proof constructs an auxiliary weighted cycle C(k,r)C(k,r)2. The edge weights record arc lengths along C(k,r)C(k,r)3, and the endpoints are colored according to whether they come from C(k,r)C(k,r)4 or C(k,r)C(k,r)5. The resulting estimates are:

C(k,r)C(k,r)6

and

C(k,r)C(k,r)7

These feed into the circumference lower bound

C(k,r)C(k,r)8

The bridge to intersection size is the inclusion–exclusion inequality

C(k,r)C(k,r)9

When Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}0, the fan estimate gives Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}1, hence

Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}2

When Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}3, a refined analysis of bicolored vertices, covered edges, and components of Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}4 yields either Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}5 directly or a fallback to Dirac’s circumference bound. This explains the appearance of the constants Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}6 and Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}7: they come from combining Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}8 with Conjecture C(k,k):In any k-connected graph G, any two longest cycles intersect in at least k vertices.\text{Conjecture C(k,k):}\quad \text{In any }k\text{-connected graph }G,\text{ any two longest cycles intersect in at least }k\text{ vertices.}9 (Gutiérrez et al., 2023).

The path analogue follows from the cycle-to-path reduction. The paper deduces

P(k,k)P(k,k)0

for any two longest paths P(k,k)P(k,k)1 in a P(k,k)P(k,k)2-connected graph on P(k,k)P(k,k)3 vertices, and therefore confirms Hippchen’s conjecture when P(k,k)P(k,k)4 or P(k,k)P(k,k)5 (Gutiérrez et al., 2023).

4. “Smith’s Conjecture” in algebraic number fields: the Gross–Smith framework

In the algebraic-number-theoretic usage, let P(k,k)P(k,k)6 be an algebraic number field with ring of integers P(k,k)P(k,k)7, degree P(k,k)P(k,k)8, and Dedekind zeta residue

P(k,k)P(k,k)9

A prime element kk00 means that the principal ideal kk01 is prime. Fix an integral basis kk02 of kk03, define the embedding kk04 by coordinates in that basis, and measure short intervals by sets of the form

kk05

The Gross–Smith prime pair conjecture then states that for fixed nonzero kk06,

kk07

as kk08, where kk09 is the indicator of prime elements (Kuperberg et al., 2020).

The singular series is

kk10

This is the number-field analogue of the classical Hardy–Littlewood singular series, with prime ideals replacing rational primes and kk11 replacing kk12. The paper also gives a Ramanujan expansion:

kk13

where kk14 is a Ramanujan sum over ideals, kk15 is the Möbius function on ideals, and

kk16

The proof strategy for the main analytic theorem does not rely on multiplicativity of singular series outside PIDs; instead it uses Ramanujan expansions, Fourier analysis, lattice counting, and analytic properties of kk17 (Kuperberg et al., 2020).

A “nice” smoothing function is a compactly supported kk18 whose Fourier transform satisfies

kk19

For such kk20, the principal unconditional theorem is

kk21

as kk22. In the case kk23 and kk24, this recovers Montgomery’s classical identity with the triangular weight kk25 (Kuperberg et al., 2020).

5. Short-interval prime statistics and the universal variance factor

The same number-field paper uses the Gross–Smith framework to formulate a variance conjecture for prime elements in short intervals. Define

kk26

and average over kk27 uniformly in kk28:

kk29

Using Mitsui’s generalized prime number theorem together with log-weighted lattice-sum asymptotics, the paper obtains

kk30

The centered count is

kk31

and the variance proxy is

kk32

The conjectural prediction for kk33, kk34, is

kk35

equivalently

kk36

This differs from a Cramér random model prediction,

kk37

by a universal factor kk38, independent of kk39, the embedding kk40, and the norm kk41 except through the volume ratio entering kk42 (Kuperberg et al., 2020).

The heuristic derivation expands the variance, invokes Gross–Smith pair correlations for prime elements, and isolates a main contribution proportional to a smoothed sum of kk43. The theorem on smoothed singular-series sums then supplies the term kk44, and the identity kk45 yields the correction

kk46

hence kk47. The cancellation of kk48-residue and volume constants explains the universality of the factor (Kuperberg et al., 2020).

The numerical evidence reported in the paper comes from quadratic fields

kk49

using sup norms on coordinates with respect to the chosen integral basis. For kk50 and kk51, the computed ratios kk52 align close to the line kk53 in all tested quadratic fields. The paper also records that convergence is slow and that identifying secondary terms remains an open direction (Kuperberg et al., 2020).

6. Llewellyn Smith’s conjecture in quantum field theory

In quantum field theory, the relevant conjecture is due to Llewellyn Smith and was developed in work of Bell and Cornwall–Levin–Tiktopoulos. In the positive-metric setting, kk54-matrix unitarity implies partial-wave bounds

kk55

for the partial-wave amplitudes

kk56

The traditional “tree unitarity” program constrains the high-energy behavior of tree-level kk57 amplitudes and connects those constraints to perturbative renormalizability in local, Lorentz-invariant theories with a positive-definite Hilbert space (Abe et al., 2022).

The quadratic-curvature theory studied in the supplied papers has action

kk58

together with a scalar-matter sector

kk59

On flat background with kk60, the graviton fluctuation decomposes as

kk61

where kk62 is a massless spin-2 field of positive norm, while kk63 contains a massive spin-2 field of negative norm and a massive scalar of positive norm. The canonical commutators include

kk64

which displays the negative norm of the massive spin-2 sector (Abe et al., 2022).

The graviton propagator in harmonic gauge is

kk65

with

kk66

For graviton–scalar scattering at fixed angle, representative ultraviolet behavior is

kk67

with the same leading growth for the odd helicity-2 combination. Since kk68, this is the familiar kk69 behavior, and the paper’s UV tables record in particular

kk70

These amplitudes violate the traditional tree-level unitarity bound in the positive-definite sense (Abe et al., 2022).

The central point is that quadratic gravity is nevertheless perturbatively renormalizable, as shown by Stelle. This makes it a counterexample to Llewellyn Smith’s conjecture in its traditional positive-metric form. The resolution proposed in the supplied papers is to replace the standard tree bound by the modified optical theorem appropriate to indefinite-metric theories:

kk71

where kk72 records the norm signature of the intermediate state. At tree level, the inequality

kk73

is taken as the analog of the unitarity bound. For forward scattering of a massless helicity-2 graviton and a scalar, the leading kk74 terms on the right-hand side cancel between positive-norm massless graviton channels and negative-norm massive spin-2 ghost channels, leaving behavior of order kk75 or softer. The papers therefore conclude that kk76 is respected at tree level in the pseudo-unitary sense even though the traditional tree-level bound fails (Abe et al., 2022, Abe et al., 2020).

The authors then propose a new conjecture: in local, Lorentz-invariant quantum field theories with polynomial interactions and an indefinite-metric Hilbert space, the analog of the tree-level unitarity bound appropriate to kk77-matrix unitarity gives conditions equivalent to those for perturbative renormalizability. Quadratic gravity is presented as a nontrivial example consistent with that reformulation (Abe et al., 2020).

7. Comparative status and open directions

Across these three usages, “Smith’s Conjecture” designates structurally different conjectures, but in each case current work combines a precise asymptotic or structural theorem with a remaining conjectural core.

For longest cycles in kk78-connected graphs, the open part lies between the verified regimes kk79 and kk80. The paper explicitly identifies the gap at smaller kk81 relative to kk82 and points to tightening the constants kk83 and kk84, or finding extremal constructions, as natural next steps (Gutiérrez et al., 2023).

For the Gross–Smith conjecture over algebraic number fields, the theorem on smoothed sums of singular series is unconditional, while the variance prediction

kk85

is heuristic and depends on the prime-pair conjecture together with smoothing approximations. The supplied exposition also identifies several open problems: sharpening error terms and secondary constants, extending smoothing to more general convex regions, obtaining the uniformity in kk86 needed for a rigorous variance derivation, and moving from pair correlations to higher correlations and other prime patterns in kk87 (Kuperberg et al., 2020).

For Llewellyn Smith’s conjecture, quadratic gravity shows that the traditional tree-level partial-wave criterion is not equivalent to renormalizability once negative-norm states are allowed. The open direction is therefore not the original conjecture itself, which the papers present as refuted in that broader setting, but the status of the replacement principle asserting equivalence between renormalizability and the pseudo-unitary high-energy constraints derived from the modified optical theorem. The supplied papers verify that principle at tree level for matter–graviton scattering in kk88 gravity, but do not claim a complete proof beyond that scope (Abe et al., 2022, Abe et al., 2020).

Taken together, these usages show that “Smith’s Conjecture” functions as a homonymous label rather than a uniquely determined theorem. In graph theory it is a longest-cycle intersection problem; in algebraic number theory it names a Hardy–Littlewood-type prime-pair framework over number fields; and in quantum field theory the relevant statement is Llewellyn Smith’s conjecture on tree unitarity and renormalizability.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Smith's Conjecture.