arXiv (All)
open access
An infinite family of counterexamples to the Polycirculant Conjecture
We disprove the Polycirculant Conjecture, which states that every transitive 2-closed permutation group is non-elusive, i.e. contains a derangement of prime order. In fact, we prove a stronger result, answering a long-standing question of Marušič and Jordan: there exists a vertex-transitive graph ad
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Real-rooted Eulerian polynomials from permutations, words, and paths#975372
- Intersection Orbital Graphs of Permutation Groups and Reconstruction of Simple Groups#1116304
- A permutation group acting transitively on certain collections of models#1129059
- The group generated by a graph's derangements#1343968
- The Burness-Giudici Conjecture on Primitive Groups with Socle $Ree(q)$ and $Sz(q)$#1070741
Record · ID 1402237
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive