174 research outputs found
Ten Conferences WORDS: Open Problems and Conjectures
In connection to the development of the field of Combinatorics on Words, we
present a list of open problems and conjectures that were stated during the ten
last meetings WORDS. We wish to continually update the present document by
adding informations concerning advances in problems solving
DNA sequences classification and computation scheme based on the symmetry principle
The DNA sequences containing multifarious novel symmetrical structure frequently play crucial role in how genomes work. Here we present a new scheme for understanding the structural features and potential mathematical rules of symmetrical DNA sequences using a method containing stepwise classification and recursive computation. By defining the symmetry of DNA sequences, we classify all sequences and conclude a series of recursive equations for computing the quantity of all classes of sequences existing theoretically; moreover, the symmetries of the typical sequences at different levels are analyzed. The classification and quantitative relation demonstrate that DNA sequences have recursive and nested properties. The scheme may help us better discuss the formation and the growth mechanism of DNA sequences because it has a capability of educing the information about structure and quantity of longer sequences according to that of shorter sequences by some recursive rules. Our scheme may provide a new stepping stone to the theoretical characterization, as well as structural analysis, of DNA sequences
Sturmian morphisms, the braid group B_4, Christoffel words and bases of F_2
We give a presentation by generators and relations of a certain monoid
generating a subgroup of index two in the group Aut(F_2) of automorphisms of
the rank two free group F_2 and show that it can be realized as a monoid in the
group B_4 of braids on four strings. In the second part we use Christoffel
words to construct an explicit basis of F_2 lifting any given basis of the free
abelian group Z^2. We further give an algorithm allowing to decide whether two
elements of F_2 form a basis or not. We also show that, under suitable
conditions, a basis has a unique conjugate consisting of two palindromes.Comment: 25 pages, 4 figure
Conferences WORDS, years 1997-2017: Open Problems and Conjectures
International audienceIn connection with the development of the field of Combinatorics on Words, we present a list of open problems and conjectures which were stated in the context of the eleven international meetings WORDS, which held from 1997 to 2017
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
Two infinite families of polyominoes that tile the plane by translation in two distinct ways
It has been proved that, among the polyominoes that tile the plane by translation, the so-called squares tile the plane in at most two distinct ways. In this paper, we focus on double squares, that is, the polyominoes that tile the plane in exactly two distinct ways. Our approach is based on solving equations on words, which allows us to exhibit properties about their shape. Moreover, we describe two infinite families of double squares. The first one is directly linked to Christoffel words and may be interpreted as segments of thick straight lines. The second one stems from the Fibonacci sequence and reveals some fractal features
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms
Let be a finite or countable alphabet and let be literal
(anti)morphism onto (by definition, such a correspondence is determinated
by a permutation of the alphabet). This paper deals with sets which are
invariant under (-invariant for short).We establish an
extension of the famous defect theorem. Moreover, we prove that for the
so-called thin -invariant codes, maximality and completeness are two
equivalent notions. We prove that a similar property holds in the framework of
some special families of -invariant codes such as prefix (bifix) codes,
codes with a finite deciphering delay, uniformly synchronized codes and
circular codes. For a special class of involutive antimorphisms, we prove that
any regular -invariant code may be embedded into a complete one.Comment: To appear in Acts of WORDS 201
- âŠ