Related papers: Lines in Every Direction with No ee-Random Points

An equiangular tight frame (ETF) yields a type of optimal packing of lines in a Euclidean space. ETFs seem to be rare, and all known infinite families of them arise from some type of combinatorial design. In this paper, we introduce a new…

Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…

A special case of a combinatorial theorem of De Bruijn and Erdos asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvatal suggested a possible generalization of this assertion in…

A comprehensive study of periodic trajectories of billiards within ellipsoids in $d$-dimensional Euclidean space is presented. The novelty of the approach is based on a relationship established between periodic billiard trajectories and…

Proving a 2009 conjecture of Itai Benjamini, we show: For any C there is an $\varepsilon>0$ such that for any simple graph $G$ on $V$ of size $n$, and $X_0,\ldots$ an ordinary random walk on $G$, $P(\{X_0,\dots, X_{Cn}\}= V) <…

We prove that every two-player non-zero-sum Dynkin game in continuous time admits an epsilon-equilibrium in randomized stopping times. We provide a condition that ensures the existence of an epsilon-equilibrium in non-randomized stopping…

We give a complete characterization of all eternal solutions $b(x,t)$ of the KPZ fixed point satisfying the asymptotic slope condition $\lim_{|x| \to \infty} \frac{b(x,0)}{x} = 2\xi$. For fixed $\xi$, there is exactly one eternal solution…

Zone diagram is a variation on the classical concept of a Voronoi diagram. Given n sites in a metric space that compete for territory, the zone diagram is an equilibrium state in the competition. Formally it is defined as a fixed point of a…

Gaussian random fields on Euclidean spaces whose variances reach their maximum values at unique points are considered. Exact asymptotic behaviors of probabilities of large absolute maximum of theirs trajectories have been evaluated using…

In this paper we consider two-person zero-sum risk-sensitive stochastic dynamic games with Borel state and action spaces and bounded reward. The term risk-sensitive refers to the fact that instead of the usual risk neutral optimization…

We prove that in all regular robust expanders $G$ every edge is asymptotically equally likely contained in a uniformly chosen perfect matching $M$. We also show that given any fixed matching or spanning regular graph $N$ in $G$, the random…

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…

We study the problem of finding fair allocations -- EF1 and EFX -- of indivisible goods with orientations. In an orientation, every agent gets items from their own predetermined set. For EF1, we show that EF1 orientations always exist when…

For any two configurations of ordered points $p=(p_{1},...,\p_{N})$ and $q=(q_{1},...,q_{N})$ in Euclidean space $E^d$ such that $q$ is an expansion of $p$, there exists a continuous expansion from $p$ to $q$ in dimension 2d; Bezdek and…

We prove that every compact plane billiard, bounded by a smooth curve, is insecure: there exist pairs of points $A,B$ such that no finite set of points can block all billiard trajectories from $A$ to $B$.

This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players. Starting from a fixed vertex, players take turns to move a token along…

We show, assuming Schanuel's conjecture, that every irreducible complex polynomial in two variables where both variables appear has infinitely many algebraically independent solutions of the form (z,e^z).

We study two-player zero-sum stopping games in continuous time and infinite horizon. We prove that the value in randomized stopping times exists as soon as the payoff processes are right-continuous. In particular, as opposed to existing…

We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…

It is known that a gambler repeating a game with positive expected value has a positive probability to never go broke. We use the mass transport method to prove the generalization of this fact where the gains from the bets form a…