665 research outputs found
Abelian bordered factors and periodicity
A finite word u is said to be bordered if u has a proper prefix which is also
a suffix of u, and unbordered otherwise. Ehrenfeucht and Silberger proved that
an infinite word is purely periodic if and only if it contains only finitely
many unbordered factors. We are interested in abelian and weak abelian
analogues of this result; namely, we investigate the following question(s): Let
w be an infinite word such that all sufficiently long factors are (weakly)
abelian bordered; is w (weakly) abelian periodic? In the process we answer a
question of Avgustinovich et al. concerning the abelian critical factorization
theorem.Comment: 14 page
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
Type Decomposition in Posets
Motivated by the classical type decomposition of von Neumann algebras, and
various more recent extensions to other structures, we develop a type
decomposition theory for general posets
Dagstuhl Reports : Volume 1, Issue 2, February 2011
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn
- …