Related papers: Hypercubes are determined by their distance spectr…
We demonstrate the homogeneity of the Hilbert Cube. In particular, we construct explicit self-homeomorphisms of the Hilbert cube so that given any two points, a homeomorphism moving one to the other may be realized.
We give the characteristic polynomial of the distance or adjacency matrix of the strong power graph of a finite group, and compute its distance and adjacency spectrum.
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
A proposed strategy for determining the deceleration parameter entails measuring the deviation from a linear (Hubble) distance-red shift relation. However, even at moderate red shifts, z > 0.2, the deviation does not depend on q_0 alone,…
In the first paper of this series [S. Torquato, J. Chem. Phys. {\bf 136}, 054106 (2012)], analytical results concerning the continuum percolation of overlapping hyperparticles in $d$-dimensional Euclidean space $\mathbb{R}^d$ were obtained,…
We investigate how effectively finite metric spaces can be distinguished by distance-based invariants. As model spaces, we consider regular polygons, cycle graphs, and their generalization, circular metric spaces, and as invariants we…
The primary objective of this paper is to generalize the results of [arXiv:2111.03548] to the case of quasi-smooth Berkovich curves by establishing a connection between the spectrum and the radii of convergence. To achieve this, we…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…
For a graph $G$, its \emph{cubicity} $cub(G)$ is the minimum dimension $k$ such that $G$ is representable as the intersection graph of (axis--parallel) cubes in $k$--dimensional space. Chandran, Mannino and Oriolo showed that for a…
In any dimension d>=2, we give exact volume formulas of two mutually polar dual convex d--polytopes. The primal body is called isocanted cube of dimension d, depending on two real parameters 0<a<l. The limit case a=0 yields a d--cube of…
Based on work presented in [4], we define $S^2$-Upper Triangular Matrices and $S^2$-Lower Triangular Matrices, two special types of $d\times d(2d-1)$ matrices generalizing Upper and Lower Triangular Matrices, respectively. Then, we show…
We count the number of holomorphic orbi-spheres in the $\mathbb{Z}_2$-quotient of an elliptic curve. We first prove that there is an explicit correspondence between the holomorphic orbi-spheres and the sublattices of $\mathbb{Z} \oplus…
Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and…
A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance…
In this paper, we consider the distance spectra of the derangement graphs. First we give a constructive proof that the connected derangement graphs are of diameter 2. Then we obtain their distance spectra. In particular, we determine all…
Let a finite set of points $\{\xi_1,...,\xi_k\}$ be chosen in a metric space $(X,d)$, and let the squared distance matrix $\mathfrak{D}=(\mathfrak{D}(\xi_i,\xi_j)^2)_{i,j=1}^{k}$ be constructed from them. We propose a geometric approach to…
We establish the spectral gap property for dense subgroups of $SU(d)$ ($d\geq 2$), generated by finitely many elements with algebraic entries; this result was announced in [BG3]. The method of proof differs, in several crucial aspects, from…
Given an integer $1\leq j <n$, define the $(j)$-coloring of a $n$-dimensional hypercube $H_{n}$ to be the $2$-coloring of the edges of $H_{n}$ in which all edges in dimension $i$, $1\leq i \leq j$, have color $1$ and all other edges have…
We study tetrahedra and the space of tetrahedra from the viewpoint of local and global maxima for intrinsic distance functions.