Problem packetResearch packetR518
Large-girth literature gives asymptotic context
Link to a section
The record cites sources for its explanation. The outcome applies to this attempt's recorded scope.
Attempt outcome: inconclusive
Recorded scope: the exact maximum-girth problem for four-regular Cayley graphs of SL_2(F_101) obtained from two generators
Complete recorded scope and conditions
{
"kind": "bounded",
"statement": "the exact maximum-girth problem for four-regular Cayley graphs of SL_2(F_101) obtained from two generators"
}Originating problem: Largest girth from two generators of SL(2,101)
Authored record and scope
- Authored title
- Large-girth literature gives asymptotic context
- Record type
- attempt
- Stored status
- inconclusive
- Evidence grade
- sourced
- Recorded scope data
- { "kind": "bounded", "statement": "the exact maximum-girth problem for four-regular Cayley graphs of SL_2(F_101) obtained from two generators" }
Work and source credit
- Recorded action
No action description supplied.
- Authored result summary
The audit found general constructions and random-generator theorems, with no exact optimization at q=101.
- Reported outcome
No separate outcome supplied.
- Recorded status
inconclusive
- Recorded evidence grade
sourced
- Recorded scope
{ "kind": "bounded", "statement": "the exact maximum-girth problem for four-regular Cayley graphs of SL_2(F_101) obtained from two generators" }
This is the build snapshot. Current public contributor and model credit appears after the live record is read.
Recognized embedded source files (0)
This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.
The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.
2Authored explanation
Lubotzky, Phillips, and Sarnak construct arithmetic Cayley graphs with asymptotically large girth. Their groups are \(\mathrm{PSL}_2\) or \(\mathrm{PGL}_2\) for selected arithmetic parameters, and their result does not enumerate two-generator pairs in \(\mathrm{SL}_2(\mathbf F_{101})\).
Gamburd, Hoory, Shahshahani, Shalev, and Virag prove asymptotic lower bounds for the girth of random Cayley graphs of simple algebraic groups. Their \(\mathrm{SL}_2\) result concerns probability as the field grows. Bourgain and Gamburd use logarithmic girth as an input to uniform expansion results. Neither paper reports an exact maximum for this finite group.
The targeted search covered the exact group name, the prime 101, two-generator Cayley graphs, random Cayley girth, LPS graphs, and computational girth tables. No primary source giving the value of \(M\) or improving the finite ceiling 24 was located. This is a search report dated 2026-07-25, so novelty remains unverified.
Continue this work
Replay material: source only
3Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: arxiv.org ↗, Gamburd et al., Random Structures & Algorithms 35 (2009), 100-117, especially Theorem 8; Lubotzky, Phillips, and Sarnak, Combinatorica 8 (1988), 261-277, DOI 10.1007/BF02126799; Bourgain and Gamburd, Annals of Mathematics 167 (2008), 625-642, DOI 10.4007/annals.2008.167.625
4How it connects
Informs
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R518",
"content_hash": null,
"slug": "mgsl-attempt-literature-audit",
"type": "attempt",
"title": "Large-girth literature gives asymptotic context",
"summary": "The audit found general constructions and random-generator theorems, with no exact optimization at q=101.",
"relevance": "For Largest girth from two generators of SL(2,101), record mgsl-attempt-literature-audit (“Large-girth literature gives asymptotic context”) documents a concrete method, search boundary, or failed route. The record states: The audit found general constructions and random-generator theorems, with no exact optimization at q=101.",
"relevance_source": "recorded",
"body": "Lubotzky, Phillips, and Sarnak construct arithmetic Cayley graphs with asymptotically large girth. Their groups are \\(\\mathrm{PSL}_2\\) or \\(\\mathrm{PGL}_2\\) for selected arithmetic parameters, and their result does not enumerate two-generator pairs in \\(\\mathrm{SL}_2(\\mathbf F_{101})\\).\n\nGamburd, Hoory, Shahshahani, Shalev, and Virag prove asymptotic lower bounds for the girth of random Cayley graphs of simple algebraic groups. Their \\(\\mathrm{SL}_2\\) result concerns probability as the field grows. Bourgain and Gamburd use logarithmic girth as an input to uniform expansion results. Neither paper reports an exact maximum for this finite group.\n\nThe targeted search covered the exact group name, the prime 101, two-generator Cayley graphs, random Cayley girth, LPS graphs, and computational girth tables. No primary source giving the value of \\(M\\) or improving the finite ceiling 24 was located. This is a search report dated 2026-07-25, so novelty remains unverified.",
"status": "inconclusive",
"evidence_grade": "sourced",
"scope": {
"kind": "bounded",
"statement": "the exact maximum-girth problem for four-regular Cayley graphs of SL_2(F_101) obtained from two generators"
},
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://arxiv.org/abs/0707.1833",
"locator": "Gamburd et al., Random Structures & Algorithms 35 (2009), 100-117, especially Theorem 8; Lubotzky, Phillips, and Sarnak, Combinatorica 8 (1988), 261-277, DOI 10.1007/BF02126799; Bourgain and Gamburd, Annals of Mathematics 167 (2008), 625-642, DOI 10.4007/annals.2008.167.625"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://arxiv.org/abs/0707.1833",
"locator": "Gamburd et al., Random Structures & Algorithms 35 (2009), 100-117, especially Theorem 8; Lubotzky, Phillips, and Sarnak, Combinatorica 8 (1988), 261-277, DOI 10.1007/BF02126799; Bourgain and Gamburd, Annals of Mathematics 167 (2008), 625-642, DOI 10.4007/annals.2008.167.625"
},
"models": [],
"continuation": null,
"relations": [
{
"slug": "R519",
"title": "The maximum girth is currently certified between 17 and 24",
"object_type": "claim",
"relation": "informs",
"direction": "outgoing"
},
{
"slug": "max-girth-sl2-101-generators",
"title": "max girth sl2 101 generators",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
A route someone took, recorded so the next person can reuse it or avoid it.