Related papers: Size sensitive packing number for Hamming cube and…
As part of a larger program aimed at better quantifying the uncertainties in stellar computations, we attempt to calibrate the extent of convective overshooting in low to intermediate mass stars by means of eclipsing binary systems. We…
The random packing fraction of binary particles in D-dimensional Euclidean space R^D is studied using a geometric approach. First, the binary packing fraction of assemblies with small size difference are studied, using the excluded volume…
It has been recently pointed out by Farr and Groot (arXiv:0912.0852) and by Kyrylyuk and Philipse (Prog. Colloid Polym. Sci., 2010, in press) that our theoretical result for the jamming density of a binary mixture of hard spheres…
Higher-order exceptional points (EPs) in optical structures enable ultra-sensitive responses to perturbations. However, previous investigations on higher-order EPs have predominantly focused on coupled systems, leaving their fundamental…
Random sequential addition (RSA) time-dependent packing process, in which congruent hard hyperspheres are randomly and sequentially placed into a system without interparticle overlap, is a useful packing model to study disorder in high…
We investigate the impact of modifying the constraining relations of a Constraint Satisfaction Problem (CSP) instance, with a fixed template, on the set of solutions of the instance. More precisely we investigate sensitive instances: an…
Due to significant computational expense, discrete element method simulations of jammed packings of size-dispersed spheres with size ratios greater than 1:10 have remained elusive, limiting the correspondence between simulations and…
We give a sharp Hausdorff content estimate for the size of the accessible boundary of any domain in a metric measure space of controlled geometry, i.e., a complete metric space equipped with a doubling measure supporting a $p$-Poincar\'e…
After having introduced the notion of universality in statistical mechanics and its importance for our comprehension of the macroscopic behavior of interacting systems, I review recent progress in the understanding of the scaling limit of…
Sphere packings in high dimensions interest mathematicians and physicists and have direct applications in communications theory. Remarkably, no one has been able to provide exponential improvement on a 100-year-old lower bound on the…
Although there is now a good measure of agreement between Monte Carlo and high-temperature series expansion estimates for Ising ($n=1$) models, published results for the critical temperature from series expansions up to 12{\em th} order for…
We prove explicit stability estimates for the sphere packing problem in dimensions 8 and 24, showing that, in the lattice case, if a lattice is $\sim \varepsilon$ close to satisfying the optimal density, then it is, in a suitable sense,…
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
After the observation in 2012 of a new scalar particle closely resembling the Higgs boson of the Standard Model of particle physics, there is a general consensus that there must be Physics Beyond the Standard Model, with present experiments…
Inverse medium scattering problems arise in many applications, but in practice, the measurement data are often restricted to a limited aperture by physical or experimental constraints. Classical sampling methods, such as MUSIC and the…
In this third and final paper of a series, elastic properties of numerically simulated isotropic packings of spherical beads assembled by different procedures and subjected to a varying confining pressure P are investigated. In addition P,…
We make progress on two interrelated problems at the intersection of geometric measure theory, additive combinatorics and harmonic analysis: the discretised sum-product problem, and the dimension of Furstenberg sets. Along the way, we…
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…
We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere…
We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…