Related papers: Two-dimensional badly approximable vectors and Sch…

Tight $2 s$-designs are the $2 s$-$(v, k, \lambda)$ designs whose sizes achieve the Fisher type lower bound ${v \choose s}$. Symmetric $2$-designs, the Witt $4$-$(23, 7, 1)$ design and the Witt $4$-$(23, 16, 52)$ design are tight designs.…

Subtraction games are played with one or more heaps of tokens, with players taking turns removing from a single heap a number of tokens belonging to a specified subtraction set; the last player to move wins. We describe how to compute the…

We formulate a conjecture from graph theory that is equivalent to Nash-solvability of the finite two-person shortest path games with positive local costs. For the three-person games such conjecture fails.

It is well known due to Jarnik that the set Bad of badly approximable numbers is of Hausdorff-dimension one. If Bad(c) denotes the subset of x in Bad for which the approximation constant c > c(x), then Jarnik was in fact more precise and…

We prove an analogue of Bonami's (hypercontractive) lemma for complex-valued functions on $\mathcal{L}(V,W)$, where $V$ and $W$ are vector spaces over a finite field. This inequality is useful for functions on $\mathcal{L}(V,W)$ whose…

Let $\textrm{Mat}_2(\mathbb{R})$ be the set of $2 \times 2$ matrices with real entries. For any $\varepsilon>0$ and any finitely--supported probability measure $\mu$ on $\textrm{Mat}_2(\mathbb{R})$, we prove that either \[ T(\mu) = \sum_{X,…

Consider the polynomial $tr (A + tB)^m$ in $t$ for positive hermitian matrices $A$ and $B$ with $m \in \N$. The Bessis-Moussa-Villani conjecture (in the equivalent form of Lieb and Seiringer) states that this polynomial has nonnegative…

We prove a generalized version of Schmidt's subspace theorem for closed subschemes in general position in terms of suitably defined Seshadri constants with respect to a fixed ample divisor. Our proof builds on previous work by Evertse and…

Let $a$ and $b$ be relatively prime positive integers. In this paper the weighted sum $\sum_{n\in{\rm NR}(a,b)}\lambda^{n-1}n^m$ is given explicitly or in terms of the Apostol-Bernoulli numbers, where $m$ is a nonnegative integer, and ${\rm…

In this paper we study continuous-time two-player zero-sum optimal switching games on a finite horizon. Using the theory of doubly reflected BSDEs with interconnected barriers, we show that this game has a value and an equilibrium in the…

Many things in mathematics seem lamost unreasonably nice. This includes objects, counterexamples, proofs. In this preprint I discuss many examples of this phenomenon with emphasis on the ring of polynomials in a countably infinite number of…

A simple game $(N,v)$ is given by a set $N$ of $n$ players and a partition of $2^N$ into a set $\mathcal{L}$ of losing coalitions $L$ with value $v(L)=0$ that is closed under taking subsets and a set $\mathcal{W}$ of winning coalitions $W$…

Let $d\geq 2$ and $k\geq 1$ be fixed. We prove that, for every $\epsilon>0$ and every real $\beta$, there exist integers $1\leq b_1,\ldots,b_k\leq N$ such that \[ \left\|\sum_{j=1}^k b_j^{1/d}-\beta\right\| \ll_{d,k,\epsilon}…

We prove a number field analogue of W. M. Schmidt's conjecture on the intersection of weighted badly approximable vectors and use this to prove an instance of a conjecture of An, Guan and Kleinbock. Namely, let $G := SL_2(\mathbb{R}) \times…

In this paper we show some remarkable consequences of the method which proves that every bisymmetric, symmetric, reflexive, strictly monotonic binary map on a proper interval is continuous, in particular it is a quasi-arithmetic mean. Now…

We prove that every two-player nonzero-sum stopping game in discrete time admits an \epsilon-equilibrium in randomized strategies for every \epsilon >0. We use a stochastic variation of Ramsey's theorem, which enables us to reduce the…

Let C be two times continuously differentiable curve in R^2 with at least one point at which the curvature is non-zero. For any i,j > 0 with i+j =1, let Bad(i,j) denote the set of points (x,y) in R^2 for which max {||qx ||^{1/i},…

On a filtered probability space $(\Omega ,\mathcal{F}, (\mathcal{F}_t)_{t\in[0,\infty]}, \mathbb{P})$, we consider the two-player non-zero-sum stopping game $u^i := \mathbb{E}[U^i(\rho,\tau)],\ i=1,2$, where the first player choose a…

Determining a Nash equilibrium in a $2$-player non-zero sum game is known to be PPAD-hard (Chen and Deng (2006), Chen, Deng and Teng (2009)). The problem, even when restricted to win-lose bimatrix games, remains PPAD-hard (Abbott, Kane and…

We give a combinatorial proof that the product of a Schubert polynomial by a Schur polynomial is a nonnegative sum of Schubert polynomials. Our proof uses Assaf's theory of dual equivalence to show that a quasisymmetric function of Bergeron…