BPS counting for knots and combinatorics on words [PDF]
Journal of High Energy Physics, 2016 We discuss relations between quantum BPS invariants defined in terms of a product decomposition of certain series, and difference equations (quantum A-polynomials) that annihilate such series.
Kucharski, Piotr, Sułkowski, Piotr
core +6 more sources
Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet.
Juha Kortelainen
doaj +7 more sources
Gray code order for Lyndon words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 At the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed the question of whether the dual reflected order yields a Gray code on the Lyndon family. In this paper we give a positive answer.
Vincent Vajnovszki
doaj +8 more sources
The Field Q and the Equality 0.999. . . = 1 from Combinatorics of Circular Words and History of Practical Arithmetics [PDF]
The Mathematics Enthusiast, 2023 We reconsider the classical equality 0.999. .. = 1 with the tool of circular words, that is: finite words whose last letter is assumed to be followed by the first one. Such circular words are naturally embedded with algebraic structures that enlight this
Benoît Rittaud, Laurent Vivier
openalex +3 more sources
Combinatorics on Binary Words and Codimensions of Identities in Left Nilpotent Algebras [PDF]
Algebra i logika, 2019 Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with specified properties ...
M. V. Zaicev, D. D. Repovš
openalex +3 more sources
The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Automata, Logic and ...
Manfred Kufleitner, Alexander Lauser
doaj +2 more sources
A characterization of horizontal visibility graphs and combinatorics on words [PDF]
, 2010 An Horizontal Visibility Graph (for short, HVG) is defined in association with an ordered set of non-negative reals. HVGs realize a methodology in the analysis of time series, their degree distribution being a good discriminator between randomness and ...
Gutin, Gregory +2 more
core +4 more sources
Malaya Journal of Matematik, 2023 We introduce two new concepts which are the $k$ to $k$ substitution and $k$ to $k$ exchange of a letter on infinite words. After studying the return words and the special factors of words obtaining by these applications on Sturmian words and modulo ...
Moussa Barro +2 more
openalex +3 more sources
Interactions between Digital Geometry and Combinatorics on Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We review some recent results in digital geometry obtained by using a combinatorics on words approach to discrete geometry. Motivated on the one hand by the well-known theory of Sturmian words which model conveniently discrete lines in the plane, and on ...
Srečko Brlek
doaj +2 more sources
The combinatorics of Farey words and their traces [PDF]
Groups, Geometry, and Dynamics, 2022 We introduce a family of 3 -variable ‘Farey polynomials’ that are closely connected with the geometry and topology of 3 -manifolds and orbifolds as they can be used to produce concrete realisations of the boundaries and local coordinates ...
Alex Elzenaar +2 more
openalex +2 more sources