TheoremDB

Problem packetResearch packetR198

R198Recorded attempt

The literature establishes enumeration and precise asymptotics

View evidenceOpen source ↗
Link to a section

Authored summary

The focused audit found the sequence, its limit, and full asymptotics, with no theorem giving the requested threshold.

The record cites sources for its explanation. The outcome applies to this attempt's recorded scope.

Attempt outcome: completed

Recorded scope: No scope is recorded.

Originating problem: Eventual decrease for distinct cycle lengths in random permutations

Authored record and scope
Authored title
The literature establishes enumeration and precise asymptotics
Record type
attempt
Stored status
completed
Evidence grade
sourced

Work and source credit

Recorded action

No action description supplied.

Authored result summary

The focused audit found the sequence, its limit, and full asymptotics, with no theorem giving the requested threshold.

Reported outcome

No separate outcome supplied.

Recorded status

completed

Recorded evidence grade

sourced

Recorded scope

No explicit scope supplied.

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

Lehmer studies the same reciprocal weights on distinct partitions and proves the limit \(e^{-\gamma}\). Greene and Knuth obtain the first useful error term. Flajolet and coauthors derive the full root-of-unity expansion. Knopfmacher and Warlimont place the product in a broader class of restricted cycle types.

Searches using the sequence number, the product, `permutations with distinct cycle lengths`, `monotonicity`, and `decreasing probability` located no primary source proving strict decrease after 30. This audit supports an unresolved status rather than a claim that the question is new.

Continue this work
Replay material: source only

3Outcome

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, D. H. Lehmer, Acta Arithmetica 21 (1972), 379-388; Flajolet et al., EJC 13 (2006), R103; A. Knopfmacher and R. Warlimont, Australasian Journal of Combinatorics 13 (1996), 151-162

4How it connects

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R198",
  "content_hash": null,
  "slug": "dclp-attempt-literature-audit",
  "type": "attempt",
  "title": "The literature establishes enumeration and precise asymptotics",
  "summary": "The focused audit found the sequence, its limit, and full asymptotics, with no theorem giving the requested threshold.",
  "relevance": "For Eventual decrease for distinct cycle lengths in random permutations, record dclp-attempt-literature-audit (“The literature establishes enumeration and precise asymptotics”) documents a concrete method, search boundary, or failed route. The record states: The focused audit found the sequence, its limit, and full asymptotics, with no theorem giving the requested threshold.",
  "relevance_source": "recorded",
  "body": "Lehmer studies the same reciprocal weights on distinct partitions and proves the limit \\(e^{-\\gamma}\\). Greene and Knuth obtain the first useful error term. Flajolet and coauthors derive the full root-of-unity expansion. Knopfmacher and Warlimont place the product in a broader class of restricted cycle types.\n\nSearches using the sequence number, the product, `permutations with distinct cycle lengths`, `monotonicity`, and `decreasing probability` located no primary source proving strict decrease after 30. This audit supports an unresolved status rather than a claim that the question is new.",
  "status": "completed",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://doi.org/10.4064/aa-21-1-379-388",
      "locator": "D. H. Lehmer, Acta Arithmetica 21 (1972), 379-388; Flajolet et al., EJC 13 (2006), R103; A. Knopfmacher and R. Warlimont, Australasian Journal of Combinatorics 13 (1996), 151-162"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.4064/aa-21-1-379-388",
    "locator": "D. H. Lehmer, Acta Arithmetica 21 (1972), 379-388; Flajolet et al., EJC 13 (2006), R103; A. Knopfmacher and R. Warlimont, Australasian Journal of Combinatorics 13 (1996), 151-162"
  },
  "models": [],
  "relations": [
    {
      "slug": "dclp-problem-eventual-strict-decrease",
      "title": "Does the distinct-cycle-length probability decrease after n=30?",
      "object_type": "problem",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "distinct-cycle-length-probability-decreasing",
      "title": "distinct cycle length probability decreasing",
      "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.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.