Related papers: Weighted badly approximable vectors and games

Let $r\ge k\ge 2$ be fixed positive integers. Let $\varrho_{r,k}$ denote the characteristic function of the set of $r$-tuples of positive integers with $k$-wise relatively prime components, that is any $k$ of them are relatively prime. We…

For any given set $A$ of nonnegative integers and for any given two positive integers $k_1,k_2$, $R_{k_1,k_2}(A,n)$ is defined as the number of solutions of the equation $n=k_1a_1+k_2a_2$ with $a_1,a_2\in A$. In this paper, we prove that if…

We prove a vertex-isoperimetric inequality for [n]^(r), the set of all r-element subsets of {1,2,...,n}, where x,y \in [n]^(r) are adjacent if |x \Delta y|=2. Namely, if \mathcal{A} \subset [n]^(r) with |\mathcal{A}|=\alpha {n \choose r},…

It is well known that in dimension one the set of Dirichlet improvable real numbers consists precisely of badly approximable and singular numbers. We show that in higher dimensions this is not the case by proving that there exist continuum…

We consider a natural filtration $\boldsymbol{\operatorname{Bad}}(\delta) \subset \boldsymbol{\operatorname{Bad}}(\delta')$ for $\delta \geq \delta'>0$ on the set of badly approximable numbers to complement the filtration of the well…

Given an integer-valued matrix $A$ of dimension $\ell \times k$ and an integer-valued vector $b$ of dimension $\ell$, the Maker-Breaker $(A,b)$-game on a set of integers $X$ is the game where Maker and Breaker take turns claiming previously…

We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent chooses a target vertex and places a configuration of…

Let $V$ be a multiset of $n$ points in $\mathbb{R}^d$, which we call voters, and let $k\geq 1$ and $\ell\geq 1$ be two given constants. We consider the following game, where two players $\mathcal{P}$ and $\mathcal{Q}$ compete over the…

In set theory without the axiom of regularity, we consider a game in which two players choose in turn an element of a given set, an element of this element, etc.; a player wins if its adversary cannot make any next move. Sets that are…

Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…

We consider an online vector balancing game where vectors $v_t$, chosen uniformly at random in $\{-1,+1\}^n$, arrive over time and a sign $x_t \in \{-1,+1\}$ must be picked immediately upon the arrival of $v_t$. The goal is to minimize the…

We prove a vector-valued almost sure invariance principle for some classes of time dependent non-uniformly distance expanding dynamical systems. The models we have in mind are certain sequential versions of the smooth non-uniformly distance…

The set A of distinct scores of the vertices of an oriented bipartite graph D(U, V) is called its score set. We consider the following question: given a finite, nonempty set A of positive integers, is there an oriented bipartite graph D(U,…

Let $v$ be an odd real polynomial (i.e. a polynomial of the form $\sum_{j=1}^\ell a_jx^{2j-1}$). We utilize sets of iterated differences to establish new results about sets of the form $\mathcal…

We study minimum integer representations of weighted games, i.e., representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if the…

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting protocol. However, in realistic settings,…

In this paper, we study the weighted $n$-dimensional badly approximable points on manifolds. Given a $C^n$ differentiable non-degenerate submanifold $\mathcal{U} \subset \mathbb{R}^n$, we will show that any countable intersection of the…

We extend classical estimates for the vector balancing constant of $\mathbb{R}^d$ equipped with the Euclidean and the maximum norms proved in the 1980's by showing that for $p =2$ and $p=\infty$, given vector families $V_1, \ldots, V_n…

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 that the Hausdorff dimension of the set of badly approximable systems of m linear forms in n variables over the field of Laurent series with coefficients from a finite field is maximal. This is a analogue of Schmidt's…