AdvOL Student Seminars and Defences
Asma Paracha, December 12, 2017, 15:30-16:00, ITB 201
Speaker:   Asma Paracha

Title:  Lyndon factors and periodicities in strings
 
AdvOL Optimization Seminars
Alexander Rosa, December 12, 2017, 16:30-17:30, ITB 201
Speaker:   Alexander Rosa
Department of Mathematics & Statistics
McMaster University

Title:  Reaction graphs of combinatorial configurations
Read more...
 
Fields Institute Industrial Optimization Seminar, November 14, 2017
Speakers:   Christopher Swartz (McMaster University)
Jesus Flores-Carrillo (Praxair)

On the first Tuesday of each month, the Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
 
Home arrow Seminars arrow Invited seminars arrow Frantisek Franek, April 19, 2016, 16:30-17:30, ITB 201
Friday, 24 November 2017
 
 
Main Menu
Home
People
Publications
Software
Events
Awards
Photogallery
Internal pages
Latest Theses
File Icon Novel Stochastic Programming Formulations for Assemble-to-Order Systems
File Icon Computational Determination of the Largest Lattice Polytope Diameter
File Icon Computational Framework for the Generalized Berge Sorting Conjecture
Latest Reports
Visitors by region
Totals Top 20
 60 % Unknown
 14 % Commercial
 9 % networks
 6 % Canada
 3 % Germany
 2 % Russia
 2 % China
 < 1.0 % Educational
 < 1.0 % Brazil
 < 1.0 % United Kingdom
 < 1.0 % Ukraine
 < 1.0 % Poland
 < 1.0 % 
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % India
 < 1.0 % Australia
 < 1.0 % Organization

Visitors: 5234449
Frantisek Franek, April 19, 2016, 16:30-17:30, ITB 201
Speaker:   Frantisek Franek
Department of Computing and Software
McMaster University

Title:   Lyndon factors and periodicities in strings

Runs represent a type of maximal periodicities in a string. The conjecture that the maximum number of runs in a string is bounded by its length was resolved recently by Bannai, I, Inenaga, Nakashima, Takeda, and Tsuruta. Their approach is based on the use of the Lyndon roots of runs. The same approach was applied by Deza and Franek to verify the related d-step conjecture. In our talk, we will expose the connections of the Lyndon factors of a string to its runs, analyze applications of the Lyndon roots approach to problems concerning runs, investigate how the Lyndon factors of a string relate to the sorting of its suffixes, and discuss algorithms to compute the Lyndon array of a string.
 
< Prev   Next >
McMaster University
McMaster University
Faculty of Engineering
Faculty of Engineering
Faculty of Science
Faculty of Science
Computing & Software
Computing & Software
Comput. Eng. & Sci.

School Website >>>


Latest Publications
Publication Downloads
Error cannot find GD extension
 
Top!
Top!