449 research outputs found
Group field theories for all loop quantum gravity
Group field theories represent a 2nd quantized reformulation of the loop
quantum gravity state space and a completion of the spin foam formalism. States
of the canonical theory, in the traditional continuum setting, have support on
graphs of arbitrary valence. On the other hand, group field theories have
usually been defined in a simplicial context, thus dealing with a restricted
set of graphs. In this paper, we generalize the combinatorics of group field
theories to cover all the loop quantum gravity state space. As an explicit
example, we describe the GFT formulation of the KKL spin foam model, as well as
a particular modified version. We show that the use of tensor model tools
allows for the most effective construction. In order to clarify the
mathematical basis of our construction and of the formalisms with which we
deal, we also give an exhaustive description of the combinatorial structures
entering spin foam models and group field theories, both at the level of the
boundary states and of the quantum amplitudes.Comment: version published in New Journal of Physic
On Range Searching with Semialgebraic Sets II
Let be a set of points in . We present a linear-size data
structure for answering range queries on with constant-complexity
semialgebraic sets as ranges, in time close to . It essentially
matches the performance of similar structures for simplex range searching, and,
for , significantly improves earlier solutions by the first two authors
obtained in~1994. This almost settles a long-standing open problem in range
searching.
The data structure is based on the polynomial-partitioning technique of Guth
and Katz [arXiv:1011.4105], which shows that for a parameter , , there exists a -variate polynomial of degree such that
each connected component of contains at most points
of , where is the zero set of . We present an efficient randomized
algorithm for computing such a polynomial partition, which is of independent
interest and is likely to have additional applications
Unit Distances in Three Dimensions
We show that the number of unit distances determined by n points in R^3 is
O(n^{3/2}), slightly improving the bound of Clarkson et al. established in
1990. The new proof uses the recently introduced polynomial partitioning
technique of Guth and Katz [arXiv:1011.4105]. While this paper was still in a
draft stage, a similar proof of our main result was posted to the arXiv by
Joshua Zahl [arXiv:1104.4987].Comment: 13 page
- …