Results 51 to 60 of about 67,579,596 (150)
Order and quasiperiodicity in episturmian words [PDF]
, 2007 We prove a refinement of a recent characterization of infinite episturmian words via lexicographic orderings (Glen-Justin-Pirillo, 2007). This allows us to easily characterize the strict episturmian words that are "infinite Lyndon words", i.e., those ...
Glen, A.
core
Random multilinear maps and the Erdős box problem
Discrete Analysis, 2021 Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon +2 more
doaj +1 more source
Combinatorics on partial word correlations
Journal of Combinatorial Theory, Series A, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francine Blanchet-Sadri +3 more
openaire +2 more sources
Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs
Journal of Graph Theory, EarlyView.ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho +3 more
wiley +1 more source
Powers in a class of A-strict standard episturmian words [PDF]
, 2007 This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent ...
Glen, Amy, Glen, A.
core +1 more source
, 2022 The abelian critical exponent of an infinite word $w$ is defined as the maximum ratio between the exponent and the period of an abelian power occurring in $w$. It was shown by Fici et al.
Peltomäki Jarkko, Whiteland Markus A.
core +1 more source
On an Algorithm for Multiperiodic Words
Acta Polytechnica, 2013 We consider an algorithm by Tijdeman and Zamboni constructing a word of length k thathas periods p1, . . . , pr, and the richest possible alphabet.
Štepán Holub
doaj
Forbidden intersection problems for families of linear maps
Discrete Analysis, 2023 Forbidden intersection problems for families of linear maps, Discrete Analysis 2023:19, 32 pp. A central problem in extremal combinatorics is to determine the maximal size of a set system given constraints on the sizes of the sets in the system and on ...
David Ellis, Guy Kindler, Noam Lifshitz
doaj +1 more source
On the Contribution of WORDS to the Field of Combinatorics on Words [PDF]
, 2015 We propose some notes about the history and the features of the conference WORDS, our goal being to testify how the conference may be embedded in the development of the field of Combinatorics on Words.
openaire +3 more sources
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source