Search arXiv⌕ Search

arXiv subjects

Tejo Madhavarapu

Publications and source records attributed to Tejo Madhavarapu.

2 recordsLinked to original sources

Fair Duels after a False Start

In the fair dueling game, two players take turns shooting at each other, with the turn order defined by the following fairness criterion: the next shot is assigned to the player who is less likely to have won the duel so far. Cooper and Dutle showed that when both players have the same probability $p$ of a successful shot, the shooting sequence converges to the Thue--Morse sequence as $p \rightarrow 0$. We extend this model by forcing the sequence to begin with an arbitrary finite prefix before reverting to this fairness criterion. We prove that this initial disruption fundamentally alters the sequence's eventual behavior: in the $p \rightarrow 0$ limit, unless the initial prefix is itself a prefix of the Thue--Morse sequence or its complement, the resulting sequence is eventually periodic. Moreover, the least period is a power of 2 that is at most $4^{n+1}$, where $n$ is the length of the prefix, and the repeating block is itself a prefix of the Thue--Morse sequence.

math.CO↗

Is There An Ideal Color Wheel?

The familiar color wheel is a disk divided into six sectors, colored red, orange, yellow, green, blue, and purple, in circular order. Three of the colors can be obtained by blending the colors in the two neighboring sectors. One might wonder: is there a color wheel in which all six of the sections have this property, without all the sections being the same color? We show that the answer is no, not just for the 6-cycle but for any finite connected graph; indeed, for any finite, strongly connected, edge-weighted digraph. The result generalizes the ``harmonic lemma" for graphs, replacing the well-behaved averaging function by paint blending, about which almost nothing is assumed. Our proof makes use of a Markov chain stopping rule.

math.CO↗