1,644 research outputs found
A Note on Efficient Computation of All Abelian Periods in a String
We derive a simple efficient algorithm for Abelian periods knowing all
Abelian squares in a string. An efficient algorithm for the latter problem was
given by Cummings and Smyth in 1997. By the way we show an alternative
algorithm for Abelian squares. We also obtain a linear time algorithm finding
all `long' Abelian periods. The aim of the paper is a (new) reduction of the
problem of all Abelian periods to that of (already solved) all Abelian squares
which provides new insight into both connected problems
A Note on Easy and Efficient Computation of Full Abelian Periods of a Word
Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced
the idea of an Abelian period with head and tail of a finite word. An Abelian
period is called full if both the head and the tail are empty. We present a
simple and easy-to-implement -time algorithm for computing all
the full Abelian periods of a word of length over a constant-size alphabet.
Experiments show that our algorithm significantly outperforms the
algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the
same problem.Comment: Accepted for publication in Discrete Applied Mathematic
On the Parikh-de-Bruijn grid
We introduce the Parikh-de-Bruijn grid, a graph whose vertices are
fixed-order Parikh vectors, and whose edges are given by a simple shift
operation. This graph gives structural insight into the nature of sets of
Parikh vectors as well as that of the Parikh set of a given string. We show its
utility by proving some results on Parikh-de-Bruijn strings, the abelian analog
of de-Bruijn sequences.Comment: 18 pages, 3 figures, 1 tabl
Persistent Homology and String Vacua
We use methods from topological data analysis to study the topological
features of certain distributions of string vacua. Topological data analysis is
a multi-scale approach used to analyze the topological features of a dataset by
identifying which homological characteristics persist over a long range of
scales. We apply these techniques in several contexts. We analyze N=2 vacua by
focusing on certain distributions of Calabi-Yau varieties and Landau-Ginzburg
models. We then turn to flux compactifications and discuss how we can use
topological data analysis to extract physical informations. Finally we apply
these techniques to certain phenomenologically realistic heterotic models. We
discuss the possibility of characterizing string vacua using the topological
properties of their distributions.Comment: 32 pages, 12 pdf figure
Non-Perturbative Superpotentials in F-theory and String Duality
We use open-closed string duality between F-theory on K3xK3 and type II
strings on CY manifolds without branes to study non-perturbative
superpotentials in generalized flux compactifications. On the F-theory side we
obtain the full flux potential including D3-instanton contributions and show
that it leads to an explicit and simple realization of the three ingredients of
the KKLT model for stringy dS vacua. The D3-instanton contribution is highly
non-trivial, can be systematically computed including the determinant factors
and demonstrates that a particular flux lifts very effectively zero modes on
the instanton. On the closed string side, we propose a generalization of the
Gukov-Vafa-Witten superpotential for type II strings on generalized CY
manifolds, depending on all moduli multiplets.Comment: 49 pages, harvmac, 1 figure; references & figures adde
- âŠ