Note concerning an odd Langford sequence (Q1840830): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Norbert Hegyvári / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Norbert Hegyvári / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/eujc.2000.0437 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970283777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended skolem sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Langford’s Problem (I) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Langford sequences with small defects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Langford sequences: Perfect and hooked / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain distributions of integers in pairs with given differences / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:14, 3 June 2024

scientific article
Language Label Description Also known as
English
Note concerning an odd Langford sequence
scientific article

    Statements

    Note concerning an odd Langford sequence (English)
    0 references
    0 references
    26 March 2003
    0 references
    A Langford sequence of defect \(d\) and length \(m\) is a partition of \(\{a_1,a_2,\dots,a_{2m}\}\) into differences \(d,d+1,\dots,d+m-1\). (For example \(\{(5,3),(4,1),(6,2)\}\) is a \(d=2,m=3\) partition of the set \(\{1,2,\dots,6\}\).) In the present paper the author proves as a main result that the set \(\{1,2,\dots,2N+3\}\setminus \{p\}\) can be partitioned into differences \(1,3,\dots, 2N+1\) when \(N\geq 1\) and \(N\neq 1\); \(p\neq 3.\)
    0 references
    0 references
    Langford sequence
    0 references
    partition
    0 references
    0 references