{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:49:57Z","timestamp":1780822197760,"version":"3.54.1"},"reference-count":51,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:00:00Z","timestamp":1772755200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002661","name":"FNRS","doi-asserted-by":"publisher","award":["T003325F"],"award-info":[{"award-number":["T003325F"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["11251528"],"award-info":[{"award-number":["11251528"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020884","name":"ANID","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"DFG","doi-asserted-by":"publisher","award":["522790373"],"award-info":[{"award-number":["522790373"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.ejc.2026.104367","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T08:46:02Z","timestamp":1773132362000},"page":"104367","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements"],"prefix":"10.1016","volume":"135","author":[{"given":"Sofia","family":"Brenner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean","family":"Cardinal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"McConville","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arturo","family":"Merino","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"M\u00fctze","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2026.104367_b1","unstructured":"The Combinatorial Object Server: Generate signed permutations. http:\/\/www.combos.org\/sperm."},{"key":"10.1016\/j.ejc.2026.104367_b2","first-page":"xiv+363","article-title":"Combinatorics of coxeter groups","volume":"vol. 231","author":"Bj\u00f6rner","year":"2005"},{"issue":"3","key":"10.1016\/j.ejc.2026.104367_b3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02187790","article-title":"Hyperplane arrangements with a lattice of regions","volume":"5","author":"Bj\u00f6rner","year":"1990","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"10.1016\/j.ejc.2026.104367_b4","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1137\/23M1546567","article-title":"Combinatorial generation via permutation languages. V. Acyclic orientations","volume":"37","author":"Cardinal","year":"2023","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/j.ejc.2026.104367_b5","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/3689633","article-title":"Combinatorial generation via permutation languages. IV. Elimination trees","volume":"21","author":"Cardinal","year":"2025","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.ejc.2026.104367_b6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ejc.2024.104090","article-title":"Rectangulotopes","volume":"125","author":"Cardinal","year":"2025","journal-title":"European J. Combin."},{"issue":"2","key":"10.1016\/j.ejc.2026.104367_b7","first-page":"22\u00a0pp.","article-title":"A note on flips in diagonal rectangulations","volume":"20","author":"Cardinal","year":"2018","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.ejc.2026.104367_b8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01788686","article-title":"Gray codes for reflection groups","volume":"5","author":"Conway","year":"1989","journal-title":"Graphs Combin."},{"issue":"2","key":"10.1016\/j.ejc.2026.104367_b9","first-page":"617","article-title":"A partial order on the regions of Rn\u00a0dissected by hyperplanes","volume":"283","author":"Edelman","year":"1984","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104367_b10","series-title":"Geometric Combinatorics","first-page":"63","article-title":"Root systems and generalized associahedra","volume":"vol. 13","author":"Fomin","year":"2007"},{"key":"10.1016\/j.ejc.2026.104367_b11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.jalgebra.2012.03.020","article-title":"Algebraic and combinatorial structures on pairs of twin binary trees","volume":"360","author":"Giraudo","year":"2012","journal-title":"J. Algebra"},{"key":"10.1016\/j.ejc.2026.104367_b12","series-title":"Pulse code communication","author":"Gray","year":"1953"},{"issue":"1","key":"10.1016\/j.ejc.2026.104367_b13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1090\/S0002-9947-1983-0712251-1","article-title":"On the interpretation of whitney numbers through arrangements of hyperplanes, zonotopes, non-radon partitions, and orientations of graphs","volume":"280","author":"Greene","year":"1983","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104367_b14","doi-asserted-by":"crossref","first-page":"40\u00a0pp.","DOI":"10.1016\/j.ejc.2024.104020","article-title":"Combinatorial generation via permutation languages. VI. Binary trees","volume":"122","author":"Gregor","year":"2024","journal-title":"European J. Combin."},{"issue":"4","key":"10.1016\/j.ejc.2026.104367_b15","doi-asserted-by":"crossref","first-page":"2255","DOI":"10.1090\/tran\/8199","article-title":"Combinatorial generation via permutation languages. I. Fundamentals","volume":"375","author":"Hartung","year":"2022","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.ejc.2026.104367_b16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.tcs.2005.01.012","article-title":"The algebra of binary search trees","volume":"339","author":"Hivert","year":"2005","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ejc.2026.104367_b17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s11856-021-2186-1","article-title":"Combinatorial generation via permutation languages. II. Lattice congruences","volume":"244","author":"Hoang","year":"2021","journal-title":"Israel J. Math."},{"key":"10.1016\/j.ejc.2026.104367_b18","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","article-title":"Generation of permutations by adjacent transposition","volume":"17","author":"Johnson","year":"1963","journal-title":"Math. Comp."},{"key":"10.1016\/j.ejc.2026.104367_b19","series-title":"The Art of Computer Programming. Vol. 4A. Combinatorial Algorithms. Part 1","first-page":"xv+883","author":"Knuth","year":"2011"},{"key":"10.1016\/j.ejc.2026.104367_b20","series-title":"Hamiltonian cycles in simplicial and supersolvable hyperplane arrangements","author":"K\u00f6rber","year":"2025"},{"issue":"103","key":"10.1016\/j.ejc.2026.104367_b21","doi-asserted-by":"crossref","first-page":"37","DOI":"10.2298\/PIM1103037K","article-title":"A loopless implementation of a gray code for signed permutations","volume":"89","author":"Korsh","year":"2011","journal-title":"Publ. Inst. Math. (Beograd) (N.S.)"},{"issue":"3","key":"10.1016\/j.ejc.2026.104367_b22","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1016\/j.jcta.2011.09.006","article-title":"The Hopf algebra of diagonal rectangulations","volume":"119","author":"Law","year":"2012","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"10.1016\/j.ejc.2026.104367_b23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s00013-004-1026-y","article-title":"Realization of the Stasheff polytope","volume":"83","author":"Loday","year":"2004","journal-title":"Arch. Math. (Basel)"},{"issue":"3","key":"10.1016\/j.ejc.2026.104367_b24","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1006\/jagm.1993.1045","article-title":"On rotations and the generation of binary trees","volume":"15","author":"Lucas","year":"1993","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/j.ejc.2026.104367_b25","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00454-022-00393-w","article-title":"Combinatorial generation via permutation languages. III. Rectangulations","volume":"70","author":"Merino","year":"2023","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.ejc.2026.104367_b26","first-page":"xx+433","article-title":"Associahedra, Tamari lattices and related structures","volume":"vol. 299","year":"2012"},{"issue":"Dynamic Surveys","key":"10.1016\/j.ejc.2026.104367_b27","article-title":"Combinatorial Gray codes\u2014an updated survey","volume":"DS26","author":"M\u00fctze","year":"2023","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.ejc.2026.104367_b28","first-page":"xviii+325","article-title":"Arrangements of hyperplanes","volume":"vol. 300","author":"Orlik","year":"1992"},{"issue":"9","key":"10.1016\/j.ejc.2026.104367_b29","doi-asserted-by":"crossref","first-page":"7686","DOI":"10.1093\/imrn\/rnac042","article-title":"Shard polytopes","author":"Padrol","year":"2023","journal-title":"Int. Math. Res. Not. IMRN"},{"issue":"4","key":"10.1016\/j.ejc.2026.104367_b30","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1007\/s00026-024-00697-z","article-title":"Acyclic reorientation lattices and their lattice quotients","volume":"28","author":"Pilaud","year":"2024","journal-title":"Ann. Comb."},{"issue":"2","key":"10.1016\/j.ejc.2026.104367_b31","first-page":"173","article-title":"Permutrees","volume":"1","author":"Pilaud","year":"2018","journal-title":"Algebr. Comb."},{"issue":"3","key":"10.1016\/j.ejc.2026.104367_b32","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1112\/blms.12231","article-title":"Quotientopes","volume":"51","author":"Pilaud","year":"2019","journal-title":"Bull. Lond. Math. Soc."},{"issue":"5\u20136","key":"10.1016\/j.ejc.2026.104367_b33","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s00013-023-01895-6","article-title":"Celebrating Loday\u2019s associahedron","volume":"121","author":"Pilaud","year":"2023","journal-title":"Arch. Math. (Basel)"},{"key":"10.1016\/j.ejc.2026.104367_b34","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.aim.2014.02.035","article-title":"The diameter of associahedra","volume":"259","author":"Pournin","year":"2014","journal-title":"Adv. Math."},{"issue":"2","key":"10.1016\/j.ejc.2026.104367_b35","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.aim.2005.07.010","article-title":"Cambrian lattices","volume":"205","author":"Reading","year":"2006","journal-title":"Adv. Math."},{"issue":"4","key":"10.1016\/j.ejc.2026.104367_b36","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/j.ejc.2011.11.004","article-title":"Generic rectangulations","volume":"33","author":"Reading","year":"2012","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2026.104367_b37","first-page":"399","article-title":"Lattice theory of the poset of regions","volume":"vol. 2","author":"Reading","year":"2016"},{"issue":"4","key":"10.1016\/j.ejc.2026.104367_b38","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S0036144595295272","article-title":"A survey of combinatorial Gray codes","volume":"39","author":"Savage","year":"1997","journal-title":"SIAM Rev."},{"key":"10.1016\/j.ejc.2026.104367_b39","series-title":"Proceedings of the Twenty-Fourth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1993)","first-page":"185","article-title":"Gray code results for acyclic orientations","volume":"96","author":"Savage","year":"1993"},{"issue":"1\u20132","key":"10.1016\/j.ejc.2026.104367_b40","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0196-8858(02)00522-5","article-title":"A type-B associahedron","volume":"30","author":"Simion","year":"2003","journal-title":"Adv. in Appl. Math."},{"issue":"3","key":"10.1016\/j.ejc.2026.104367_b41","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0894-0347-1988-0928904-4","article-title":"Rotation distance, triangulations, and hyperbolic geometry","volume":"1","author":"Sleator","year":"1988","journal-title":"J. Amer. Math. Soc."},{"key":"10.1016\/j.ejc.2026.104367_b42","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02945028","article-title":"Supersolvable lattices","volume":"2","author":"Stanley","year":"1972","journal-title":"Algebra Universalis"},{"key":"10.1016\/j.ejc.2026.104367_b43","series-title":"Geometric Combinatorics","first-page":"389","article-title":"An introduction to hyperplane arrangements","volume":"vol. 13","author":"Stanley","year":"2007"},{"key":"10.1016\/j.ejc.2026.104367_b44","series-title":"One Hundred Problems in Elementary Mathematics","first-page":"174","author":"Steinhaus","year":"1964"},{"issue":"1","key":"10.1016\/j.ejc.2026.104367_b45","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.disc.2018.09.029","article-title":"Signed graphs and the freeness of the Weyl subarrangements of type B\u2113","volume":"342","author":"Suyama","year":"2019","journal-title":"Discrete Math."},{"issue":"8","key":"10.1016\/j.ejc.2026.104367_b46","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/368637.368660","article-title":"Algorithm 115: Perm","volume":"5","author":"Trotter","year":"1962","journal-title":"Commun. ACM"},{"issue":"9","key":"10.1016\/j.ejc.2026.104367_b47","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1080\/00029890.1996.12004816","article-title":"Fabian Stedman: the first group theorist?","volume":"103","author":"White","year":"1996","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/j.ejc.2026.104367_b48","series-title":"Algorithms and Data Structures","first-page":"525","article-title":"The greedy Gray code algorithm","volume":"vol. 8037","author":"Williams","year":"2013"},{"issue":"1","key":"10.1016\/j.ejc.2026.104367_b49","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","article-title":"Signed graphs","volume":"4","author":"Zaslavsky","year":"1982","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.ejc.2026.104367_b50","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0195-6698(13)80118-7","article-title":"Orientation of signed graphs","volume":"12","author":"Zaslavsky","year":"1991","journal-title":"European J. Combin."},{"issue":"1","key":"10.1016\/j.ejc.2026.104367_b51","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/eujc.2000.0418","article-title":"Supersolvable frame-matroid and graphic-lift lattices","volume":"22","author":"Zaslavsky","year":"2001","journal-title":"European J. Combin."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000351?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000351?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T12:18:26Z","timestamp":1776082706000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":51,"alternative-id":["S0195669826000351"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104367","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104367","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"104367"}}