{"id":"https://openalex.org/W3197921725","doi":"https://doi.org/10.37236/10707","title":"A New Family of Algebraically Defined Graphs with Small Automorphism Group","display_name":"A New Family of Algebraically Defined Graphs with Small Automorphism Group","publication_year":2022,"publication_date":"2022-03-11","ids":{"openalex":"https://openalex.org/W3197921725","doi":"https://doi.org/10.37236/10707","mag":"3197921725"},"language":"en","primary_location":{"id":"doi:10.37236/10707","is_oa":true,"landing_page_url":"https://doi.org/10.37236/10707","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i1p43/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i1p43/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031529103","display_name":"Felix Lazebnik","orcid":null},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Felix Lazebnik","raw_affiliation_strings":["University of Delaware"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Delaware","institution_ids":["https://openalex.org/I86501945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021765136","display_name":"Vladislav Taranchuk","orcid":"https://orcid.org/0000-0002-1375-6670"},"institutions":[{"id":"https://openalex.org/I86501945","display_name":"University of Delaware","ror":"https://ror.org/01sbq1a82","country_code":"US","type":"education","lineage":["https://openalex.org/I86501945"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vladislav Taranchuk","raw_affiliation_strings":["Department of Mathematical Sciences University of Delaware Newark, DE 19716, U.S.A"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences University of Delaware Newark, DE 19716, U.S.A","institution_ids":["https://openalex.org/I86501945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07442813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8389688730239868},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6200340390205383},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5968255996704102},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5751299262046814},{"id":"https://openalex.org/keywords/automorphism","display_name":"Automorphism","score":0.5004057884216309},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43236297369003296}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8389688730239868},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6200340390205383},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5968255996704102},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5751299262046814},{"id":"https://openalex.org/C118712358","wikidata":"https://www.wikidata.org/wiki/Q782566","display_name":"Automorphism","level":2,"score":0.5004057884216309},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43236297369003296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/10707","is_oa":true,"landing_page_url":"https://doi.org/10.37236/10707","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i1p43/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/10707","is_oa":true,"landing_page_url":"https://doi.org/10.37236/10707","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v29i1p43/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8522417901","display_name":null,"funder_award_id":"426092","funder_id":"https://openalex.org/F4320306164","funder_display_name":"Simons Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3197921725.pdf","grobid_xml":"https://content.openalex.org/works/W3197921725.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W639887749","https://openalex.org/W1485161462","https://openalex.org/W2004308928","https://openalex.org/W2019885050","https://openalex.org/W2477775364","https://openalex.org/W2613956024","https://openalex.org/W2996032945","https://openalex.org/W3045505974","https://openalex.org/W3124079005","https://openalex.org/W3204328893","https://openalex.org/W4246611826"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2114124567","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2998724919","https://openalex.org/W4390409907","https://openalex.org/W2586280130","https://openalex.org/W4221143622","https://openalex.org/W1981723335","https://openalex.org/W2089088747"],"abstract_inverted_index":{"Let":[0,21],"$p$":[1],"be":[2,29,36],"an":[3,78,182],"odd":[4],"prime,":[5],"$q=p^e$,":[6],"$e":[7],"\\geq":[8],"1$,":[9],"and":[10,25,31,34,56,58,68,128,171],"$\\mathbb{F}":[11],"=":[12,75,91,146],"\\mathbb{F}_q$":[13],"denote":[14],"the":[15,40,114,120,138,164,167,172,196,207,212,218],"finite":[16],"field":[17],"of":[18,39,199,211,215,217],"$q$":[19],"elements.":[20],"$f:":[22],"\\mathbb{F}^2\\to":[23],"\\mathbb{F}$":[24,28,111],"$g:":[26],"\\mathbb{F}^3\\to":[27],"functions,":[30],"let":[32],"$P$":[33,55],"$L$":[35,57],"two":[37],"copies":[38],"3-dimensional":[41],"vector":[42],"space":[43],"$\\mathbb{F}^3$.":[44],"Consider":[45],"a":[46,108,134],"bipartite":[47],"graph":[48,115],"$\\Gamma_\\mathbb{F}":[49,81,99,116,125,151],"(f,":[50,82,100,117,126,152],"g)$":[51,83,127,153],"with":[52,59,119,129],"vertex":[53,122],"partitions":[54],"edges":[60,130],"defined":[61,132],"as":[62,124],"follows:":[63],"for":[64,154,184],"every":[65,69],"$(p)=(p_1,p_2,p_3)\\in":[66],"P$":[67],"$[l]=":[70],"[l_1,l_2,l_3]\\in":[71],"L$,":[72],"$\\{(p),":[73],"[l]\\}":[74],"(p)[l]$":[76],"is":[77,102,148,169,191,206],"edge":[79],"in":[80,96,133],"if":[84],"$$p_2+l_2":[85,140],"=f(p_1,l_1)":[86,141],"\\;\\;\\;\\text{and}\\;\\;\\;":[87,142],"p_3":[88,143],"+":[89,144,176,178],"l_3":[90,145],"g(p_1,p_2,l_1).$$The":[92],"following":[93],"question":[94,168],"appeared":[95],"Nassau:":[97],"Given":[98],"g)$,":[101],"it":[103],"always":[104],"possible":[105,209],"to":[106,150,166],"find":[107],"function":[109],"$h:\\mathbb{F}^2\\to":[110],"such":[112,181],"that":[113,163,195],"h)$":[118],"same":[121],"set":[123],"$(p)[l]$":[131],"similar":[135],"way":[136],"by":[137],"system":[139],"h(p_1,l_1),$$":[147],"isomorphic":[149],"infinitely":[155],"many":[156],"$q$?":[157],"In":[158],"this":[159],"paper":[160],"we":[161],"show":[162],"answer":[165],"negative":[170],"graphs":[173,201,216],"$\\Gamma_{\\mathbb{F}_p}(p_1\\ell_1,":[174],"p_1\\ell_1p_2(p_1":[175],"p_2":[177],"p_1p_2))$":[179],"provide":[180],"example":[183],"$p":[185],"\\equiv":[186],"1":[187],"\\pmod{3}$.":[188],"Our":[189],"argument":[190],"based":[192],"on":[193],"proving":[194],"automorphism":[197,213],"group":[198,214],"these":[200],"has":[202],"order":[203,210],"$p$,":[204],"which":[205],"smallest":[208],"form":[219],"$\\Gamma_{\\mathbb{F}}(f,":[220],"g)$.":[221]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
