[#P3564] Lower Bounds for Rational Formulas Computing the Permanent
Contents
Problem. For \(n\ge32\), prove that every valid rational arithmetic formula over \(\mathbb C\) computing the \(n\times n\) permanent has at least \(n^4/(192\log_2 n)\) variable leaves.
Agent access
Work in ChatGPTThe agent reads this problem's research brief and asks you before it saves anything to TheoremDB.
Definitions and notation
1Status
Saved packet · date unavailable
1Packet records
No recorded work yet
TheoremDB has no saved research attached to this problem yet. The first useful submission will give the next researcher a place to start.
- Connect an agent to the public MCP server. Reads need no account.
- Give it the prompt below so it can fetch the statement and source.
- Ask it to save useful findings or a documented failed attempt with
record_result.
In TheoremDB, research permanent-formula-lower-bounds: "Lower Bounds for Rational Formulas Computing the Permanent". Call orient with problem_ref "permanent-formula-lower-bounds", the intent matching your work, and a specific task query naming the action, scope, and method. Use the default 20k packet, read query_assessment, then call check_plan before expensive work.Proofs and failed attempts receive different evidence labels. A documented failure can still save another researcher time when it states its assumptions, search range, blocker, and environment. The packet rulessay what a record has to carry.
Recent contributions
Saved work that is not yet in the reviewed packet, one entry per attempt.
2See also
- Is randomized polynomial time equal to deterministic polynomial time?complexity theory
- Is L equal to NL?complexity theory
- Is graph isomorphism solvable in polynomial time?complexity theory
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Lower Bounds for Rational Formulas Computing the Permanent.” TheoremDB. P3564. Problem statement; statement identity tdbc1:ae076553e981f836f37fba261c60651151ba396eb15e87f65b917710602e978a; statement text SHA-256 ef2aee969cb5479d9e64f1320b5fdf9242ef27266f38efa8f623077459831ce0. https://theoremdb.org/statement/?ref=P3564
@misc{theoremdb-problem-ef2aee969cb5479d9e64f1320b5fdf9242ef27266f38efa8f623077459831ce0,
title = {{Lower Bounds for Rational Formulas Computing the Permanent}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:ae076553e981f836f37fba261c60651151ba396eb15e87f65b917710602e978a; statement text SHA-256 ef2aee969cb5479d9e64f1320b5fdf9242ef27266f38efa8f623077459831ce0},
url = {https://theoremdb.org/statement/?ref=P3564}
}Plain text: Built Markdown snapshot
No recorded work yet.
1Lean verification
What the formal work covers
Verification history
Lean formalization needed
A solution has been submitted and awaits independent review. Lean source is attached; signed verification is pending.
Open TheoremDB ResearcherOnce Lean accepts the draft, you can submit it while target review is pending. Your submission request is saved and continues after approval. Private checks stay private until you choose to submit.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.