Related papers: Amending the Lonely Runner Spectrum Conjecture

The varying speed of light (VSL) theory is controversial. It succeeds in explaining some cosmological problems, but on the other hand it is excluded by mainstream physics because it will shake the foundation of physics. In the present…

Motivated by the search for a counterexample to the Poincar\'e conjecture in three and four dimensions, the Andrews-Curtis conjecture was proposed in 1965. It is now generally suspected that the Andrews-Curtis conjecture is false, but small…

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…

A major recent evelopment in observational cosmology has been an accurate measurement of the luminosity distance-redshift relation out to redshifts z=0.8 from Type Ia supernova standard candles. The results have been argued as evidence for…

We show that in the Lorentz mirror model, at any density of mirrors, the probability of a particle starting at the origin to reach distance n is at least 1/(2n+1).

Fix integers $d \geq 2$ and $k\geq d-1$. Consider a random walk $X_0, X_1, \ldots$ in $\mathbb{R}^d$ in which, given $X_0, X_1, \ldots, X_n$ ($n \geq k$), the next step $X_{n+1}$ is uniformly distributed on the unit ball centred at $X_n$,…

Let $A \in \mathbb{R}^{n \times (n - d)}$ be a random matrix with independent uniformly anti-concentrated entries satisfying $\mathbb{E}\lvert A\rvert_{HS}^2 \leq Kn(n-d)$ and let $H$ be the subspace spanned by the columns of $A$. Let $X…

We prove that for each positive integer $N$ the set of smooth, zero degree maps $\psi\colon\mathbb{S}^2\to \mathbb{S}^2$ which have the following three properties: (1) there is a unique minimizing harmonic map $u\colon \mathbb{B}^3\to…

The Swampland Distance Conjecture (SDC) restricts the geodesic distances that scalars can traverse in effective field theories as they approach points at infinite distance in moduli space. We propose that, when applied to the subset of…

This paper presents a novel approach to visual tracking: Similarity Matching Ratio (SMR). The traditional approach of tracking is minimizing some measures of the difference between the template and a patch from the frame. This approach is…

The spectral excess theorem states that, in a regular graph G, the average excess, which is the mean of the numbers of vertices at maximum distance from a vertex, is bounded above by the spectral excess (a number that is computed by using…

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

In 2010, Mkrtchyan, Petrosyan and Vardanyan proved that every graph $G$ with $2\leq \delta(G)\leq \Delta(G)\leq 3$ contains a maximum matching whose unsaturated vertices do not have a common neighbor, where $\Delta(G)$ and $\delta(G)$…

Answering a question by Angel, Holroyd, Martin, Wilson and Winkler, we show that the maximal number of non-colliding coupled simple random walks on the complete graph $K_N$, which take turns, moving one at a time, is monotone in $N$. We use…

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1+o(1)) \frac{3n^2}{2\pi^2}$. This conjecture can be rephrased in terms of the spectral gap as follows: the…

A central problem in Binary Hypothesis Testing (BHT) is to determine the optimal tradeoff between the Type I error (referred to as false alarm) and Type II (referred to as miss) error. In this context, the exponential rate of convergence of…

We show that every matrix $A \in \mathbb{R}^{n\times n}$ is at least $\delta$$\|A\|$-close to a real matrix $A+E \in \mathbb{R}^{n\times n}$ whose eigenvectors have condition number at most $\tilde{O}_{n}(\delta^{-1})$. In fact, we prove…

By assigning a probability measure via the spectrum of the normalized Laplacian to each graph and using L^p Wasserstein distances between probability measures, we define the corresponding spectral distances d_p on the set of all graphs.…

Collision avoidance is an interesting feature of the Cucker-Smale (CS) model of flocking that has been studied in many works, e.g. [1, 2, 4, 6, 7, 20, 21, 22]. In particular, in the case of singular interactions between agents, as is the…

We prove that there is a matching between 2 intervals of positive integers of the same even length, with corresponding pairs coprime, provided the intervals are in $[n]$ and their lengths are $>c(\log n)^2$, for a positive constant $c$.…