Related papers: A Unified Framework for High-Dimensional Pure Root…
We study the physics of a single discrete gravitational extra dimension using the effective field theory for massive gravitons. We first consider a minimal discretization with 4D gravitons on the sites and nearest neighbor hopping terms. At…
We study the Hard Core Model on the graphs ${\rm {\bf \scriptstyle G}}$ obtained from Archimedean tilings i.e. configurations in $\scriptstyle \{0,1\}^{{\rm {\bf G}}}$ with the nearest neighbor 1's forbidden. Our particular aim in choosing…
String theory has strong implications for cosmology: it tells us that we cannot have a cosmological constant, that single-field slow-roll inflation is ruled out, and that black holes decay. We elucidate the origin of these statements within…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
The problem of finding short vectors in Euclidean lattices is a central hard problem in complexity theory. The case of module lattices (i.e., lattices which are also modules over a number ring) is of particular interest for cryptography and…
We present a unified framework for the study of late time cosmic acceleration. Using methods of effective field theory, we show that existing proposals for late time acceleration can be subsumed in a single framework, rather than many…
The recently introduced consistent discrete lattice formulation of canonical general relativity produces a discrete theory that is constraint-free. This immediately allows to overcome several of the traditional obstacles posed by the…
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with applications in collaborative filtering, computer vision and…
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…
Lattice QCD has become a crucial tool for studying hadron-hadron interactions from first principles. However, significant challenges arise when extracting infinite-volume scattering parameters from finite-volume energy levels using the…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
Quantum theory, general relativity, the standard model of particle physics, and the $\Lambda$CDM model of cosmology have all been spectacularly successful within their respective regimes of applicability, but many central problems remain…
The one-point probability distribution function (pdf) of the large-scale density field is an important tool to follow the evolution of cosmological structures. In this paper we present a new model for this pdf for all regimes and all…
A classical problem in matrix computations is the efficient and reliable approximation of a given matrix by a matrix of lower rank. The truncated singular value decomposition (SVD) is known to provide the best such approximation for any…
Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at least $k$ vertices is considered long. When $k \le 3$, the…
The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…
This paper presents a general formalism that allows the derivation of the cumulant generating function and one-point Probability Distribution Function (PDF) of the aperture mass ($\hat{M}_{ap}$), a common observable for cosmic shear…
In this paper we introduce Sampling with a Black Box, a generic technique for the design of parameterized approximation algorithms for vertex deletion problems (e.g., Vertex Cover, Feedback Vertex Set, etc.). The technique relies on two…
In scalar-vector-tensor (SVT) theories with parity invariance, we perform a gauge-ready formulation of cosmological perturbations on the flat Friedmann-Lema\^{i}tre-Robertson-Walker (FLRW) background by taking into account a matter perfect…
We develop a novel statistical strong lensing approach to probe the cosmological parameters by exploiting multiple redshift image systems behind galaxies or galaxy clusters. The method relies on free-form mass inversion of strong lenses and…