{"paper":{"title":"Symbol ratio minimax sequences in the lexicographic order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Andr\\'e de Carvalho, Philip Boyland, Toby Hall","submitted_at":"2013-01-03T13:57:16Z","abstract_excerpt":"Consider the space of sequences of k letters ordered lexicographically. We study the set M({\\alpha}) of all maximal sequences for which the asymptotic proportions {\\alpha} of the letters are prescribed, where a sequence is said to be maximal if it is at least as great as all of its tails. The infimum of M({\\alpha}) is called the {\\alpha}-infimax sequence, or the {\\alpha}-minimax sequence if the infimum is a minimum. We give an algorithm which yields all infimax sequences, and show that the infimax is not a minimax if and only if it is the {\\alpha}-infimax for every {\\alpha} in a simplex of dim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0458","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}