Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders

Bibliographic Details
Main Authors: Kamber, Amitay, Kaufman, Tali
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing 2022
Online Access:https://hdl.handle.net/1721.1/146442
_version_ 1826211180148948992
author Kamber, Amitay
Kaufman, Tali
author2 Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
author_facet Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Kamber, Amitay
Kaufman, Tali
author_sort Kamber, Amitay
collection MIT
first_indexed 2024-09-23T15:02:09Z
format Article
id mit-1721.1/146442
institution Massachusetts Institute of Technology
language English
last_indexed 2024-09-23T15:02:09Z
publishDate 2022
publisher ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
record_format dspace
spelling mit-1721.1/1464422023-02-16T16:51:52Z Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders Kamber, Amitay Kaufman, Tali Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory 2022-11-15T15:22:20Z 2022-11-15T15:22:20Z 2022-06-09 2022-11-03T12:17:37Z Article http://purl.org/eprint/type/ConferencePaper 978-1-4503-9264-8 https://hdl.handle.net/1721.1/146442 Kamber, Amitay and Kaufman, Tali. 2022. "Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders." PUBLISHER_POLICY en https://doi.org/10.1145/3519935.3519992 Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. The author(s) application/pdf ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
spellingShingle Kamber, Amitay
Kaufman, Tali
Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders
title Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders
title_full Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders
title_fullStr Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders
title_full_unstemmed Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders
title_short Combinatorics via Closed Orbits: Number Theoretic Ramanujan Graphs Are Not Unique Neighbor Expanders
title_sort combinatorics via closed orbits number theoretic ramanujan graphs are not unique neighbor expanders
url https://hdl.handle.net/1721.1/146442
work_keys_str_mv AT kamberamitay combinatoricsviaclosedorbitsnumbertheoreticramanujangraphsarenotuniqueneighborexpanders
AT kaufmantali combinatoricsviaclosedorbitsnumbertheoreticramanujangraphsarenotuniqueneighborexpanders