{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T14:30:12Z","timestamp":1771338612490,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005721","name":"Universit\u00e4t Bielefeld","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005721","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its characteristic polynomial. We showcase our  implementation, based on , on examples coming from hyperplane arrangements with applications to physics and computer science.<\/jats:p>","DOI":"10.1007\/s00454-023-00557-2","type":"journal-article","created":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T15:02:24Z","timestamp":1699369344000},"page":"1356-1377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computing Characteristic Polynomials of Hyperplane Arrangements with Symmetries"],"prefix":"10.1007","volume":"70","author":[{"given":"Taylor","family":"Brysiewicz","sequence":"first","affiliation":[]},{"given":"Holger","family":"Eble","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6393-5610","authenticated-orcid":false,"given":"Lukas","family":"K\u00fchne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"issue":"2","key":"557_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1006\/aima.1996.0059","volume":"122","author":"ChA Athanasiadis","year":"1996","unstructured":"Athanasiadis, Ch.A.: Characteristic polynomials of subspace arrangements and finite fields. Adv. Math. 122(2), 193\u2013233 (1996)","journal-title":"Adv. Math."},{"issue":"4","key":"557_CR2","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1137\/19M1257792","volume":"1","author":"P Baldi","year":"2019","unstructured":"Baldi, P., Vershynin, R.: Polynomial threshold functions, hyperplane arrangements, and random tensors. SIAM J. Math. Data Sci. 1(4), 699\u2013729 (2019)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"1","key":"557_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017)","journal-title":"SIAM Rev."},{"key":"557_CR4","unstructured":"Billera, L.J., Moore, J.T., Moraites, C.D., Wang, Y., Williams, K.: Maximal unbalanced families (2012). arXiv:1209.2309"},{"issue":"1","key":"557_CR5","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1112\/S1461157014000400","volume":"17","author":"D Bremner","year":"2014","unstructured":"Bremner, D., Dutour Sikiri\u0107, M., Pasechnik, D.V., Rehn, Th., Sch\u00fcrmann, A.: Computing symmetry groups of polyhedra. LMS J. Comput. Math. 17(1), 565\u2013581 (2014)","journal-title":"LMS J. Comput. Math."},{"key":"557_CR6","doi-asserted-by":"crossref","unstructured":"Bremner, D., Dutour Sikiri\u0107, M., Sch\u00fcrmann, A.: Polyhedral representation conversion up to symmetries. In: Polyhedral Computation (Montr\u00e9al 2006). CRM Proc. Lecture Notes, vol. 48, pp. 45\u201371. American Mathematical Society, Providence (2009)","DOI":"10.1090\/crmp\/048\/03"},{"issue":"2","key":"557_CR7","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1090\/S0002-9947-1977-0468931-6","volume":"234","author":"T Brylawski","year":"1977","unstructured":"Brylawski, T.: The broken-circuit complex. Trans. Am. Math. Soc. 234(2), 417\u2013433 (1977)","journal-title":"Trans. Am. Math. Soc."},{"issue":"6","key":"557_CR8","doi-asserted-by":"publisher","first-page":"# 39","DOI":"10.1007\/JHEP06(2019)039","volume":"2019","author":"F Cachazo","year":"2019","unstructured":"Cachazo, F., Early, N., Guevara, A., Mizera, S.: Scattering equations: from projective spaces to tropical Grassmannians. J. High Energy Phys. 2019(6), # 39 (2019)","journal-title":"J. High Energy Phys."},{"key":"557_CR9","doi-asserted-by":"crossref","unstructured":"Cachazo, F., Umbert, B., Zhang, Y.: Singular solutions in soft limits. J. High Energy Phys. 2020(5), # 148 (2020)","DOI":"10.1007\/JHEP05(2020)148"},{"key":"557_CR10","unstructured":"Chroman, Z., Singhal, M.: Computations associated with the resonance arrangement (2021). arXiv:2106.09940"},{"key":"557_CR11","unstructured":"Crapo, H.: The combinatorial theory of structures. In: Matroid Theory (Szeged 1982). Colloquia Mathematica Societatis J\u00e1nos Bolyai, vol. 40, pp. 107\u2013213. North-Holland, Amsterdam (1985)"},{"key":"557_CR12","volume-title":"On the Foundations of Combinatorial Theory: Combinatorial Geometries","author":"HH Crapo","year":"1970","unstructured":"Crapo, H.H., Rota, G.-C.: On the Foundations of Combinatorial Theory: Combinatorial Geometries. MIT Press, Cambridge (1970)"},{"key":"557_CR13","doi-asserted-by":"crossref","unstructured":"Cueto, M.A., Morton, J., Sturmfels, B.: Geometry of the restricted Boltzmann machine. In: Algebraic Methods in Statistics and Probability II (Urbana-Champaign 2009). Contemporary Mathematics, vol. 516, pp. 135\u2013153. American Mathematical Society, Providence (2010)","DOI":"10.1090\/conm\/516\/10172"},{"key":"557_CR14","unstructured":"Decker, W., Greuel, G.-M., Pfister, G., Sch\u00f6nemann, H.: Singular 4-2-0\u2014A computer algebra system for polynomial computations (2020). http:\/\/www.singular.uni-kl.de"},{"key":"557_CR15","doi-asserted-by":"crossref","unstructured":"Deza, A., Pournin, L.: A linear optimization oracle for zonotope computation. Comput. Geom. 100, #\u00a0101809 (2022)","DOI":"10.1016\/j.comgeo.2021.101809"},{"key":"557_CR16","unstructured":"Evans, T.: What is being calculated with thermal field theory? In: Particle Physics and Cosmology (Lake Louise 1994), pp. 343\u2013352. World Scientific, Singapore (1995)"},{"key":"557_CR17","doi-asserted-by":"crossref","unstructured":"Fieker, C., Hart, W., Hofmann, T., Johansson, F.: Nemo\/Hecke: computer algebra and number theory packages for the Julia programming language. In: 42nd International Symposium on Symbolic and Algebraic Computation (Kaiserslautern 2017), pp. 157\u2013164. ACM, New York (2017)","DOI":"10.1145\/3087604.3087611"},{"key":"557_CR18","doi-asserted-by":"crossref","unstructured":"Gawrilow, E., Joswig, M.: polymake: a framework for analyzing convex polytopes. In: Polytopes\u2014Combinatorics and Computation (Oberwolfach 1997). DMV Seminar, vol. 29, pp. 43\u201373. Birkh\u00e4user, Basel (2000)","DOI":"10.1007\/978-3-0348-8438-9_2"},{"issue":"1","key":"557_CR19","doi-asserted-by":"publisher","first-page":"# P1.12","DOI":"10.37236\/8759","volume":"28","author":"SC Gutekunst","year":"2021","unstructured":"Gutekunst, S.C., M\u00e9sz\u00e1ros, K., Petersen, T.K.: Root cones and the resonance arrangement. Electron. J. Comb. 28(1), # P1.12 (2021)","journal-title":"Electron. J. Comb."},{"key":"557_CR20","unstructured":"Halperin, D., Sharir, M.: Arrangements. In: Handbook of Discrete and Computational Geometry, 3rd edn, pp. 723\u2013762 (chapter 28). Chapman & Hall\/CRC, Boca Raton (2018)"},{"issue":"3","key":"557_CR21","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1007\/s00208-011-0777-6","volume":"354","author":"J Huh","year":"2012","unstructured":"Huh, J., Katz, E.: Log-concavity of characteristic polynomials and the Bergman fan of matroids. Math. Ann. 354(3), 1103\u20131116 (2012)","journal-title":"Math. Ann."},{"key":"557_CR22","unstructured":"Jefferson, Ch.: ferret\u2014GAP package, v. 1.0.2 (2019). https:\/\/gap-packages.github.io\/ferret\/"},{"key":"557_CR23","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.jalgebra.2018.11.009","volume":"521","author":"Ch Jefferson","year":"2019","unstructured":"Jefferson, Ch., Jonauskyte, E., Pfeiffer, M., Waldecker, R.: Minimal and canonical images. J. Algebra 521, 481\u2013506 (2019)","journal-title":"J. Algebra"},{"key":"557_CR24","unstructured":"Jefferson, Ch., Pfeiffer, M., Waldecker, R., Jonauskyte, E.: images\u2014GAP package, v. 1.3.0 (2019). https:\/\/gap-packages.github.io\/images\/"},{"key":"557_CR25","doi-asserted-by":"crossref","unstructured":"Jensen, A.N.: Traversing symmetric polyhedral fans. In: 3rd International Congress on Mathematical Software (Kobe 2010). Lecture Notes in Computer Science, vol. 6327, pp. 282\u2013294. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15582-6_47"},{"issue":"3","key":"557_CR26","doi-asserted-by":"publisher","first-page":"# P3.6","DOI":"10.37236\/7318","volume":"25","author":"Ch Jordan","year":"2018","unstructured":"Jordan, Ch., Joswig, M., Kastner, L.: Parallel enumeration of triangulations. Electron. J. Comb. 25(3), # P3.6 (2018)","journal-title":"Electron. J. Comb."},{"key":"557_CR27","doi-asserted-by":"crossref","unstructured":"Kaluba, M., Lorenz, B., Timme, S.: Polymake.jl: a new interface to polymake. In: 7th International Conference on Mathematical Software (Braunschweig 2020). Lecture Notes in Computer Science, vol. 12097, pp. 377\u2013385. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-52200-1_37"},{"issue":"2","key":"557_CR28","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.aam.2010.11.002","volume":"47","author":"H Kamiya","year":"2011","unstructured":"Kamiya, H., Takemura, A., Terao, H.: Ranking patterns of unfolding models of codimension one. Adv. Appl. Math. 47(2), 379\u2013400 (2011)","journal-title":"Adv. Appl. Math."},{"key":"557_CR29","doi-asserted-by":"crossref","unstructured":"Kastner, L., Panizzut, M.: Hyperplane arrangements in polymake. In: 7th International Conference on Mathematical Software (Braunschweig 2020). Lecture Notes in Computer Science, vol. 12097, pp. 232\u2013240. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-52200-1_23"},{"issue":"3","key":"557_CR30","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s00454-011-9363-7","volume":"46","author":"CJ Klivans","year":"2011","unstructured":"Klivans, C.J., Swartz, E.: Projection volumes of hyperplane arrangements. Discrete Comput. Geom. 46(3), 417\u2013426 (2011)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"557_CR31","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/s00026-012-0161-6","volume":"16","author":"H Koizumi","year":"2012","unstructured":"Koizumi, H., Numata, Y., Takemura, A.: On intersection lattices of hyperplane arrangements generated by generic points. Ann. Comb. 16(4), 789\u2013813 (2012)","journal-title":"Ann. Comb."},{"key":"557_CR32","first-page":"# 75","volume":"85B","author":"L K\u00fchne","year":"2021","unstructured":"K\u00fchne, L.: The universality of the resonance arrangement and its Betti numbers. S\u00e9m. Lothar. Comb. 85B, # 75 (2021)","journal-title":"S\u00e9m. Lothar. Comb."},{"key":"557_CR33","unstructured":"Leuner, M.: alcove\u2014GAP package (2019). https:\/\/github.com\/martin-leuner\/alcove"},{"issue":"4","key":"557_CR34","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s00013-018-1283-9","volume":"112","author":"T M\u00f6ller","year":"2019","unstructured":"M\u00f6ller, T., R\u00f6hrle, G.: Counting chambers in restricted Coxeter arrangements. Arch. Math. (Basel) 112(4), 347\u2013359 (2019)","journal-title":"Arch. Math. (Basel)"},{"key":"557_CR35","first-page":"2405","volume":"16","author":"G Mont\u00fafar","year":"2015","unstructured":"Mont\u00fafar, G., Ay, N., Ghazi-Zahedi, K.: Geometry and expressive power of conditional restricted Boltzmann machines. J. Mach. Learn. Res. 16, 2405\u20132436 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"557_CR36","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1137\/140957081","volume":"29","author":"GF Mont\u00fafar","year":"2015","unstructured":"Mont\u00fafar, G.F., Morton, J.: When does a mixture of products contain a product of mixtures? SIAM J. Discrete Math. 29(1), 321\u2013347 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"557_CR37","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01392549","volume":"56","author":"P Orlik","year":"1980","unstructured":"Orlik, P., Solomon, L.: Combinatorics and topology of complements of hyperplanes. Invent. Math. 56(2), 167\u2013189 (1980)","journal-title":"Invent. Math."},{"key":"557_CR38","series-title":"Grundlehren der Mathematischen Wissenschaften","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02772-1","volume-title":"Arrangements of Hyperplanes","author":"P Orlik","year":"1992","unstructured":"Orlik, P., Terao, H.: Arrangements of Hyperplanes. Grundlehren der Mathematischen Wissenschaften, vol. 300. Springer, Berlin (1992)"},{"key":"557_CR39","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.jctb.2018.09.001","volume":"135","author":"R Pendavingh","year":"2019","unstructured":"Pendavingh, R., van der Pol, J.: Asymptotics of symmetry in matroids. J. Comb. Theory B 135, 349\u2013365 (2019)","journal-title":"J. Comb. Theory B"},{"issue":"1\u20132","key":"557_CR40","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1006\/jcta.2000.3106","volume":"91","author":"A Postnikov","year":"2000","unstructured":"Postnikov, A., Stanley, R.P.: Deformations of Coxeter hyperplane arrangements. J. Comb. Theory A 91(1\u20132), 544\u2013597 (2000)","journal-title":"J. Comb. Theory A"},{"key":"557_CR41","unstructured":"Sarnoff, J.: SaferIntegers\u2014julia package, v. 2.5.3 (2021). https:\/\/github.com\/JeffreySarnoff\/SaferIntegers.jl"},{"issue":"2","key":"557_CR42","first-page":"137","volume":"6","author":"NH Sleumer","year":"1999","unstructured":"Sleumer, N.H.: Output-sensitive cell enumeration in hyperplane arrangements. Nord. J. Comput. 6(2), 137\u2013147 (1999)","journal-title":"Nord. J. Comput."},{"issue":"3","key":"557_CR43","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0001-8708(87)90011-9","volume":"64","author":"L Solomon","year":"1987","unstructured":"Solomon, L., Terao, H.: A formula for the characteristic polynomial of an arrangement. Adv. Math. 64(3), 305\u2013325 (1987)","journal-title":"Adv. Math."},{"key":"557_CR44","unstructured":"Stein, W.A.: Sage Mathematics Software, version x.y.z. The Sage Development Team (2021). http:\/\/www.sagemath.org"},{"key":"557_CR45","doi-asserted-by":"crossref","unstructured":"Yoshinaga, M.: Hyperplane arrangements and Lefschetz\u2019s hyperplane section theorem. Kodai Math. J. 30(2), 157\u2013194 (2007)","DOI":"10.2996\/kmj\/1183475510"},{"issue":"2","key":"557_CR46","doi-asserted-by":"publisher","first-page":"483","DOI":"10.5802\/afst.1413","volume":"23","author":"M Yoshinaga","year":"2014","unstructured":"Yoshinaga, M.: Freeness of hyperplane arrangements and related topics. Ann. Fac. Sci. Toulouse Math. 23(2), 483\u2013512 (2014)","journal-title":"Ann. Fac. Sci. Toulouse Math."},{"key":"557_CR47","series-title":"Memoirs of the American Mathematical Society","volume-title":"Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes","author":"Th Zaslavsky","year":"1975","unstructured":"Zaslavsky, Th.: Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes. Memoirs of the American Mathematical Society, vol. 154. American Mathematical Society, Providence (1975)"},{"issue":"4","key":"557_CR48","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1515\/dma.1992.2.4.427","volume":"2","author":"YuA Zuev","year":"1992","unstructured":"Zuev, Yu.A.: Methods of geometry and probabilistic combinatorics in threshold logic. Discrete Math. Appl. 2(4), 427\u2013438 (1992)","journal-title":"Discrete Math. Appl."},{"issue":"2","key":"557_CR49","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1109\/TNN.2004.824419","volume":"15","author":"J Zunic","year":"2004","unstructured":"Zunic, J.: On encoding and enumerating threshold functions. IEEE Trans. Neural Netw. 15(2), 261\u2013267 (2004)","journal-title":"IEEE Trans. Neural Netw."},{"key":"557_CR50","unstructured":"GAP\u2014Groups, Algorithms, and Programming, v. 4.10.2 (2019). http:\/\/www.gap-system.org"},{"key":"557_CR51","unstructured":"OSCAR\u2014Computer Algebra System, v. 0.5.2 (2021). https:\/\/oscar.computeralgebra.de"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00557-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-023-00557-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-023-00557-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T23:05:44Z","timestamp":1700953544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-023-00557-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["557"],"URL":"https:\/\/doi.org\/10.1007\/s00454-023-00557-2","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"25 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}