Distinct spreads in vector spaces over finite fields

In this short note, we study the distribution of spreads in a point set $\mathcal{P} \subseteq \mathbb{F}_q^d$, which are analogous to angles in Euclidean space. More precisely, we prove that, for any $\varepsilon > 0$, if $|\mathcal{P}| \geq (1+\varepsilon) q^{\lceil d/2 \rceil}$, then $\mathcal{P}$ generates a positive proportion of all spreads. We show that these results are tight, in the sense that there exist sets $\mathcal{P} \subset \mathbb{F}_q^d$ of size $|\mathcal{P}| = q^{\lceil d/2 \rceil}$ that determine at most one spread

On distinct distances in homogeneous sets in the Euclidean space

A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show that a homogeneous set of $n$ points determines at least $\Omega(n^{.6091})$ distinct distances

Densest local packing diversity. II. Application to three dimensions

The densest local packings of N three-dimensional identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained for selected values of N up to N = 1054. In the predecessor to this paper [A.B. Hopkins, F.H. Stillinger and S. Torquato, Phys. Rev. E 81 041305 (2010)], we described our method for finding the putative densest packings of N spheres in d-dimensional Euclidean space Rd and presented those packings in R2 for values of N up to N = 348. We analyze the properties and characteristics of the densest local packings in R3 and employ knowledge of the Rmin(N), using methods applicable in any d, to construct both a realizability condition for pair correlation functions of sphere packings and an upper bound on the maximal density of infinite sphere packings. In R3, we find wide variability in the densest local packings, including a multitude of packing symmetries such as perfect tetrahedral and imperfect icosahedral symmetry. We compare the densest local packings of N spheres near a central sphere to minimal-energy configurations of N+1 points interacting with short-range repulsive and long-range attractive pair potentials, e.g., 12-6 Lennard-Jones, and find that they are in general completely different, a result that has possible implications for nucleation theory. We also compare the densest local packings to finite subsets of stacking variants of the densest infinite packings in R3 (the Barlow packings) and find that the densest local packings are almost always most similar, as measured by a similarity metric, to the subsets of Barlow packings with the smallest number of coordination shells measured about a single central sphere, e.g., a subset of the FCC Barlow packing. We additionally observe that the densest local packings are dominated by the spheres arranged with centers at precisely distance Rmin(N) from the fixed sphere's center.Comment: 45 pages, 18 figures, 2 table

Tropical Geometry of Phylogenetic Tree Space: A Statistical Perspective

Phylogenetic trees are the fundamental mathematical representation of evolutionary processes in biology. As data objects, they are characterized by the challenges associated with "big data," as well as the complication that their discrete geometric structure results in a non-Euclidean phylogenetic tree space, which poses computational and statistical limitations. We propose and study a novel framework to study sets of phylogenetic trees based on tropical geometry. In particular, we focus on characterizing our framework for statistical analyses of evolutionary biological processes represented by phylogenetic trees. Our setting exhibits analytic, geometric, and topological properties that are desirable for theoretical studies in probability and statistics, as well as increased computational efficiency over the current state-of-the-art. We demonstrate our approach on seasonal influenza data.Comment: 28 pages, 5 figures, 1 tabl

The random graph

Erd\H{o}s and R\'{e}nyi showed the paradoxical result that there is a unique (and highly symmetric) countably infinite random graph. This graph, and its automorphism group, form the subject of the present survey.Comment: Revised chapter for new edition of book "The Mathematics of Paul Erd\H{o}s