Bubble divergences: sorting out topology from cell structure

We conclude our analysis of bubble divergences in the flat spinfoam model. In [arXiv:1008.1476] we showed that the divergence degree of an arbitrary two-complex Gamma can be evaluated exactly by means of twisted cohomology. Here, we specialize this result to the case where Gamma is the two-skeleton of the cell decomposition of a pseudomanifold, and sharpen it with a careful analysis of the cellular and topological structures involved. Moreover, we explain in detail how this approach reproduces all the previous powercounting results for the Boulatov-Ooguri (colored) tensor models, and sheds light on algebraic-topological aspects of Gurau's 1/N expansion.Comment: 19 page

Regular Languages meet Prefix Sorting

Indexing strings via prefix (or suffix) sorting is, arguably, one of the most successful algorithmic techniques developed in the last decades. Can indexing be extended to languages? The main contribution of this paper is to initiate the study of the sub-class of regular languages accepted by an automaton whose states can be prefix-sorted. Starting from the recent notion of Wheeler graph [Gagie et al., TCS 2017]-which extends naturally the concept of prefix sorting to labeled graphs-we investigate the properties of Wheeler languages, that is, regular languages admitting an accepting Wheeler finite automaton. Interestingly, we characterize this family as the natural extension of regular languages endowed with the co-lexicographic ordering: when sorted, the strings belonging to a Wheeler language are partitioned into a finite number of co-lexicographic intervals, each formed by elements from a single Myhill-Nerode equivalence class. Moreover: (i) We show that every Wheeler NFA (WNFA) with $n$ states admits an equivalent Wheeler DFA (WDFA) with at most $2n-1-|\Sigma|$ states that can be computed in $O(n^3)$ time. This is in sharp contrast with general NFAs. (ii) We describe a quadratic algorithm to prefix-sort a proper superset of the WDFAs, a $O(n\log n)$-time online algorithm to sort acyclic WDFAs, and an optimal linear-time offline algorithm to sort general WDFAs. By contribution (i), our algorithms can also be used to index any WNFA at the moderate price of doubling the automaton's size. (iii) We provide a minimization theorem that characterizes the smallest WDFA recognizing the same language of any input WDFA. The corresponding constructive algorithm runs in optimal linear time in the acyclic case, and in $O(n\log n)$ time in the general case. (iv) We show how to compute the smallest WDFA equivalent to any acyclic DFA in nearly-optimal time.Comment: added minimization theorems; uploaded submitted version; New version with new results (W-MH theorem, linear determinization), added author: Giovanna D'Agostin

Holographic optical trapping

Holographic optical tweezers use computer-generated holograms to create arbitrary three-dimensional configurations of single-beam optical traps useful for capturing, moving and transforming mesoscopic objects. Through a combination of beam-splitting, mode forming, and adaptive wavefront correction, holographic traps can exert precisely specified and characterized forces and torques on objects ranging in size from a few nanometers to hundreds of micrometers. With nanometer-scale spatial resolution and real-time reconfigurability, holographic optical traps offer extraordinary access to the microscopic world and already have found applications in fundamental research and industrial applications.Comment: 8 pages, 7 figures, invited contribution to Applied Optics focus issue on Digital Holograph