Revision as of 03:09, 26 April 2023 edit Giftlite (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 39,854 edits +open problem ← Previous edit		Revision as of 15:35, 24 July 2023 edit undo Citation bot (talk \| contribs) Bots 5,871,889 edits Alter: pages. Add: issue, url, s2cid, volume, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| #UCB_CommandLine 107/8263 Next edit →
Line 165: == Variants == Costas arrays on a [[hexagonal lattice]] are known as ''honeycomb arrays''. It has been shown that there are only finitely many such arrays, which must have an odd number of elements, arranged in the shape of a hexagon. Currently, 12 such arrays (up to symmetry) are known, which has been conjectured to be the total number.<ref>{{Cite journal\|~~last~~last1=Blackburn\|~~first~~first1=Simon R.\|last2=Panoui\|first2=Anastasia\|last3=Paterson\|first3=Maura B.\|last4=Stinson\|first4=Douglas R.\|date=2010-12-10\|title=Honeycomb Arrays\|url=https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r172\|journal=The Electronic Journal of Combinatorics\|volume=17 \|language=en\|pages=~~R172–R172~~R172\|doi=10.37236/444\|issn=1077-8926\|doi-access=free}}</ref> == See also == Line 191: \| volume = 97 \| year = 2009 \| s2cid = 29776660 \| access-date = 2011-10-10 \| archive-url = https://web.archive.org/web/20120425053202/http://eeme.ucd.ie/~kdrakaka/work/publications/020.On_The_Complexity_Of_The_Verification_Of_The_Costas_Property.pdf Line 202 ⟶ 203: \| doi = 10.1109/ciss.2006.286635 \| publisher = IEEE \| title = 2006 40th Annual Conference on Information Sciences and Systems~~}}.~~\| s2cid = 2241386 }}. {{citation \| last = Beard \| first = James K. Line 209 ⟶ 211: \| doi = 10.1109/ciss.2008.4558709 \| publisher = IEEE \| title = 2008 42nd Annual Conference on Information Sciences and Systems~~}}.~~\| s2cid = 614347 }}. {{citation \| last = Beard \| first = James K. Line 234 ⟶ 237: \| url = http://www.costasarrays.org/costasrefs/beard04combinatoric.pdf \| year = 2004 \| s2cid = 7733481 \| access-date = 2011-10-10 \| archive-url = https://web.archive.org/web/20120425053202/http://www.costasarrays.org/costasrefs/beard04combinatoric.pdf Line 251 ⟶ 255: \| pages = 522–538 \| title = Costas array generation and search methodology \| volume = 43~~}}.~~\| s2cid = 32271456 \| url = https://zenodo.org/record/893374 }}. {{citation \| last = Costas \| first = J. P. \| author-link = John P. Costas (engineer) Line 270 ⟶ 276: \| volume = 72 \| year = 1984 \| s2cid = 2742217 \| access-date = 2011-10-10 \| archive-url = https://web.archive.org/web/20110930054819/http://www.costasarrays.org/costasrefs/costas84study.pdf Line 320 ⟶ 327: \| title = Latin squares which contain no repeated digrams \| volume = 7 \| year = 1965\| issue = 2 }}. {{citation \| last = Golomb \| first = Solomon W. \| authorlink = Solomon W. Golomb Line 352 ⟶ 359: \| volume = 72 \| year = 1984 \| s2cid = 39718506 \| access-date = 2011-10-10 \| archive-url = https://web.archive.org/web/20110930054835/http://www.costasarrays.org/costasrefs/golomb84constructions.pdf \| archive-date = 2011-09-30

Costas array: Difference between revisions