Results 51 to 60 of about 1,558,342 (70)
Extending Skolem sequences, how can you begin?
, 2008 For each n ≥ 1and1≤j ≤ n we show the existence of an extended Skolem sequence of order n starting with the symbol j.
V. Linek
core
Skolem paradoksu'nun transandantal teşhirine giriş
, 2020 YÖK Tez No: 651862Bu tezde Skolem paradoksunun transandantal yönden bir incelemesi gerçekleştirilmiştir. Skolem paradoksu sembolik mantık, aksiyomatik küme kuramı ve felsefeyi buluşturan bir evlektir ve bu alanlara dair gerçekci yaklaşımın temellerini ...
Erdemir, Ömer Faruk
core
Mathematical and algorithmic methods for finding disjoint Rosa-type sequences
, 2018 A Rosa sequence of order n is a sequence S = (s1; s2; ..., s2n+1) of 2n + 1 integers satisfying the conditions: (1) for every k ∈ {1; 2;...; n} there are exactly two elements sᵢ; sj ∈ S such that si = sj = k; (2) if sᵢ = sj = k; i < j, then j - i = k;
Alruhaymi, Fatimah
core
New constructions of strong and Skolem starters
This thesis studies a class of combinatorial objects called strong starters, and their subclass, strong Skolem starters, which are generated by Skolem sequences.
Ogandzhanyants, Oleg
core
Discrete Mathematics, 2008 A Skolem sequence is a sequence s1,s2,…,s2n (where si∈A={1,…,n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set.
Gustav Nordh
exaly +2 more sources
, 2021 It is a longstanding open problem whether there is an algorithm to decide the Skolem Problem for linear recurrence sequences, namely whether a given such sequence has a zero term.
James Worrell +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Skolem and Rosa rectangles and related designs
Discrete Mathematics, 2014Nabil Shalaby, Václav Linek
exaly
On (k, d)-Skolem Graceful Graphs
Electronic Notes in Discrete Mathematics, 2015Subramanian Arumugam, Tarkeshwar Singh
exaly