Covering Problems for Partial Words and for Indeterminate Strings

We consider the problem of computing a shortest solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of the alphabet that could be present at the corresponding position. We also consider covering partial words, which are a special case of indeterminate strings where each non-solid symbol is a don't care symbol. We prove that indeterminate string covering problem and partial word covering problem are NP-complete for binary alphabet and show that both problems are fixed-parameter tractable with respect to $k$, the number of non-solid symbols. For the indeterminate string covering problem we obtain a $2^{O(k \log k)} + n k^{O(1)}$-time algorithm. For the partial word covering problem we obtain a $2^{O(\sqrt{k}\log k)} + nk^{O(1)}$-time algorithm. We prove that, unless the Exponential Time Hypothesis is false, no $2^{o(\sqrt{k})} n^{O(1)}$-time solution exists for either problem, which shows that our algorithm for this case is close to optimal. We also present an algorithm for both problems which is feasible in practice.Comment: full version (simplified and corrected); preliminary version appeared at ISAAC 2014; 14 pages, 4 figure

Efficient Seeds Computation Revisited

The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalization of periodicity, it is a cover of a superstring of a given string, and the shortest seed problem is of much higher algorithmic difficulty. The problem is not well understood, no linear time algorithm is known. In the paper we give linear time algorithms for some of its versions --- computing shortest left-seed array, longest left-seed array and checking for seeds of a given length. The algorithm for the last problem is used to compute the seed array of a string (i.e., the shortest seeds for all the prefixes of the string) in $O(n^2)$ time. We describe also a simpler alternative algorithm computing efficiently the shortest seeds. As a by-product we obtain an $O(n\log{(n/m)})$ time algorithm checking if the shortest seed has length at least $m$ and finding the corresponding seed. We also correct some important details missing in the previously known shortest-seed algorithm (Iliopoulos et al., 1996).Comment: 14 pages, accepted to CPM 201

Computing Covers under Substring Consistent Equivalence Relations

Covers are a kind of quasiperiodicity in strings. A string $C$ is a cover of another string $T$ if any position of $T$ is inside some occurrence of $C$ in $T$. The shortest and longest cover arrays of $T$ have the lengths of the shortest and longest covers of each prefix of $T$, respectively. The literature has proposed linear-time algorithms computing longest and shortest cover arrays taking border arrays as input. An equivalence relation $\approx$ over strings is called a substring consistent equivalence relation (SCER) iff $X \approx Y$ implies (1) $|X| = |Y|$ and (2) $X[i:j] \approx Y[i:j]$ for all $1 \le i \le j \le |X|$. In this paper, we generalize the notion of covers for SCERs and prove that existing algorithms to compute the shortest cover array and the longest cover array of a string $T$ under the identity relation will work for any SCERs taking the accordingly generalized border arrays.Comment: 16 page

Nonperturbative Vertices in Supersymmetric Quantum Electrodynamics

We derive the complete set of supersymmetric Ward identities involving only two- and three- point proper vertices in supersymmetric QED. We also present the most general form of the proper vertices consistent with both the supersymmetric and U(1) gauge Ward identities. These vertices are the supersymmetric equivalent of the non supersymmetric Ball-Chiu vertices.Comment: seventeen pages late

Effective potential for composite operators and for an auxiliary scalar field in a Nambu-Jona-Lasinio model

We derive the effective potentials for composite operators in a Nambu-Jona-Lasinio (NJL) model at zero and finite temperature and show that in each case they are equivalent to the corresponding effective potentials based on an auxiliary scalar field. The both effective potentials could lead to the same possible spontaneous breaking and restoration of symmetries including chiral symmetry if the momentum cutoff in the loop integrals is large enough, and can be transformed to each other when the Schwinger-Dyson (SD) equation of the dynamical fermion mass from the fermion-antifermion vacuum (or thermal) condensates is used. The results also generally indicate that two effective potentials with the same single order parameter but rather different mathematical expressions can still be considered physically equivalent if the SD equation corresponding to the extreme value conditions of the two potentials have the same form.Comment: 7 pages, no figur

The Path-Integral Approach to the N=2 Linear Sigma Model

In QFT the effective potential is an important tool to study symmetry breaking phenomena. It is known that, in some theories, the canonical approach and the path-integral approach yield different effective potentials. In this paper we investigate this for the Euclidean N=2 linear sigma model. Both the Green's functions and the effective potential will be computed in three different ways. The relative merits of the various approaches are discussed.Comment: 2 figure

Promoting Spontaneous Second Harmonic Generation through Organogelation

An organogelator based on the Disperse Red NLO-phore was synthesized according to a simple and efficient three-step procedure. The supramolecular gel organization leads to xerogels which display a spontaneous second harmonic generation (SHG) response without any need for pre-processing and this SHG activity appears stable over several months. These findings, based on an intrinsic structural approach are supported by favorable intermolecular supramolecular interactions, which promote a locally non-centrosymmetric NLO-active organization. This is in sharp contrast with most materials designed for SHG purposes, which generally require the use of expensive or heavy-to-handle external techniques for managing the dipoles alignment

Quantum Extremism: Effective Potential and Extremal Paths

The reality and convexity of the effective potential in quantum field theories has been studied extensively in the context of Euclidean space-time. It has been shown that canonical and path-integral approaches may yield different results, thus resolving the `convexity problem'. We discuss the transferral of these treatments to Minkowskian space-time, which also necessitates a careful discussion of precisely which field configurations give the dominant contributions to the path integral. In particular, we study the effective potential for the N=1 linear sigma model.Comment: 11 pages, 4 figure