{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:50:58Z","timestamp":1781077858781,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649617","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"95-105","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Strong Algebras and Radical Sylvester-Gallai Configurations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8917-8689","authenticated-orcid":false,"given":"Rafael","family":"Oliveira","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0459-4411","authenticated-orcid":false,"given":"Akash Kumar","family":"Sengupta","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.32"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/932"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/tran"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520025"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993705"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-018-0039-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.10.004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02112289"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3235586.3235599"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2019.v015a013"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2021.11"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Zeev Dvir Ankit Garg Rafael Oliveira and J\u00f3zsef Solymosi. 2018. Rank bounds for design matrices with block entries and geometric applications. Discrete Analysis.","DOI":"10.19086\/da.3118"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Zeev Dvir Shubhangi Saraf and Avi Wigderson. 2014. Improved rank bounds for design matrices and a new proof of Kelly\u2019s theorem. In Forum of Mathematics Sigma. 2.","DOI":"10.1017\/fms.2014.2"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/05063605X"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-039-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1226-7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306208"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_37"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2018.v014a018"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/2303021"},{"key":"e_1_3_2_1_22_1","volume-title":"Radical Sylvester-Gallai Theorem for Tuples of Quadratics. In 38th Computational Complexity Conference (CCC","author":"Garg Abhibhav","year":"2023","unstructured":"Abhibhav Garg, Rafael Oliveira, Shir Peleg, and Akash Kumar Sengupta. 2023. Radical Sylvester-Gallai Theorem for Tuples of Quadratics. In 38th Computational Complexity Conference (CCC 2023)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-013-9518-9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6_3"},{"key":"e_1_3_2_1_25_1","first-page":"130","article-title":"Algebraic Geometric Techniques for Depth-4 PIT & Sylvester-Gallai Conjectures for Varieties","volume":"21","author":"Gupta Ankit","year":"2014","unstructured":"Ankit Gupta. 2014. Algebraic Geometric Techniques for Depth-4 PIT & Sylvester-Gallai Conjectures for Varieties.. In Electron. Colloquium Comput. Complex.. 21, 130.","journal-title":"Electron. Colloquium Comput. Complex.."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/140957123"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055440"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.7146\/math.scand.a-10758"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Robin Hartshorne. 1977. Algebraic Geometry. Springer-Verlag.","DOI":"10.1007\/978-1-4757-3849-0"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804674"},{"key":"e_1_3_2_1_31_1","volume-title":"Arithmetic and geometry","author":"Hirzebruch Friedrich","unstructured":"Friedrich Hirzebruch. 1983. Arrangements of lines and algebraic surfaces. In Arithmetic and geometry. Springer, 113\u2013140."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780595"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.67"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187687"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90014-9"},{"key":"e_1_3_2_1_36_1","volume-title":"Equivalence of polynomial identity testing and polynomial factorization. computational complexity, 24","author":"Kopparty Swastik","year":"2015","unstructured":"Swastik Kopparty, Shubhangi Saraf, and Amir Shpilka. 2015. Equivalence of polynomial identity testing and polynomial factorization. computational complexity, 24 (2015), 295\u2013331."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00083"},{"key":"e_1_3_2_1_38_1","volume-title":"The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in mathematics, 46, 3","author":"Mayr Ernst W","year":"1982","unstructured":"Ernst W Mayr and Albert R Meyer. 1982. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in mathematics, 46, 3 (1982), 305\u2013329."},{"key":"e_1_3_2_1_39_1","first-page":"461","article-title":"Uber vielseite der projektiven ebene","volume":"5","author":"Melchior Eberhard","year":"1940","unstructured":"Eberhard Melchior. 1940. Uber vielseite der projektiven ebene. Deutsche Math, 5 (1940), 461\u2013475.","journal-title":"Deutsche Math"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/864"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Rafael Oliveira and Akash Sengupta. 2022. Radical Sylvester-Gallai theorem for cubics. FOCS.","DOI":"10.1109\/FOCS54457.2022.00027"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Rafael Oliveira and Akash Kumar Sengupta. 2023. Strong Algebras and Radical Sylvester-Gallai Configurations. arXiv preprint https:\/\/arxiv.org\/pdf\/2310.03993.pdf.","DOI":"10.1145\/3618260.3649617"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451013"},{"key":"e_1_3_2_1_44_1","first-page":"e112","article-title":"A generalized Sylvester\u2013Gallai-type theorem for quadratic polynomials. In Forum of Mathematics","volume":"10","author":"Peleg Shir","year":"2022","unstructured":"Shir Peleg and Amir Shpilka. 2022. A generalized Sylvester\u2013Gallai-type theorem for quadratic polynomials. In Forum of Mathematics, Sigma. 10, e112.","journal-title":"Sigma."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"L. M. Pretorius and K. J. Swanepoel. 2009. The Sylvester-Gallai theorem colourings and algebra.. Discret. Math..","DOI":"10.1016\/j.disc.2007.12.027"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146684"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Alexander A Razborov. 1992. On submodular complexity measures. Boolean Function Complexity (M. Paterson Ed.) 76\u201383.","DOI":"10.1017\/CBO9780511526633.007"},{"key":"e_1_3_2_1_48_1","first-page":"49","article-title":"Progress on Polynomial Identity Testing","volume":"99","author":"Saxena Nitin","year":"2009","unstructured":"Nitin Saxena. 2009. Progress on Polynomial Identity Testing.. Bull. EATCS, 99 (2009), 49\u201379.","journal-title":"Bull. EATCS"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Nitin Saxena. 2014. Progress on polynomial identity testing-II. Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume 131\u2013146.","DOI":"10.1007\/978-3-319-05446-9_7"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528403"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_52_1","first-page":"89","article-title":"Advanced problem 5359","volume":"73","author":"Serre Jean-Pierre","year":"1966","unstructured":"Jean-Pierre Serre. 1966. Advanced problem 5359. Amer. Math. Monthly, 73, 1 (1966), 89.","journal-title":"Amer. Math. Monthly"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Amir Shpilka. 2020. Sylvester-Gallai type theorems for quadratic polynomials. Discrete Analysis 14492.","DOI":"10.1145\/3313276.3316341"},{"key":"e_1_3_2_1_54_1","volume-title":"Arithmetic circuits: A survey of recent results and open questions. Foundations and Trends\u00ae in Theoretical Computer Science, 5, 3\u20134","author":"Shpilka Amir","year":"2010","unstructured":"Amir Shpilka and Amir Yehudayoff. 2010. Arithmetic circuits: A survey of recent results and open questions. Foundations and Trends\u00ae in Theoretical Computer Science, 5, 3\u20134 (2010), 207\u2013388."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/2982445.2982476"},{"key":"e_1_3_2_1_56_1","first-page":"256","article-title":"Mathematical question 11851","volume":"59","author":"Sylvester James Joseph","year":"1893","unstructured":"James Joseph Sylvester. 1893. Mathematical question 11851. Educational Times, 59, 98 (1893), 256.","journal-title":"Educational Times"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.09.004"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649617","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:47Z","timestamp":1750178207000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":58,"alternative-id":["10.1145\/3618260.3649617","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649617","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}