Related papers: Amending the Lonely Runner Spectrum Conjecture

At first blush, what appears to be a purely physical question to measure any velocity: how to measure the velocity on a one-way trip? However, due to the debates of the clock-synchronization and the successes of Special Relativity (SR),…

We solve the problem of estimating the distribution of presumed i.i.d. observations for the total variation loss. Our approach is based on density models and is versatile enough to cope with many different ones, including some density…

The present work aims to search for an implementation of a new symmetry in the space-time by introducing the idea of an invariant minimum speed scale ($V$). Such a lowest limit $V$, being unattainable by the particles, represents a…

In 1990, Cvetkovi\'{c} and Rowlinson [The largest eigenvalue of a graph: a survey, Linear Multilinear Algebra 28(1-2) (1990), 3--33] conjectured that among all outerplanar graphs on $n$ vertices, $K_1\vee P_{n-1}$ attains the maximum…

The Total Colouring Conjecture suggests that $\Delta+3$ colours ought to suffice in order to provide a proper total colouring of every graph $G$ with maximum degree $\Delta$. Thus far this has been confirmed up to an additive constant…

Asadpour, Feige, and Saberi proved that the integrality gap of the configuration LP for the restricted max-min allocation problem is at most $4$. However, their proof does not give a polynomial-time approximation algorithm. A lot of efforts…

Given a sequence of $n$ real numbers $\{S_i\}_{i\leq n}$, we consider the longest weakly increasing subsequence, namely $i_1<i_2<\dots <i_L$ with $S_{i_k} \leq S_{i_{k+1}}$ and $L$ maximal. When the elements $S_i$ are i.i.d. uniform random…

We define a new metric between natural numbers induced by the $\ell_\infty$ norm of their unique prime signatures. In this space, we look at the natural analog of the number line and study the arithmetic function $L_\infty(N)$, which…

Let $G_n$ be an $n \times n$ matrix with real i.i.d. $N(0,1/n)$ entries, let $A$ be a real $n \times n$ matrix with $\Vert A \Vert \le 1$, and let $\gamma \in (0,1)$. We show that with probability $0.99$, $A + \gamma G_n$ has all of its…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

Let $G$ be a graph on $n$ vertices of maximum degree $\Delta$. We show that, for any $\delta > 0$, the down-up walk on independent sets of size $k \leq (1-\delta)\alpha_c(\Delta)n$ mixes in time $O_{\Delta,\delta}(k\log{n})$, thereby…

We study the gaps between consecutive singular values of random rectangular matrices. Specifically, if $M$ is an $n \times p$ random matrix with independent and identically distributed entries and $\Sigma$ is a $n \times n$ deterministic…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

Let $\mu$ be a probability measure on $\rr^n$ ($n \geq 2$) with Lebesgue density proportional to $e^{-V (\Vert x\Vert )}$, where $V : \rr_+ \to \rr$ is a smooth convex potential. We show that the associated spectral gap in $L^2 (\mu)$ lies…

A well-known conjecture states that a random symmetric $n \times n$ matrix with entries in $\{-1,1\}$ is singular with probability $\Theta\big( n^2 2^{-n} \big)$. In this paper we prove that the probability of this event is at most…

In this paper we study the probability that a $d$ dimensional simple random walk (or the first $L$ steps of it) covers each point in a nearest neighbor path connecting 0 and the boundary of an $L_1$ ball. We show that among all such paths,…

We consider a random walk X_n in Z_+, starting at X_0=x>= 0, with transition probabilities P(X_{n+1}=X_n+1|X_n=y>=1)=1/2-\delta/(4y+2\delta) P(X_{n+1}=X_n+1|X_n=y>=1)=1/2+\delta/(4y+2\delta) and X_{n+1}=1 whenever X_n=0. We prove that the…

Given a hypergraph $H$ and a weight function $w: V \rightarrow \{1, \dots, M\}$ on its vertices, we say that $w$ is isolating if there is exactly one edge of minimum weight $w(e) = \sum_{i \in e} w(i)$. The Isolation Lemma is a…

The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to decide whether the Hamming distance between their $n$-bit…

In this work, the relativistic phenomena of Lorentz contraction and time dilation are derived using a modified distance formula appropriate for discrete space. This new distance formula is different than Pythagoras's theorem but converges…