arXiv (All)
open access
How to measure the optimality of word or gesture order with respect to the principle of swap distance minimization
The structure of all the permutations of a sequence can be represented as a permutohedron, a graph where vertices are permutations and two vertices are linked if a swap of adjacent elements in the permutation of one of the vertices produces the permutation of the other vertex. It has been hypothesiz
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
- T-RoPE: Time-Aware Rotary Position Embedding for Sequential Recommendation#1104775
- Language Chain in Alignment: Cross-lingual Ranking Preference Optimization#677774
- Language Chain in Alignment: Cross-lingual Ranking Preference Optimization#674564
- On Sorting by Translocations#492868
- Move-rb: Faster Bi-Directional r-indexes and Approximate Pattern Matching#1078160
Record · ID 987631
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