MathOverflow

Two players Alice and Biboo play the following game - both are dealt uniformly and independently at random a number from $[0, 1]$, and each player can see only their own number. Players take turns alternatingly, with Alice moving first.
On her first round, Alice may choose one of two moves - fight or draw. If fight is chosen, both players compare their current number and the game ends, with the higher number winning. If draw is chosen, Alice draws another number from $[0, 1]$ independently...

I am investigating a second-order recurrence defined over finite subsets of $\mathbb{N}$ that alternates between bitwise logic and standard arithmetic.I am seeking a way to compute the $m$-th term $S_m$ without iterating through every preceding step...

In "The Structure of Countable Boolean Algebras" (DOI), Ketonen [1978] the author constructs two invariants, the rank $r(X)$ and kernel size $n(X)$. My understanding is that one uses transfinite induction by stripping away isolated points from the underlying...

Let $\Sigma$ be a closed oriented topological surface of genus $g\geq 2$, and let $\mathfrak{X}_n$ denote the $\mathrm{SL}_n$-character variety of $\pi_1(\Sigma)$, i.e.$$\mathfrak{X}_n= \mathrm{Hom}(\pi_1(\Sigma), \mathrm{SL}_n)//\mathrm{SL}_n.$$So each...