OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS

We provide a general program for finding nice arrangements of points in real or complex projective space from transitive actions of finite groups. In many cases, these arrangements are optimal in the sense of maximizing the minimum distance. We introduce our program in terms of general Schurian asso...

Full description

Saved in:
Bibliographic Details
Published inForum of Mathematics, Sigma Vol. 8
Main Authors IVERSON, JOSEPH W., JASPER, JOHN, MIXON, DUSTIN G.
Format Journal Article
LanguageEnglish
Published Cambridge Cambridge University Press 2020
Subjects
Online AccessGet full text
ISSN2050-5094
2050-5094
DOI10.1017/fms.2019.48

Cover

Abstract We provide a general program for finding nice arrangements of points in real or complex projective space from transitive actions of finite groups. In many cases, these arrangements are optimal in the sense of maximizing the minimum distance. We introduce our program in terms of general Schurian association schemes before focusing on the special case of Gelfand pairs. Notably, our program unifies a variety of existing packings with heretofore disparate constructions. In addition, we leverage our program to construct the first known infinite family of equiangular lines with Heisenberg symmetry.
AbstractList We provide a general program for finding nice arrangements of points in real or complex projective space from transitive actions of finite groups. In many cases, these arrangements are optimal in the sense of maximizing the minimum distance. We introduce our program in terms of general Schurian association schemes before focusing on the special case of Gelfand pairs. Notably, our program unifies a variety of existing packings with heretofore disparate constructions. In addition, we leverage our program to construct the first known infinite family of equiangular lines with Heisenberg symmetry.
© The Author(s) 20202020The Author(s)This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.We provide a general program for finding nice arrangements of points in real or complex projective space from transitive actions of finite groups. In many cases, these arrangements are optimal in the sense of maximizing the minimum distance. We introduce our program in terms of general Schurian association schemes before focusing on the special case of Gelfand pairs. Notably, our program unifies a variety of existing packings with heretofore disparate constructions. In addition, we leverage our program to construct the first known infinite family of equiangular lines with Heisenberg symmetry.
ArticleNumber e6
Author IVERSON, JOSEPH W.
JASPER, JOHN
MIXON, DUSTIN G.
Author_xml – sequence: 1
  givenname: JOSEPH W.
  surname: IVERSON
  fullname: IVERSON, JOSEPH W.
– sequence: 2
  givenname: JOHN
  surname: JASPER
  fullname: JASPER, JOHN
– sequence: 3
  givenname: DUSTIN G.
  surname: MIXON
  fullname: MIXON, DUSTIN G.
BookMark eNp9kN1Kw0AQhRdR8PfKFwh4qa2zyW53cxlKW4NtUrS9XmY3G0mJSd2kiG_js_hkRiMigl7NMJz55sw5JvtVXVlCzikMKVBxnT82Qx9oOGRyjxz5wGHAIWT7P_pDctY0GwCg1BdciCMC6XIVL6K5N4-TibeMxrdxMrv3pnfpwpvGSbyaeLO7dL18e43GqzhN7k_JQY5lY8--6glZTyer8c1gns7icTQfmGDE2gHKXHMz4tYPUCLHXFob5pBpJrKcMaNN54BZ9EHa0AhptNCSA7W8M2Y0Bick7rlZjRu1dcUjuhdVY6E-B7V7UOjawpRWAecoMpqFKCwLpEStJWSCoeiO6RHtWFc9a1dt8eUZy_IbSEF9hKe68NRHeIrJTn7Ry7euftrZplWbeueq7lvlB4wyGggGnYr2KuPqpnE2V6ZosS3qqnVYlH-QL3_t_OfjHRhViqQ
CitedBy_id crossref_primary_10_1109_TIT_2024_3462593
crossref_primary_10_5802_alco_324
crossref_primary_10_1002_jcd_21745
crossref_primary_10_1016_j_jcta_2021_105540
crossref_primary_10_1080_03081087_2021_1998308
crossref_primary_10_1002_jcd_21804
crossref_primary_10_1007_s10623_021_00937_w
crossref_primary_10_1016_j_ffa_2021_101954
crossref_primary_10_1007_s40304_023_00381_3
crossref_primary_10_1016_j_jcta_2022_105656
Cites_doi 10.1016/j.laa.2016.09.005
10.1109/TIT.2016.2587865
10.2140/pjm.2015.275.295
10.1007/978-1-4612-5648-9_14
10.1007/BF02391012
10.1109/TIT.1974.1055219
10.1016/j.acha.2017.11.007
10.7146/math.scand.a-11778
10.1090/surv/083
10.1090/tran/6954
10.1109/SAMPTA.2015.7148910
10.1007/978-0-8176-8373-3
10.1017/CBO9780511619823
10.1090/conm/491/09614
10.1016/j.jcta.2011.02.002
10.1016/j.laa.2010.02.017
10.1007/978-0-8176-4683-7_2
10.1016/j.jcta.2017.08.005
10.1080/10586458.1996.10504585
10.1016/j.laa.2011.06.027
10.1109/TIT.2007.907343
10.1007/978-0-8176-8224-8
10.1017/9781108569798
10.1007/s11075-008-9167-x
10.1109/TIT.2005.846411
10.1063/1.1896384
10.1088/1751-8121/aab4cd
10.1016/S1063-5203(03)00023-X
10.1137/17M1137528
10.1063/1.4999844
ContentType Journal Article
Copyright Copyright Cambridge University Press 2020
Copyright_xml – notice: Copyright Cambridge University Press 2020
DBID AAYXX
CITATION
8FE
8FG
ABJCF
AFKRA
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ADTOC
UNPAY
DOA
DOI 10.1017/fms.2019.48
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
Unpaywall for CDI: Periodical Content
Unpaywall
Directory of Open Access Journals (DOAJ)
DatabaseTitle CrossRef
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest Central (New)
Engineering Collection
ProQuest One Academic (New)
DatabaseTitleList CrossRef

Engineering Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
– sequence: 3
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2050-5094
ExternalDocumentID oai_doaj_org_article_055a7d1d9a7e4388abb80d74a747db61
10.1017/fms.2019.48
10_1017_fms_2019_48
GroupedDBID 09C
09E
0E1
0R~
5VS
8FE
8FG
AABES
AABWE
AACJH
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAYXX
ABBXD
ABDBF
ABGDZ
ABJCF
ABKKG
ABMWE
ABQTM
ABROB
ABVKB
ABXHF
ACAJB
ACBMC
ACDLN
ACGFS
ACIMK
ACIWK
ACUHS
ACUIJ
ACZBM
ACZUX
ACZWT
ADBBV
ADCGK
ADDNB
ADFEC
ADKIL
ADOVH
ADVJH
AEBAK
AEGXH
AEHGV
AENGE
AFFUJ
AFKQG
AFKRA
AFLOS
AFLVW
AFUTZ
AFZFC
AGABE
AGBYD
AGJUD
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJCYY
AJPFC
AJQAS
AKMAY
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AMVHM
AQJOH
ARABE
AUXHV
BBLKV
BCNDV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
C0O
CBIIA
CCPQU
CCQAD
CFAFE
CHEAL
CITATION
CJCSC
DOHLZ
EBS
EJD
GROUPED_DOAJ
HCIFZ
HG-
HZ~
I.6
IKXGN
IOEEP
IPYYG
IS6
I~P
JHPGK
JQKCU
KCGVB
KFECR
KQ8
L6V
M-V
M48
M7S
M~E
NIKVX
O9-
OK1
PHGZM
PHGZT
PQGLB
PTHSS
PUEGO
PYCCK
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
ZYDXJ
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ADTOC
UNPAY
ID FETCH-LOGICAL-c364t-a8fb5c65e23a8a5af8ee9f0db47df44cbc1274ea208e9c78cb7b8501e5275cba3
IEDL.DBID UNPAY
ISSN 2050-5094
IngestDate Tue Oct 14 19:08:51 EDT 2025
Sun Oct 26 03:52:08 EDT 2025
Fri Jul 25 12:09:03 EDT 2025
Thu Apr 24 23:02:05 EDT 2025
Wed Oct 01 02:07:42 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License http://creativecommons.org/licenses/by/4.0
cc-by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c364t-a8fb5c65e23a8a5af8ee9f0db47df44cbc1274ea208e9c78cb7b8501e5275cba3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://proxy.k.utb.cz/login?url=https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A542ACDD49C5E752885EE7057033889E/S2050509419000483a.pdf/div-class-title-optimal-line-packings-from-finite-group-actions-div.pdf
PQID 2341413740
PQPubID 2035935
ParticipantIDs doaj_primary_oai_doaj_org_article_055a7d1d9a7e4388abb80d74a747db61
unpaywall_primary_10_1017_fms_2019_48
proquest_journals_2341413740
crossref_citationtrail_10_1017_fms_2019_48
crossref_primary_10_1017_fms_2019_48
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2020-00-00
PublicationDateYYYYMMDD 2020-01-01
PublicationDate_xml – year: 2020
  text: 2020-00-00
PublicationDecade 2020
PublicationPlace Cambridge
PublicationPlace_xml – name: Cambridge
PublicationTitle Forum of Mathematics, Sigma
PublicationYear 2020
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References Newton (S2050509419000483_c35) 1966
S2050509419000483_c2
S2050509419000483_c1
S2050509419000483_c4
S2050509419000483_c18
S2050509419000483_c3
S2050509419000483_c19
S2050509419000483_c16
S2050509419000483_c17
S2050509419000483_c14
S2050509419000483_c36
Zieschang (S2050509419000483_c47) 2005
S2050509419000483_c15
S2050509419000483_c37
S2050509419000483_c9
S2050509419000483_c8
Iverson (S2050509419000483_c32)
S2050509419000483_c7
S2050509419000483_c12
Tammes (S2050509419000483_c38) 1930; 27
S2050509419000483_c13
S2050509419000483_c10
S2050509419000483_c11
S2050509419000483_c33
S2050509419000483_c30
S2050509419000483_c31
(S2050509419000483_c25) 2016
S2050509419000483_c29
Levenshtein (S2050509419000483_c34) 1982; 25
S2050509419000483_c27
S2050509419000483_c28
S2050509419000483_c26
Vale (S2050509419000483_c39) 2005; 21
Bannai (S2050509419000483_c5) 1984
S2050509419000483_c23
S2050509419000483_c45
S2050509419000483_c24
S2050509419000483_c46
S2050509419000483_c21
S2050509419000483_c43
S2050509419000483_c44
S2050509419000483_c22
S2050509419000483_c41
Fickus (S2050509419000483_c20)
S2050509419000483_c42
Benson (S2050509419000483_c6) 1990; 321
S2050509419000483_c40
References_xml – ident: S2050509419000483_c9
  doi: 10.1016/j.laa.2016.09.005
– ident: S2050509419000483_c33
– ident: S2050509419000483_c23
  doi: 10.1109/TIT.2016.2587865
– ident: S2050509419000483_c20
  article-title: Hadamard equiangular tight frames
  publication-title: Appl. Comput. Harmon. Anal.
– ident: S2050509419000483_c10
– ident: S2050509419000483_c17
  doi: 10.2140/pjm.2015.275.295
– ident: S2050509419000483_c30
  doi: 10.1007/978-1-4612-5648-9_14
– volume-title: Theory of Association Schemes
  year: 2005
  ident: S2050509419000483_c47
– ident: S2050509419000483_c42
  doi: 10.1007/BF02391012
– ident: S2050509419000483_c43
  doi: 10.1109/TIT.1974.1055219
– volume: 321
  start-page: 85
  year: 1990
  ident: S2050509419000483_c6
  article-title: On Gelfand pairs associated with solvable Lie groups
  publication-title: Trans. Am. Math. Soc.
– volume-title: GAP – Groups, Algorithms, and Programming, Version 4.8.6
  year: 2016
  ident: S2050509419000483_c25
– ident: S2050509419000483_c21
  doi: 10.1016/j.acha.2017.11.007
– volume: 27
  start-page: 1
  year: 1930
  ident: S2050509419000483_c38
  article-title: On the origin of number and arrangement of the places of exit on the surface of pollen grains
  publication-title: Recueil de Trav. Botaniques Néerlandais
– volume-title: Algebraic Combinatorics I: Association Schemes
  year: 1984
  ident: S2050509419000483_c5
– ident: S2050509419000483_c29
  doi: 10.7146/math.scand.a-11778
– ident: S2050509419000483_c27
  doi: 10.1090/surv/083
– ident: S2050509419000483_c31
  doi: 10.1090/tran/6954
– ident: S2050509419000483_c26
– ident: S2050509419000483_c22
  doi: 10.1109/SAMPTA.2015.7148910
– ident: S2050509419000483_c11
  doi: 10.1007/978-0-8176-8373-3
– ident: S2050509419000483_c12
  doi: 10.1017/CBO9780511619823
– ident: S2050509419000483_c4
– ident: S2050509419000483_c8
  doi: 10.1090/conm/491/09614
– ident: S2050509419000483_c28
– ident: S2050509419000483_c45
– ident: S2050509419000483_c16
  doi: 10.1016/j.jcta.2011.02.002
– ident: S2050509419000483_c41
  doi: 10.1016/j.laa.2010.02.017
– ident: S2050509419000483_c7
  doi: 10.1007/978-0-8176-4683-7_2
– ident: S2050509419000483_c19
  doi: 10.1016/j.jcta.2017.08.005
– ident: S2050509419000483_c14
  doi: 10.1080/10586458.1996.10504585
– ident: S2050509419000483_c24
  doi: 10.1016/j.laa.2011.06.027
– volume: 25
  start-page: 526
  year: 1982
  ident: S2050509419000483_c34
  article-title: Bounds on the maximal cardinality of a code with bounded modulus of the inner product
  publication-title: Soviet Math. Dokl
– ident: S2050509419000483_c15
  doi: 10.1109/TIT.2007.907343
– ident: S2050509419000483_c13
  doi: 10.1007/978-0-8176-8224-8
– volume-title: The Correspondence of Isaac Newton: Volume 3, 1688–1694
  year: 1966
  ident: S2050509419000483_c35
  doi: 10.1017/9781108569798
– ident: S2050509419000483_c40
  doi: 10.1007/s11075-008-9167-x
– ident: S2050509419000483_c36
– volume: 21
  start-page: 83
  year: 2005
  ident: S2050509419000483_c39
  article-title: Tight frames and their symmetries
  publication-title: Constr. Approx.
– ident: S2050509419000483_c44
  doi: 10.1109/TIT.2005.846411
– ident: S2050509419000483_c1
  doi: 10.1063/1.1896384
– ident: S2050509419000483_c3
  doi: 10.1088/1751-8121/aab4cd
– ident: S2050509419000483_c32
  article-title: Optimal line packings from nonabelian groups
  publication-title: Discrete Comput. Geom.
– ident: S2050509419000483_c37
  doi: 10.1016/S1063-5203(03)00023-X
– ident: S2050509419000483_c18
  doi: 10.1137/17M1137528
– ident: S2050509419000483_c2
  doi: 10.1063/1.4999844
– ident: S2050509419000483_c46
SSID ssj0001127577
Score 2.2453086
Snippet We provide a general program for finding nice arrangements of points in real or complex projective space from transitive actions of finite groups. In many...
© The Author(s) 20202020The Author(s)This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence...
SourceID doaj
unpaywall
proquest
crossref
SourceType Open Website
Open Access Repository
Aggregation Database
Enrichment Source
Index Database
SubjectTerms 20B99
20C15
42C15
52C99
94C30
Optimization
SummonAdditionalLinks – databaseName: Directory of Open Access Journals (DOAJ)
  dbid: DOA
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8NAEF7Ei3oQn1itkkO9CNEk3c1ujrU0ttK0xbbQW9hXTjUW2yL-G3-Lv8zZJA0RRC_eQliSeWwy3wyz3yDUEB7XDHvSBiji21jhxBbaXHm-oIoowrJ6RzTwu1P8OCOzyqgv0xOW0wPnhrtzCOFUuSrgVOMmY1wI5iiKOeBgJfLEx2FBJZnKqiuGt5zS4kCe4YhOng05txvcmkk_lRCUMfV_g5c763TB39_4fF6JNOEB2i8gotXKRTtEWzo9QntRya-6PEbOcDTpRa2-1e8NOtao1YYk_GFshU_DyAp7A_gdWVk__edH3iQyPkHTsDNpd-1i9oEtmz5e2ZwlgkifaK_JGSc8YVoHiaMEaJ1gLIUEDbHmoLsOJGVSUMGI42oCikvBm6doO31J9RmyfIkx9-BphjnGlSwgmkNc10IC-AqkU0M3G3PEsiAGN_Mp5nHeAUZhvy9jY7sYsxpqlIsXOR_Gz8vujV3LJYbEOrsBro0L18Z_ubaG6huvxMWXBS-AsAuBl2KQ-7r01G-ynP-HLBdo1zOZdlZ8qaPt1etaXwIcWYmrbOd9AbIQ2Qs
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: ProQuest Central
  dbid: BENPR
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV07T8MwED5BGYAB8RTlpQxlQQpNHDt2BoQKaqGoDRW0UrfIr7CUtrRFiH-PnSYBJMQWRScnvvM9fD5_B1ATiGuGkXRNKBK6WOHUFdo-oVBQRRRhWb6jG4f3A_wwJMMViIu7MLassrCJmaFWE2lz5HVkzK0xuBR719M313aNsqerRQsNnrdWUFcZxNgqrCGLjFWBtZtm3Hv6zrpYPHNK84t6Fjs6fbWg3X50aTsA_XBNGYL_r7Bz_X085Z8ffDT64YFa27CVh45OYynrHVjR413Y7Ja4q_M9qD_2-u1uo-N02nHT6TVuzeb87tlpPT12nVY7NmbKyersnWXtyPM-DFrN_u29m7dEcGUQ4oXLWSqIDIlGAWec8JRpHaWeEpiqFGMppJkg1hx5TEeSMimoYMTzNTHzloIHB1AZT8b6EJxQYsyRGc0CyviSRURz4-61kCYmi6RXhYuCG4nM8cJt24pRsiwMo0YN5ollXYJZFWol8XQJk_E32Y1la0lisa2zF5PZS5KrSuIRwqnyVcSpxgFjXAjmKYq52fkoEfpVOCmEkuQKZz5QLo8qnJeC-u9fjv4f5hg2kN1aZ9mWE6gsZu_61MQfC3GWL6ovyMrVkw
  priority: 102
  providerName: ProQuest
– databaseName: Scholars Portal Journals: Open Access
  dbid: M48
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LT8JAEN4gHtSD8RlRND2gB5NiW3a724MxSEQwFolA4q3ZV70QRB5R_r2zZSFqCLemmUx2Z3Y6j85-g1BJBFwzHEgXQpHQxQqnrtDmKQgFVUQRltU74lbY6OGnN_KWQ4srBFaA45WpnZkn1Rv1y9-fszsw-FuLEgQaMLjbflTG7Gr46ZqJUubPqx2vsYE2wWtFZqxDbEP_rP5ikM0ptVf2_rH546QyLP8_AejWdDDksy_e7__yRfU9tGuDSKc61_o-yunBAdqJlwis40N089LuNuPqs_PcbD047WoN0vTHjlN_fYmderMFHywn67h35l0knSPUqz90aw3XDkdwZSXEE5ezVBAZEh1UOOOEp0zrKPWUwFSlGEshYYNY88BjOpKUSUEFI56vCexbCl45RvnBx0CfICeUGPMAuBloGV-yiGgOjl8LCdFZJL0Cul5II5EWOdwMsOgn8xYxCgYxTozoEswKqLQkHs4BM1aT3RuxLkkMynX24mP0nlijSTxCOFW-ijjVuMIYF4J5imIOOZASoV9AxYVSksXJSQLwy-CZKYZ1Xy4VtW4tp-vZnKHtwCTZWd2liPKT0VSfQyQyERfZkfoBcsvY0A
  priority: 102
  providerName: Scholars Portal
Title OPTIMAL LINE PACKINGS FROM FINITE GROUP ACTIONS
URI https://www.proquest.com/docview/2341413740
https://www.cambridge.org/core/services/aop-cambridge-core/content/view/A542ACDD49C5E752885EE7057033889E/S2050509419000483a.pdf/div-class-title-optimal-line-packings-from-finite-group-actions-div.pdf
https://doaj.org/article/055a7d1d9a7e4388abb80d74a747db61
UnpaywallVersion publishedVersion
Volume 8
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAEN
  databaseName: Cambridge University Press Open Access Journals
  customDbUrl:
  eissn: 2050-5094
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: IKXGN
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: http://journals.cambridge.org/action/login
  providerName: Cambridge University Press
– providerCode: PRVAEN
  databaseName: Cambridge Wholly Gold Open Access Journals
  customDbUrl:
  eissn: 2050-5094
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: IPYYG
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.cambridge.org
  providerName: Cambridge University Press
– providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 2050-5094
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: KQ8
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2050-5094
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVEBS
  databaseName: Academic Search Ultimate - eBooks
  customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn
  eissn: 2050-5094
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: ABDBF
  dateStart: 20150101
  isFulltext: true
  titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn
  providerName: EBSCOhost
– providerCode: PRVEBS
  databaseName: EBSCOhost Mathematics Source - HOST
  customDbUrl:
  eissn: 2050-5094
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: AMVHM
  dateStart: 20150101
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source
  providerName: EBSCOhost
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2050-5094
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 2050-5094
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: BENPR
  dateStart: 20140101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Technology Collection
  customDbUrl:
  eissn: 2050-5094
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: 8FG
  dateStart: 20140101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/technologycollection1
  providerName: ProQuest
– providerCode: PRVFZP
  databaseName: Scholars Portal Journals: Open Access
  customDbUrl:
  eissn: 2050-5094
  dateEnd: 20250131
  omitProxy: true
  ssIdentifier: ssj0001127577
  issn: 2050-5094
  databaseCode: M48
  dateStart: 20190101
  isFulltext: true
  titleUrlDefault: http://journals.scholarsportal.info
  providerName: Scholars Portal
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw3V1Pb9MwFLe29gAcxt-JjlHlMC5IbhPXjp1j1qVbYc2qdZXGKbIdR5ro2oq2IPg0fBYufBU-Bs9OGg2EEGcuURS_xJb__t7Le7-H0JEi0ghKNAYoEmKa0wIrY-9IqHjOciacvWOUhmdT-uaaXe-g79tYGOtWWXMcuD_5Lj_aqlo4XblY4rocuzLr0w0bdNea0rsxoyTun5zQqM8SzogQLEm4b3mmekJESXdCbO42UGqCyAVU92RnmRfd_OYj1havYjdIeAEL9lbOsMV6GLRXZ7fGNuQDFzcWDWIXdYHL6IMVhvftd3ZRM2SgFDRQc5qO43c2tR3Uhm2FVXSgJawubi1TeBB1bNqhO-ehSxvwC9a9t5kv5edPcja7c-wNHqIf2w4rvV3edzZr1dFffuOS_A969BHaq6C5F5dr6THaMfMn6MGo5rVdPUX-xfhqOIrPvfNhmnjjuP92mJ5OvMHlxcgbDFM4BjwXx_Dta-mcM3mGpoPkqn-Gq5wTWPdCusZSFIrpkBnSk0IyWQhjosLPFeV5QalWOgA93kjiCxNpLrTiSjA_MIxwppXs7aPGfDE3z5EXakolga9Zxp5Ai4gZCXjKKA2gN9J-C73ejnymK0J2mxdklpWedxz2mVVmp0lGRQsd1cLLkofkz2LHdgrVIpY83D2Acc-qvSjzGZM8D_JIckNhDKVSws85laBa5ioMWuhwOwGzakeDCgDuAODhFNr9qp6Uf2vLwT_KvUD3iTViOLvWIWqsP2zMS0B6a9VGu2Jw2kbN4yQdX7advQSuIyra1fr6CVz1VeM
linkProvider Unpaywall
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NT9swFH9icGA7TPvUytjmA1wmZSSOHTsHNBXWrlmbUEGRuAV_ZZeuLbQI8c_tb5udOhmTJm7coshyoveen997fv79APYkFoYTrAIbiiQB0aQKpHFPOJFMU015Xe_Ii2RwTn5c0IsN-N3chXFtlY1PrB21nitXIz_A1t1ah8tI-HVxFTjWKHe62lBoCE-toA9riDF_sWNo7m5tCrc8zL5Zfe9j3O9NjgeBZxkIVJyQVSB4JalKqMGx4IKKihuTVqGWhOmKECVVZDM3I3DITaoYV5JJTsPIUMyokiK28z6BLRKT1CZ_W0e9Ynz6t8rj8NMZ8xcDHVZ19cuBhEfpF8c4dG8rrBkD_glzt29mC3F3K6bTezte_wU896Eq6q5t6yVsmNkreJa3OK_L13BwMp5keXeERlnRQ-Pu8TArvp-h_ulJjvpZYd0iqvv60bpX5ewNnD-KcN7C5mw-M-8AJYoQge1sDsAmUjylRtjwwkhlY8BUhR343EijVB6f3NFkTMt1Ixqzy25ZOtGVhHdgrx28WMNy_H_YkRNrO8Rhadcv5tc_S780y5BSwXSkU8EMiTkXUvJQMyJspqVlEnVgt1FK6Re4_UBrjh3YbxX10L_sPDzNJ9geTPJRafU1fA9PsUvr60rPLmyurm_MBxv7rORHb2AILh_bpv8A45kUqA
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw3V3NjtMwELaW7gE48I8oLCiH5YLkNnHt2DmGbsoWtt2KbqXlFNmOI63othVtQfA0PAsXXoXHYMZJowUhxJlbFE9sy7_fTGa-IeTQMO0UZ5YCFIkpL3hJjcMnFhtZiEIob-8YjePjGX99Ls73yPddLAy6VTYcB_5Pvs-Ptq43TlcvV7Qpp74MfbrhgO6iKb2bCs7S_tERT_oik4IpJbJMhsgz1VMqybpThrnbQKmJEh9Q3dOdVVF2i4uP1CJepX6S6BI27KWeU8R6FLRXb7emGPJBywtEg9RHXdAq-mBN4Xus5xrZjwUoBS2yPxtP0neY2g5ao9hgHR2IhNXlJTKFR0kH0w5duQ992oBfsO717WKlP3_S8_mVa29wm_zYDVjl7fK-s92Yjv3yG5fkfzCid8itGpoHabWX7pI9t7hHbo4aXtv1fRKeTs6Go_QkOBmOs2CS9t8Mx6-mweDt6SgYDMdwDQQ-juHb18o5Z_qAzAbZWf-Y1jknqO3FfEO1Ko2wsXCsp5UWulTOJWVYGC6LknNrbAR6vNMsVC6xUlkjjRJh5ASTwhrde0hai-XCPSJBbDnXDGpDxp7IqkQ4DXjKGQugN7Fhm7zYzXxua0J2zAsyzyvPOwnnzDrHZZJz1SaHjfCq4iH5s9hLXEKNCJKH-xcw73l9FuWhEFoWUZFo6TjMoTZGhYXkGlTLwsRRmxzsFmBen2jQAMAdADySQ7-fN4vyb315_I9yT8gNhkYMb9c6IK3Nh617CkhvY57Vu-gn5atRlA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=OPTIMAL+LINE+PACKINGS+FROM+FINITE+GROUP+ACTIONS&rft.jtitle=Forum+of+mathematics.+Sigma&rft.au=Iverson%2C+Joseph+W&rft.au=Jasper%2C+John&rft.au=Mixon%2C+Dustin+G&rft.date=2020&rft.pub=Cambridge+University+Press&rft.eissn=2050-5094&rft.volume=8&rft_id=info:doi/10.1017%2Ffms.2019.48
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2050-5094&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2050-5094&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2050-5094&client=summon