arXiv (All)
open access
Online Treasure Hunt in Vertex-Permuted Dynamic Rings
We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions o
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
- Online Treasure Hunt in Vertex-Permuted Dynamic Rings#673476
- Greedy queens and the golden ratio#1106035
- Strongly clean ring elements that are one-sided inverses#491756
- Compressed commuting graphs of matrix rings#999142
- Balanced Gray Codes for Permutations and Rainbow Cycles for Associahedra#1014533
Record · ID 998581
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