An algorithm for enumerating difference sets (Q2325366): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127537800, #quickstatements; #temporary_batch_1722284575798
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2950610823 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1807.02194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2931501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying construction for difference sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on a scheme of McFarland for noncyclic difference sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of strongly regular graphs using affine designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of difference sets in groups of order 96 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A summary of noncylic difference sets, \(k<20\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the smallest image of a set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem in Finite Projective Geometry and Some Applications to Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-abelian Hadamard difference sets / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127537800 / rank
 
Normal rank

Latest revision as of 22:30, 29 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for enumerating difference sets
scientific article

    Statements