Related papers: Badly approximable $S$-numbers and absolute Schmid…

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

Let us define, for a compact set $A \subset \mathbb{R}^n$, the Minkowski averages of $A$: $$ A(k) = \left\{\frac{a_1+\cdots +a_k}{k} : a_1, \ldots, a_k\in A\right\}=\frac{1}{k}\Big(\underset{k\ {\rm times}}{\underbrace{A + \cdots +…

We discuss a universal algebraic approach to quasi-exactly solvable models which allows us to interpret them as constrained Hamiltonian systems with a finite number of physical states. Using this approach we reproduce well-known…

We obtain a general concept of triplet of Hilbert spaces with closed (unbounded) embeddings instead of continuous (bounded) ones. The construction starts with a positive selfadjoint operator $H$, that is called the Hamiltonian of the…

Given a frequency $\lambda$, we study general Dirichlet series $\sum a_n e^{-\lambda_n s}$. First, we give a new condition on $\lambda$ which ensures that a somewhere convergent Dirichlet series defining a bounded holomorphic function in…

For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max…

We show that every henselian valued field $L$ of residue characteristic 0 admits a proper subfield $K$ which is dense in $L$. We present conditions under which this can be taken such that $L|K$ is transcendental and $K$ is henselian. These…

In this paper we explore questions regarding the Minkowski sum of the boundaries of convex sets. Motivated by a question suggested to us by V.~Milman regarding the volume of $\partial K+ \partial T$ where $K$ and $T$ are convex bodies, we…

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…

All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…

In this article we classify totally geodesic submanifolds in arbitrary products of rank one symmetric spaces. Furthermore, we give infinitely many examples of irreducible totally geodesic submanifolds in Hermitian symmetric spaces with…

We consider a family of non-commutative 4d Minkowski spaces with the signature (1,3) and two types of spaces with the signature (2,2). The Minkowski spaces are defined by the common reflection equation and differ in anti-involutions. There…

The main purpose of the paper is to establish a closedness theorem over Henselian valued fields $K$ of equicharacteristic zero (not necessarily algebraically closed) with separated analytic structure. It says that every projection with a…

Recent findings by Jahn, T. Ullrich, Voigtlaender [10] relate non-linear sampling numbers for the square norm to quantities involving trigonometric best $m-$term approximation errors in the uniform norm. Here we establish new results for…

The classical Artin--Whaples approximation theorem allows to simultaneously approximate finitely many different elements of a field with respect to finitely many pairwise inequivalent absolute values. Several variants and generalizations…

Given a set A of non-negative integers and a set B of positive integers,we are interested in computing all sets C (of positive integers) that are minimal in the family of sets K (of positive integers) such that (i) K contains no elements…

Let X be a smooth projective Berkovich space over a complete discrete valuation field K of residue characteristic zero, endowed with an ample line bundle L. We introduce a general notion of (possibly singular) semipositive (or…

We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within…

In this paper we develop a general framework of badly approximable points in a metric space $X$ equipped with a $\sigma$-finite doubling Borel regular measure $\mu$. We establish that under mild assumptions the $\mu$-measure of the set of…

We prove that computing an $\epsilon$-approximate Nash equilibrium of a win-lose bimatrix game with constant sparsity is PPAD-hard for inverse-polynomial $\epsilon$. Our result holds for 3-sparse games, which is tight given that 2-sparse…