Zobrazeno 1 - 7
of 7
pro vyhledávání: '"05-06"'
Autor:
Rivals, Eric, Wang, Pengfei
A correlation is a binary vector that encodes all possible positions of overlaps of two words, where an overlap for an ordered pair of words (u,v) occurs if a suffix of word u matches a prefix of word v. As multiple pairs can have the same correlatio
Externí odkaz:
http://arxiv.org/abs/2405.09393
Consider words of length $n$. The set of all periods of a word of length $n$ is a subset of $\{0,1,2,\ldots,n-1\}$. However, any subset of $\{0,1,2,\ldots,n-1\}$ is not necessarily a valid set of periods. In a seminal paper in 1981, Guibas and Odlyzk
Externí odkaz:
http://arxiv.org/abs/2209.08926
Consider words of length $n$. The set of all periods of a word of length $n$ is a subset of $\{0,1,2,\ldots,n-1\}$. However, any subset of $\{0,1,2,\ldots,n-1\}$ is not necessarily a valid set of periods. In a seminal paper in 1981, Guibas and Odlyzk
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2cae56f5175fbffe3412561aa10030ec
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03780386/file/arxiv_ac_corr_upper_bound.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03780386/file/arxiv_ac_corr_upper_bound.pdf
Autor:
Ralf Gramlich
Publikováno v:
Innov. Incidence Geom. 9, no. 1 (2009), 123-175
Geometric methods in the theory of Chevalley groups and their generalisations have made tremendous advances during the last few decades. Among the most noteworthy and influential of these advances are the systematic application of the concept of amal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51e3d72c8660b4a232028c3e7471ed43
https://doi.org/10.2140/iig.2009.9.123
https://doi.org/10.2140/iig.2009.9.123
Autor:
Nzeutchap, Janvier
This work is concerned with some properties of the Young-Fibonacci insertion algorithm and its relation with Fomin's growth diagrams. It also investigates a relation between the combinatorics of Young-Fibonacci tableaux and the study of Okada's algeb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa76541d7fad61a2a979762ef2ab4d9e
Autor:
Nzeutchap, Janvier
Fomin (1994) introduced a notion of duality between two graded graphs on the same set of vertices. He also introduced a generalization to dual graded graphs of the classical Robinson-Schensted-Knuth algorithm. We show how Fomin's approach applies to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bdcef1cbb77b1343164ef6bd8840b1d0
Autor:
Stephan, Ralf
Presented here are over one hundred conjectures ranging from easy to difficult, from many mathematical fields. I also summarize briefly methods and tools that have led to this collection.
Comment: 12 pages, last corrections
Comment: 12 pages, last corrections
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2371675b181476e9ac4cb654cda4e936