Binary Codes that do not Preserve Primitivity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10471503" target="_blank" >RIV/00216208:11320/23:10471503 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/23:00367017
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=tsEJA.BVmd" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=tsEJA.BVmd</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10817-023-09674-2" target="_blank" >10.1007/s10817-023-09674-2</a>
Alternative languages
Result language
angličtina
Original language name
Binary Codes that do not Preserve Primitivity
Original language description
A set of words X is not primitivity-preserving if there is a primitive list of length at least two of elements from X whose concatenation is imprimitive. Here, a word or list is primitive if it is not equal to a concatenation of several copies of a shorter word or list, and imprimitive otherwise. We formalize a full characterization of such two-element sets {x, y} in the proof assistant Isabelle/HOL. The formalization is based on an existing proof which we analyze and simplify using some innovative ideas. Part of the formalization, interesting on its own, is a description of the ways in which the square xx can appear inside a concatenation of words x and y if |y| = |x|. We also provide a formalized parametric solution of the related equation x(j)y(k) = z(l).
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA20-20621S" target="_blank" >GA20-20621S: Combinatorics on words formalization</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Automated Reasoning
ISSN
0168-7433
e-ISSN
1573-0670
Volume of the periodical
67
Issue of the periodical within the volume
3
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
27
Pages from-to
25
UT code for WoS article
001033434000001
EID of the result in the Scopus database
2-s2.0-85165230625