Results 11 to 20 of about 5,185 (231)

On the Index of Necklaces

open access: yesGraphs and Combinatorics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francesco Belardo   +3 more
openaire   +4 more sources

Gray codes for necklaces [PDF]

open access: yesDiscrete Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Takao Ueda, Ueda, Takao
openaire   +3 more sources

Generating necklaces

open access: yesJournal of Algorithms, 1992
Summary: A \(k\)-color, \(n\)-bead necklace in an equivalence class of \(k\)-ary \(n\)- tuples under rotation. In this paper, we analyze an algorithm due to Fredricksen, Kessler, and Maiorana (FKM) to show that necklaces can be generated in constant amortized time.
Frank Ruskey   +2 more
openaire   +4 more sources

ENUMERATING NECKLACES WITH TRANSITIONS

open access: yesBulletin of the Australian Mathematical Society, 2021
AbstractNecklaces are the equivalence classes of words under the action of the cyclic group. Let a transition in a word be any change between two adjacent letters modulo the word’s length. We present a closed-form solution for the enumeration of necklaces innbeads,kcolours andttransitions. We show that our result provides a more general solution to the
FRANCESCO BIANCONI, EMANUELE BRUGNOLI
openaire   +4 more sources

Cosmic necklaces in string theory and field theory [PDF]

open access: yes, 2010
PhDIn this thesis we investigate astrophysical phenomena which arise in models with compact extra dimensions, focussing on the cosmological consequences of strings which wrap cycles in the internal space. Embedding our strings in the Klebanov-Strassler
Lake, Matthew James
core   +4 more sources

Ranking binary unlabelled necklaces in polynomial time [PDF]

open access: yes, 2022
Unlabelled Necklaces are an equivalence class of cyclic words under both the rotation (cyclic shift) and the relabelling operations. The relabelling of a word is a bijective mapping from the alphabet to itself.
Adamson, Duncan
core   +2 more sources

Splitting Necklaces, with Constraints [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2021
Oberwolfach Preprints;2020 ...
Dusko Jojic   +2 more
openaire   +2 more sources

Necklace Maps [PDF]

open access: yesIEEE Transactions on Visualization and Computer Graphics, 2010
Statistical data associated with geographic regions is nowadays globally available in large amounts and hence automated methods to visually display these data are in high demand. There are several well-established thematic map types for quantitative data on the ratio-scale associated with regions: choropleth maps, cartograms, and proportional symbol ...
Bettina Speckmann, Kevin Verbeek
openaire   +3 more sources

Combinatorial Algorithms for Multidimensional Necklaces [PDF]

open access: yes, 2021
A necklace is an equivalence class of words of length $n$ over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic results for key operations on necklaces, including counting, generating ...
Gusev, Vladimir V   +3 more
core   +1 more source

Necklaces and slimes

open access: yesDiscrete Mathematics, 2020
We show there is a bijection between the binary necklaces with $n$ black beads and $k$ white beads and certain $(n,k)$-codes when $n$ is prime. The main idea is to come up with a new map on necklaces called slime migration.
Suho Oh, Jina Park
openaire   +3 more sources

Home - About - Disclaimer - Privacy