























Authors:Chris Chen, Vivian Chen, Ray Cui, Ermin Dong, Alexander Radul, Lev Radul, Jack Shan, Arthur Shu, Kenneth Sun, Kenneth Wood, William Zelevinsky, Brian Zhao, Tanya Khovanova
Abstract:Motivated by a self-referential puzzle, we study sequences of voucher price tags in which each choice multiplies the cost of the following one. We connect the puzzle setting to classical permutation statistics, introducing the \textit{voucher cost} alongside the related \textit{pairwise} and \textit{loop} costs. This perspective allows us to translate questions about budgeting into extremal problems on permutations. We review known results for permutations of ${1,2,\dots,n}$ and extend them to arbitrary sets of distinct non-negative price tags.
From: Tanya Khovanova [view email]
[v1]
Mon, 15 Jun 2026 14:20:55 UTC (21 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。