Related papers: The structure of Lonely Runner spectra

We define a (pseudo-)distance between graphs based on the spectrum of the normalized Laplacian, which is easy to compute or to estimate numerically. It can therefore serve as a rough classification of large empirical graphs into families…

In this paper using a transform defined by the translation operator we introduce the concept of spectrum of sequences that are bounded by $n^\nu$, where $\nu$ is a natural number. We apply this spectral theory to study the asymptotic…

Let $A$ be a $n\times n$ complex Hermitian matrix and let $\lambda(A)=(\lambda_1,\ldots,\lambda_n)\in \mathbb{R}^n$ denote the eigenvalues of $A$, counting multiplicities and arranged in non-increasing order. Motivated by problems arising…

A digraph with self-loops $D_S$ with vertex set $\mathcal{V}$ is a simple digraph with a self-loop attached at every vertex in $S \subset \mathcal{V}.$ In this paper, we study the energy $E(D_S)$ of $D_S$ and its properties, which extend…

Let $L_{a,b}$ be a line in the Euclidean plane with slope $a$ and intercept $b$. The dimension spectrum $\spec(L_{a,b})$ is the set of all effective dimensions of individual points on $L_{a,b}$. The dimension spectrum conjecture states…

We prove that the lonely runner conjecture holds for eight runners. Our proof relies on a computer verification and on recent results that allow bounding the size of a minimal counterexample. We note that our approach also applies to the…

The distance matrix $\mathcal{D}(G)$ of a graph $G$ is the matrix containing the pairwise distances between vertices. The transmission of a vertex $v_i$ in $G$ is the sum of the distances from $v_i$ to all other vertices and $T(G)$ is the…

We extend previous lists by numerically computing approximations to many L-functions of degree $d=3$, conductor $N=1$, and small spectral parameters. We sketch how previous arguments extend to say that for very small spectral parameters…

The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…

We consider an ensemble of $N$ discrete nonintersecting paths starting from equidistant points and ending at consecutive integers. Our first result is an explicit formula for the correlation kernel that allows us to analyze the process as…

We establish endoscopic and stable trace formulas whose discrete spectral terms are weighted by automorphic $L$-functions, by the use of basic functions that are incorporated into the global spectral and geometric coefficients. This is a…

Let $\mathcal{T}_n(x)$ denote the time of first visit of a point $x$ on the lattice torus $\mathbb {Z}_n^2=\mathbb{Z}^2/n\mathbb{Z}^2$ by the simple random walk. The size of the set of $\alpha$, $n$-late points $\mathcal{L}_n(\alpha…

We discuss properties of random fractals by means of a set of numbers that characterize their universal properties. This set is the generalized singularity specturm that consists of the usual spectrum of mulitfractal dimensions and the…

A crinkled subordinator is an $\ell^2$-valued random process which can be thought of as a version of the usual one-dimensional subordinator with each out of countably many jumps being in a direction orthogonal to the directions of all other…

This paper is concerned with regular approximations of spectra of singular discrete linear Hamiltonian systems with one singular endpoint. For any given self-adjoint subspace extension (SSE) of the corresponding minimal subspace, its…

Let $T$ be a tree with vertex set $\{1, \ldots, n\}$ such that each edge is assigned a nonzero weight. The squared distance matrix of $T,$ denoted by $\Delta,$ is the $n \times n$ matrix with $(i,j)$-element $d(i,j)^2,$ where $d(i,j)$ is…

We study the following generalization of Roth's theorem for 3-term arithmetic progressions. For s>1, define a nontrivial s-configuration to be a set of s(s+1)/2 integers consisting of s distinct integers x_1,...,x_s as well as all the…

Let $D$ denote the distance matrix for an $n+1$ point metric space $(X,d)$. In the case that $X$ is an unweighted metric tree, the sum of the entries in $D^{-1}$ is always equal to $2/n$. Such trees can be considered as affinely independent…

Define $S_n^k(T)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid all patterns in $T \subseteq S_m$. We enumerate $S_n^k(T)$, $T \subseteq S_3$, for all $|T| \geq 2$ and $0 \leq k \leq n$.

An achievement set of a series is a set of all its subsums. We study the properties of achievement sets of conditionally convergent series in finite dimensional spaces. The purpose of the paper is to answer some of the open problems…