arXiv AI
Jul 16
CayleyR: Solving the TopSpin puzzle via cycle intersection
arXiv:2607. 13219v1 Announce Type: new Abstract: We present cayleyR, an R package for solving permutation puzzles by detecting cycle intersections in Cayley graphs.
CayleyR: Solving the TopSpin puzzle via cycle intersection
We present cayleyR, an R package for solving permutation puzzles by detecting cycle intersections in Cayley graphs. The core algorithm performs an iterative bidirectional search: from both the initial and target permutation states, random operation sequences generate cycles in the Cayley graph of the symmetric group Sn; their intersection yields a connecting path.
Related stories
arXiv AI
Jun 9
Order Matters: Unveiling the Hidden Impact of Macro Placement Sequences via Proxy-Guided LLM Evolution
arXiv:2606. 08904v1 Announce Type: new Abstract: Macro placement is a fundamental step in modern chip physical design, playing a crucial role in determining the solution quality of high-dimensional combinatorial optimization problems.
arXiv AI
Jul 14
Instruction Set and Language for Hypergraphs
arXiv:2607. 10194v1 Announce Type: cross Abstract: We present IsalHG, a method for representing the structure of any finite, connected hypergraph of bounded hyperedge arity as a string over a compact instruction alphabet $\Sigma_{\mathrm{HG}}$.
Hugging Face Trending Papers
Jun 8
Order Matters: Unveiling the Hidden Impact of Macro Placement Sequences via Proxy-Guided LLM Evolution
Macro placement is a fundamental step in modern chip physical design, playing a crucial role in determining the solution quality of high-dimensional combinatorial optimization problems. Despite recent advancements in machine learning for spatial coordinate determination, the temporal dimension of placement sequencing remains largely governed by static heuristics.
arXiv AI
Jul 21
Panache: One-Pass Motif Discovery at Every Window Length
arXiv:2607. 17481v1 Announce Type: new Abstract: Motif discovery, the search for recurring patterns within a time series, is a core primitive of exploratory data analysis.
arXiv AI
Aug 3
GPU-Accelerated ANNS: Quantized for Speed, Built for Change
arXiv:2601. 07048v5 Announce Type: replace-cross Abstract: Approximate nearest neighbor search (ANNS) is a core problem in machine learning and information retrieval applications.
arXiv AI
Jul 28
Key-Interval A*: Accelerating Grid Pathfinding via Structural Abstraction
arXiv:2607. 23393v1 Announce Type: new Abstract: Existing exact methods for 4-connected grid pathfinding reduce online search, but often either retain fine-grained search states or require substantial preprocessing.
Hugging Face Trending Papers
Jul 20
Panache: One-Pass Motif Discovery at Every Window Length
Motif discovery, the search for recurring patterns within a time series, is a core primitive of exploratory data analysis. A pattern, however, is defined by its duration, which analysts rarely know in advance.
arXiv AI
1d ago
A Bi-directional Multi-solution Scalable Grover Search Algorithm
arXiv:2404. 15616v2 Announce Type: replace-cross Abstract: Grover's search algorithms, including various Partial Grover Searches (PGS), suffer from scaling issues when multiple solutions are sought, as the number of iterations scales with the number of solutions or marked states, making implementation more computationally expensive.
arXiv Machine Learning
Jul 15
Learning the Graphical Nature of Symmetries
arXiv:2607. 12026v1 Announce Type: cross Abstract: Finite groups are rigid algebraic objects, whose Cayley graphs expose a rich network geometry through which group-theoretic structure can be measured, compared, and learned.
arXiv AI
Aug 11
PRISM: A Predictive Protocol for Permutation Optimization via Landscape Diagnostics
arXiv:2608. 08344v1 Announce Type: cross Abstract: Permutation optimization arises whenever the components of a system are fixed but their ordering affects performance.
arXiv AI
Jun 30
ImprovEvolve: Basin-Hopping Meets LLM-Guided Evolutionary Search
arXiv:2602. 10233v2 Announce Type: replace-cross Abstract: LLM-guided evolutionary computation, most notably AlphaEvolve, has been remarkably successful in discovering novel mathematical constructions by solving challenging optimization problems.