Fast Scalable Construction of (Minimal Perfect Hash) Functions

Recent advances in random linear systems on finite fields have paved the way for the construction of constant-time data structures representing static functions and minimal perfect hash functions using less space with respect to existing techniques. The main obstruction for any practical application of these results is the cubic-time Gaussian elimination required to solve these linear systems: despite they can be made very small, the computation is still too slow to be feasible. In this paper we describe in detail a number of heuristics and programming techniques to speed up the resolution of these systems by several orders of magnitude, making the overall construction competitive with the standard and widely used MWHC technique, which is based on hypergraph peeling. In particular, we introduce broadword programming techniques for fast equation manipulation and a lazy Gaussian elimination algorithm. We also describe a number of technical improvements to the data structure which further reduce space usage and improve lookup speed. Our implementation of these techniques yields a minimal perfect hash function data structure occupying 2.24 bits per element, compared to 2.68 for MWHC-based ones, and a static function data structure which reduces the multiplicative overhead from 1.23 to 1.03

Evidence for the classical integrability of the complete AdS(4) x CP(3) superstring

We construct a zero-curvature Lax connection in a sub-sector of the superstring theory on AdS(4) x CP(3) which is not described by the OSp(6|4)/U(3) x SO(1,3) supercoset sigma-model. In this sub-sector worldsheet fermions associated to eight broken supersymmetries of the type IIA background are physical fields. As such, the prescription for the construction of the Lax connection based on the Z_4-automorphism of the isometry superalgebra OSp(6|4) does not do the job. So, to construct the Lax connection we have used an alternative method which nevertheless relies on the isometry of the target superspace and kappa-symmetry of the Green-Schwarz superstring.Comment: 1+26 pages; v2: minor typos corrected, acknowledgements adde

Slide reduction, revisited—filling the gaps in svp approximation

We show how to generalize Gama and Nguyen's slide reduction algorithm [STOC '08] for solving the approximate Shortest Vector Problem over lattices (SVP). As a result, we show the fastest provably correct algorithm for $\delta$-approximate SVP for all approximation factors $n^{1/2+\varepsilon} \leq \delta \leq n^{O(1)}$. This is the range of approximation factors most relevant for cryptography

Counting and effective rigidity in algebra and geometry

The purpose of this article is to produce effective versions of some rigidity results in algebra and geometry. On the geometric side, we focus on the spectrum of primitive geodesic lengths (resp., complex lengths) for arithmetic hyperbolic 2-manifolds (resp., 3-manifolds). By work of Reid, this spectrum determines the commensurability class of the 2-manifold (resp., 3-manifold). We establish effective versions of these rigidity results by ensuring that, for two incommensurable arithmetic manifolds of bounded volume, the length sets (resp., the complex length sets) must disagree for a length that can be explicitly bounded as a function of volume. We also prove an effective version of a similar rigidity result established by the second author with Reid on a surface analog of the length spectrum for hyperbolic 3-manifolds. These effective results have corresponding algebraic analogs involving maximal subfields and quaternion subalgebras of quaternion algebras. To prove these effective rigidity results, we establish results on the asymptotic behavior of certain algebraic and geometric counting functions which are of independent interest.Comment: v.2, 39 pages. To appear in Invent. Mat

The split property for quantum field theories in flat and curved spacetimes

The split property expresses a strong form of independence of spacelike separated regions in algebraic quantum field theory. In Minkowski spacetime, it can be proved under hypotheses of nuclearity. An expository account is given of nuclearity and the split property, and connections are drawn to the theory of quantum energy inequalities. In addition, a recent proof of the split property for quantum field theory in curved spacetimes is outlined, emphasising the essential ideas

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics

International audienceThere exists a wealth of literature concerning families of increasing trees, particularly suitable for representing the evolution of either data structures in computer science, or probabilistic urns in mathematics, but are also adapted to model evolutionary trees in biology. The classical notion of increasing trees corresponds to labeled trees such that, along paths from the root to any leaf, node labels are strictly increasing; in addition nodes have distinct labels. In this paper we introduce new families of increasingly labeled trees relaxing the constraint of unicity of each label. Such models are especially useful to characterize processes evolving in discrete time whose nodes evolve simultaneously. In particular, we obtain growth processes for biology much more adequate than the previous increasing models. The families of monotonic trees we introduce are much more delicate to deal with, since they are not decomposable in the sense of Analytic Combinatorics. New tools are required to study the quantitative statistics of such families. In this paper, we first present a way to combinatorially specify such families through evolution processes, then, we study the tree enumerations