Tiling Periodicity

We contribute to combinatorics and algorithmics of words by introducing new types of periodicities in words. A tiling period of a word w is partial word u such that w can be decomposed into several disjoint parallel copies of u, e.g. a lozenge b is a tiling period of a a b b. We investigate properties of tiling periodicities and design an algorithm working in O(n log (n) log log (n)) time which finds a tiling period of minimal size, the number of such minimal periods and their compact representation. The combinatorics of tiling periods differs significantly from that for classical full periods, for example unlike the classical case the same word can have many different primitive tiling periods. We consider also a related new type of periods called in the paper multi-periods. As a side product of the paper we solve an open problem posted by T. Harju (2003)

Disorder-induced cavities, resonances, and lasing in randomly-layered media

We study, theoretically and experimentally, disorder-induced resonances in randomly-layered samples,and develop an algorithm for the detection and characterization of the effective cavities that give rise to these resonances. This algorithm enables us to find the eigen-frequencies and pinpoint the locations of the resonant cavities that appear in individual realizations of random samples, for arbitrary distributions of the widths and refractive indices of the layers. Each cavity is formed in a region whose size is a few localization lengths. Its eigen-frequency is independent of the location inside the sample, and does not change if the total length of the sample is increased by, for example, adding more scatterers on the sides. We show that the total number of cavities, $N_{\mathrm{cav}}$, and resonances, $N_{\mathrm{res}}$, per unit frequency interval is uniquely determined by the size of the disordered system and is independent of the strength of the disorder. In an active, amplifying medium, part of the cavities may host lasing modes whose number is less than $N_{\mathrm{res}}$. The ensemble of lasing cavities behaves as distributed feedback lasers, provided that the gain of the medium exceeds the lasing threshold, which is specific for each cavity. We present the results of experiments carried out with single-mode optical fibers with gain and randomly-located resonant Bragg reflectors (periodic gratings). When the fiber was illuminated by a pumping laser with an intensity high enough to overcome the lasing threshold, the resonances revealed themselves by peaks in the emission spectrum. Our experimental results are in a good agreement with the theory presented here.Comment: minor correction

Combinatorial framework for similarity search

Abstract—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are allowed. Namely, the input dataset is represented by a comparison oracle that given any three points x, y, z answers whether y or z is closer to x. We assume that the similarity order of the dataset satisfies the four variations of the following disorder inequality: if x is the a’th most similar object to y and y is the b’th most similar object to z, then x is among the D(a + b) most similar objects to z, where D is a relatively small disorder constant. Combinatorial algorithms for nearest neighbor search have two important advantages: (1) they do not map similarity values to artificial distance values and do not use triangle inequality for the latter, and (2) they work for arbitrarily complicated data representations and similarity functions. Ranwalk, the first known combinatorial solution for nearest neighbors, is randomized, exact, zero-error algorithm with query time that is logarithmic in number of objects. But Ranwalk preprocessing time is quadratic. Later on, another solution, called combinatorial nets, was discovered. It is deterministic and exact algorithm with near-linear time and space complexity of preprocessing, and near-logarithmic time complexity of search. Combinatorial nets also have a number of side applications. For near-duplicate detection they lead to the first known deterministic algorithm that requires just nearlinear time + time proportional to the size of output. For any dataset with small disorder combinatorial nets can be used to construct a visibility graph: the one in which greedy routing deterministically converges to the nearest neighbor of a target in logarithmic number of steps. The later result is the first known work-around for Navarro’s impossibility of generalizing Delaunay graphs. Keywords-nearest neighbors, similarity searc

Solving classical string problems an compressed texts

Here we study the complexity of string problems as a function of the size of a program that generates input. We consider straight-line programs (SLP), since all algorithms on SLP-generated strings could be applied to processing LZ-compressed texts. The main result is a new algorithm for pattern matching when both a text T and a pattern P are presented by SLPs (so-called fully compressed pattern matching problem). We show how to find a first occurrence, count all occurrences, check whether any given position is an occurrence or not in time O(n 2 m). Here m, n are the sizes of straight-line programs generating correspondingly P and T. Then we present polynomial algorithms for computing fingerprint table and compressed representation of all covers (for the first time) and for finding periods of a given compressed string (our algorithm is faster than previously known). On the other hand, we show that computing the Hamming distance between two SLP-generated strings is NP- and coNP-hard. I