{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T19:09:12Z","timestamp":1780600152499,"version":"3.54.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:00:00Z","timestamp":1710720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:00:00Z","timestamp":1710720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006260","name":"Technion - Israel Institute of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006260","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We initiate the study of Boolean function analysis on high-dimensional expanders. We give a random-walk based definition of high-dimensional expansion, which coincides with the earlier definition in terms of two-sided link expanders. Using this definition, we describe an analog of the Fourier expansion and the Fourier levels of the Boolean hypercube for simplicial complexes. Our analog is a decomposition into approximate eigenspaces of random walks associated with the simplicial complexes. Our random-walk definition and the decomposition have the additional advantage that they extend to the more general setting of posets, encompassing both high-dimensional expanders and the Grassmann poset, which appears in recent work on the unique games conjecture. We then use this decomposition to extend the Friedgut\u2013Kalai\u2013Naor theorem to high-dimensional expanders. Our results demonstrate that a constant-degree high-dimensional expander can sometimes serve as a sparse model for the Boolean slice or hypercube, and quite possibly additional results from Boolean function analysis can be carried over to this sparse model. Therefore, this model can be viewed as a derandomization of the Boolean slice, containing only <jats:inline-formula><jats:alternatives><jats:tex-math>$$|X(k-1)|=O(n)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>|<\/mml:mo>\n                    <mml:mi>X<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>k<\/mml:mi>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>)<\/mml:mo>\n                    <mml:mo>|<\/mml:mo>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mi>O<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> points in contrast to <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\left( {\\begin{array}{c}n\\\\ k\\end{array}}\\right) $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mfenced>\n                    <mml:mrow>\n                      <mml:mtable>\n                        <mml:mtr>\n                          <mml:mtd>\n                            <mml:mi>n<\/mml:mi>\n                          <\/mml:mtd>\n                        <\/mml:mtr>\n                        <mml:mtr>\n                          <mml:mtd>\n                            <mml:mrow>\n                              <mml:mrow\/>\n                              <mml:mi>k<\/mml:mi>\n                            <\/mml:mrow>\n                          <\/mml:mtd>\n                        <\/mml:mtr>\n                      <\/mml:mtable>\n                    <\/mml:mrow>\n                  <\/mml:mfenced>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> points in the (<jats:italic>k<\/jats:italic>)-slice (which consists of all <jats:italic>n<\/jats:italic>-bit strings with exactly <jats:italic>k<\/jats:italic> ones).<\/jats:p>","DOI":"10.1007\/s00493-024-00084-5","type":"journal-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T14:01:44Z","timestamp":1710770504000},"page":"563-620","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Boolean Function Analysis on High-Dimensional Expanders"],"prefix":"10.1007","volume":"44","author":[{"given":"Yotam","family":"Dikstein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Irit","family":"Dinur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Filmus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prahladh","family":"Harsha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,18]]},"reference":[{"key":"84_CR1","doi-asserted-by":"publisher","unstructured":"Abdolazimi, D., Liu, K., Oveis-Gharan, S.: A matrix trickle-down theorem on simplicial complexes and applications to sampling colorings. In: Nelson, J. (ed.) Proceedings of 63rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 161\u2013172. (2022). https:\/\/doi.org\/10.1109\/FOCS52979","DOI":"10.1109\/FOCS52979"},{"key":"84_CR2","doi-asserted-by":"publisher","unstructured":"Alev, V.L., Jeronimo, F.G., Tulsiani, M.: Approximating constraint satisfaction problems on high-dimensional expanders. In: Zuckerman, D. (ed.) Proceedings of 60th IEEE Symposium on Foundations of Computer Science (FOCS), pp 180\u2013201. (2019). https:\/\/doi.org\/10.1109\/FOCS.2019","DOI":"10.1109\/FOCS.2019"},{"key":"84_CR3","doi-asserted-by":"publisher","unstructured":"Anari, N., Liu, K., Oveis-Gharan, S., Vinzant, C.: Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid. In: Charikar , M., and Cohen, E. (eds.) Proceedings of 51st ACM Symposium on Theory of Computing (STOC), pp. 1\u201312. (2019). https:\/\/doi.org\/10.1145\/3313276.3316385","DOI":"10.1145\/3313276.3316385"},{"key":"84_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/20M1367696","author":"N Anari","year":"2020","unstructured":"Anari, N., Liu, K., Oveis-Gharan, S.: Spectral independence in high-dimensional expanders and applications to the hardcore model. SIAM J. Comput. (2020). https:\/\/doi.org\/10.1137\/20M1367696","journal-title":"SIAM J. Comput."},{"key":"84_CR5","doi-asserted-by":"publisher","unstructured":"Bafna, M., Hopkins, M., Kaufman, T., Lovett, S.: Hypercontractivity on high dimensional expanders. In: Leonardi, S., Gupta, A. (eds.) Proceedings of 54th ACM Symposium on Theory of Computing (STOC), pp. 185\u2013194. (2022). https:\/\/doi.org\/10.1145\/3519935.3520040","DOI":"10.1145\/3519935.3520040"},{"issue":"5","key":"84_CR6","doi-asserted-by":"publisher","first-page":"1287","DOI":"10.1137\/130929394","volume":"44","author":"B Barak","year":"2015","unstructured":"Barak, B., Gopalan, P., H\u00e5stad, J., Meka, R., Raghavendra, P., Steurer, D.: Making the long code shorter. SIAM J. Comput. 44(5), 1287\u20131324 (2015). https:\/\/doi.org\/10.1137\/130929394","journal-title":"SIAM J. Comput."},{"key":"84_CR7","doi-asserted-by":"publisher","unstructured":"Barak, B., Kothari, P., Steurer, D.: Small-set expansion in shortcode graph and the 2-to-2 conjecture. In: Blum, A. (ed.) Proceedings of 10th Innovations in Theoretical Computer Science (ITCS), vol. 124 of LIPIcs, pp. 9:1\u20139:12. Schloss Dagstuhl (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.9","DOI":"10.4230\/LIPIcs.ITCS.2019.9"},{"key":"84_CR8","series-title":"A Series of Modern Surveys in Mathematics (MATHE3)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"AE Brouwer","year":"1989","unstructured":"Brouwer, A.E., Cohen, A.M., Neumaier, A.: Distance-Regular Graphs. A Series of Modern Surveys in Mathematics (MATHE3), vol. 18. Springer, Berlin (1989). https:\/\/doi.org\/10.1007\/978-3-642-74341-2"},{"key":"84_CR9","doi-asserted-by":"publisher","unstructured":"Chen, Z., Galanis, A., Stefankovic, D., Vigoda, E.: Rapid mixing for colorings via spectral independence. In: Marx, D. (ed.) Proceedings of 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1548\u20131557 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.94","DOI":"10.1137\/1.9781611976465.94"},{"key":"84_CR10","doi-asserted-by":"publisher","unstructured":"Chen, Z., Liu, K., Vigoda, E.: Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion. In Khuller , S., Williams, V.V. (eds.) Proceedings of 53rd ACM Symposium on Theory of Computing (STOC), pp. 1537\u20131550. (2021). https:\/\/doi.org\/10.1145\/3406325.3451035","DOI":"10.1145\/3406325.3451035"},{"issue":"1","key":"84_CR11","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/20M136685X","volume":"52","author":"Z Chen","year":"2023","unstructured":"Chen, Z., Liu, K., Vigoda, E.: Rapid mixing of Glauber dynamics up to uniqueness via contraction. SIAM J. Comput. 52(1), 196\u2013237 (2023). https:\/\/doi.org\/10.1137\/20M136685X","journal-title":"SIAM J. Comput."},{"issue":"2","key":"84_CR12","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/s00039-004-0461-z","volume":"14","author":"W Ching","year":"2004","unstructured":"Ching, W., Li, W.: Ramanujan hypergraphs. Geom. Funct. Anal. 14(2), 380\u2013399 (2004). https:\/\/doi.org\/10.1007\/s00039-004-0461-z","journal-title":"Geom. Funct. Anal."},{"key":"84_CR13","doi-asserted-by":"publisher","unstructured":"Dikstein, Y., Dinur, I., Filmus, Y., Harsha, P.: Boolean function analysis on high-dimensional expanders. In: Blais, E., Jansen, K., Rolim, J.D.P., Steurer, D. (eds.) Proceedings of 22nd International Conference on Randomization and Computation (RANDOM), vol. 116 of LIPIcs, pp. 38:1\u201338:20. Schloss Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2018.38","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2018.38"},{"key":"84_CR14","doi-asserted-by":"publisher","unstructured":"Dikstein, Y., Dinur, I.: Agreement testing theorems on layered set systems. In: Zuckerman, D. (ed.) Proceedings of 60th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1495\u20131524. (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00088","DOI":"10.1109\/FOCS.2019.00088"},{"key":"84_CR15","doi-asserted-by":"publisher","unstructured":"Dinur, I., Kaufman, T.: High dimensional expanders imply agreement expanders. In: Umans, C. (ed.) Proceedings of 58th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 974\u2013985 (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.94","DOI":"10.1109\/FOCS.2017.94"},{"key":"84_CR16","doi-asserted-by":"publisher","unstructured":"Dinur, I., Khot, S., Kindler, G., Minzer, D., Safra, M.: On non-optimally expanding sets in Grassmann graphs. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) Proceedings of 50th ACM Symposium on Theory of Computing (STOC), pp. 940\u2013951 (2018). https:\/\/doi.org\/10.1145\/3188745.3188806","DOI":"10.1145\/3188745.3188806"},{"key":"84_CR17","doi-asserted-by":"publisher","unstructured":"Dinur, I., Khot, S., Kindler, G., Minzer, D., Safra, M.: Towards a proof of the 2-to-1 games conjecture? In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) Proceedings of 50th ACM Symposium on Theory of Computing (STOC), pp. 376\u2013389 (2018). https:\/\/doi.org\/10.1145\/3188745.3188804","DOI":"10.1145\/3188745.3188804"},{"key":"84_CR18","doi-asserted-by":"publisher","unstructured":"Dinur, I., Filmus, Y., Harsha, P.: Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests. In: Chan, T.M. (ed.) Proceedings of 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2124\u20132133 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.128","DOI":"10.1137\/1.9781611975482.128"},{"issue":"2","key":"84_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1137\/19M1276650","volume":"50","author":"I Dinur","year":"2021","unstructured":"Dinur, I., Harsha, P., Kaufman, T., Navon, I.L., TaShma, A.: List decoding with double samplers. SIAM J. Comput. 50(2), 301\u2013349 (2021). https:\/\/doi.org\/10.1137\/19M1276650","journal-title":"SIAM J. Comput."},{"key":"84_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10711-017-0291-4","volume":"195","author":"D Dotterrer","year":"2018","unstructured":"Dotterrer, D., Kaufman, T., Wagner, U.: On expansion and topological overlap. Geometriae Dedicata 195, 307\u2013317 (2018). https:\/\/doi.org\/10.1007\/s10711-017-0291-4","journal-title":"Geometriae Dedicata"},{"key":"84_CR21","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1512\/iumj.1976.25.25030","volume":"25","author":"C Dunkl","year":"1976","unstructured":"Dunkl, C.: A Krawtchouk polynomial addition theorem and wreath products of symmetric groups. Indiana Univ. Math. J. 25, 335\u2013358 (1976). https:\/\/doi.org\/10.1512\/iumj.1976.25.25030","journal-title":"Indiana Univ. Math. J."},{"issue":"5","key":"84_CR22","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00493-014-3027-1","volume":"35","author":"D Ellis","year":"2015","unstructured":"Ellis, D., Filmus, Y., Friedgut, E.: A quasi-stability result for dictatorships in $${S}_n$$. Combinatorica 35(5), 573\u2013618 (2015). https:\/\/doi.org\/10.1007\/s00493-014-3027-1","journal-title":"Combinatorica"},{"issue":"3","key":"84_CR23","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1002\/rsa.20515","volume":"46","author":"D Ellis","year":"2015","unstructured":"Ellis, D., Filmus, Y., Friedgut, E.: A stability result for balanced dictatorships in $${S}_n$$. Random Struct. Algorithm. 46(3), 494\u2013530 (2015). https:\/\/doi.org\/10.1002\/rsa.20515","journal-title":"Random Struct. Algorithm."},{"key":"84_CR24","doi-asserted-by":"publisher","unstructured":"Ellis, D., Filmus, Y., Friedgut, E.: Low degree Boolean functions on $${S}_n$$, with an application to isoperimetry. Forum Math. Sigma 5:e23 (2017). https:\/\/doi.org\/10.1017\/fms.2017.24","DOI":"10.1017\/fms.2017.24"},{"issue":"01","key":"84_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/S1793525317500078","volume":"09","author":"S Evra","year":"2017","unstructured":"Evra, S.: Finite quotients of Bruhat-Tits buildings as geometric expanders. J. Topol. Anal. 09(01), 51\u201366 (2017). https:\/\/doi.org\/10.1142\/S1793525317500078","journal-title":"J. Topol. Anal."},{"key":"84_CR26","doi-asserted-by":"publisher","unstructured":"Evra, S., Kaufman, T.: Bounded degree cosystolic expanders of every dimension. In: Proceeding of 48th ACM Symposium on Theory of Computing (STOC), pp. 36\u201348 (2016). https:\/\/doi.org\/10.1145\/2897518.2897543","DOI":"10.1145\/2897518.2897543"},{"key":"84_CR27","doi-asserted-by":"publisher","unstructured":"Feng, W., Guo, H., Yin, Y., Zhang, C.: Rapid mixing from spectral independence beyond the Boolean domain. ACM Trans. Algorithm. 18(3), 28:1\u201328:32 (2022). https:\/\/doi.org\/10.1145\/3531008","DOI":"10.1145\/3531008"},{"issue":"1","key":"84_CR28","first-page":"23","volume":"23","author":"Y Filmus","year":"2016","unstructured":"Filmus, Y.: An orthogonal basis for functions over a slice of the Boolean hypercube. Electron. J. Comb. 23(1), 23 (2016)","journal-title":"Electron. J. Comb."},{"key":"84_CR29","doi-asserted-by":"publisher","first-page":"2016","DOI":"10.4086\/cjtcs.2016.014","volume":"14","author":"Y Filmus","year":"2016","unstructured":"Filmus, Y.: Friedgut-Kalai-Naor theorem for slices of the Boolean cube. Chic. J. Theoret. Comput. Sci. 14, 2016 (2016). https:\/\/doi.org\/10.4086\/cjtcs.2016.014","journal-title":"Chic. J. Theoret. Comput. Sci."},{"key":"84_CR30","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s00440-019-00900-w","volume":"175","author":"Y Filmus","year":"2019","unstructured":"Filmus, Y., Mossel, E.: Harmonicity and invariance on slices of the Boolean cube. Probab. Theory Relat. Fields 175, 721\u2013782 (2019). https:\/\/doi.org\/10.1007\/s00440-019-00900-w","journal-title":"Probab. Theory Relat. Fields"},{"key":"84_CR31","doi-asserted-by":"publisher","unstructured":"Filmus, Y., Kindler, G., Mossel, E., Wimmer, K.: Invariance principle on the slice. ACM Trans. Comput. Theory 10(3), 11:1\u201311:37 (2018). https:\/\/doi.org\/10.1145\/3186590","DOI":"10.1145\/3186590"},{"issue":"671","key":"84_CR32","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1515\/crelle.2011.157","volume":"2012","author":"J Fox","year":"2012","unstructured":"Fox, J., Gromov, M., Lafforgue, V., Naor, A., Pach, J.: Overlap properties of geometric expanders. J. Reine Angew. Math. 2012(671), 49\u201383 (2012). https:\/\/doi.org\/10.1515\/crelle.2011.157","journal-title":"J. Reine Angew. Math."},{"issue":"3","key":"84_CR33","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0196-8858(02)00024-6","volume":"29","author":"E Friedgut","year":"2002","unstructured":"Friedgut, E., Kalai, G., Naor, A.: Boolean functions whose Fourier transform is concentrated on the first two levels and neutral social choice. Adv. Appl. Math. 29(3), 427\u2013437 (2002). https:\/\/doi.org\/10.1016\/S0196-8858(02)00024-6","journal-title":"Adv. Appl. Math."},{"issue":"3","key":"84_CR34","doi-asserted-by":"publisher","first-page":"375","DOI":"10.2307\/1970829","volume":"97","author":"H Garland","year":"1973","unstructured":"Garland, H.: $$p$$-adic curvature and the cohomology of discrete subgroups of $$p$$-adic groups. Ann. Math. 97(3), 375\u2013423 (1973). https:\/\/doi.org\/10.2307\/1970829","journal-title":"Ann. Math."},{"key":"84_CR35","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/s00039-010-0073-8","volume":"20","author":"M Gromov","year":"2010","unstructured":"Gromov, M.: Singularities, expanders and topology of maps. Part 2 from combinatorics to topology via algebraic isoperimetry. Geom. Funct. Anal. 20, 416\u2013526 (2010). https:\/\/doi.org\/10.1007\/s00039-010-0073-8","journal-title":"Geom. Funct. Anal."},{"key":"84_CR36","doi-asserted-by":"publisher","unstructured":"Gur, T., Lifshitz, N., Liu, S.: STOC 2022. In: Leonardi, S., Gupta, A. (eds.) In: Proceedings of 54th ACM Symposium on Theory of Computing (STOC), pp. 176\u2013184 (2022). https:\/\/doi.org\/10.1145\/3519935.3520004","DOI":"10.1145\/3519935.3520004"},{"key":"84_CR37","doi-asserted-by":"publisher","unstructured":"Kaufman, T., Lubotzky, A.: High dimensional expanders and property testing. In: Naor, M. (ed.) Proceedings of 5th Innovations in Theoretical Computer Science (ITCS), pp. 501\u2013506. ACM (2014). https:\/\/doi.org\/10.1145\/2554797.2554842","DOI":"10.1145\/2554797.2554842"},{"key":"84_CR38","unstructured":"Kaufman, T., Mass, D.: Good distance lattices from high dimensional expanders (2018). arXiv:1803.02849"},{"issue":"1","key":"84_CR39","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00493-019-3847-0","volume":"40","author":"T Kaufman","year":"2020","unstructured":"Kaufman, T., Oppenheim, I.: High order random walks: beyond spectral gap. Combinatorica 40(1), 245\u2013281 (2020). https:\/\/doi.org\/10.1007\/s00493-019-3847-0","journal-title":"Combinatorica"},{"issue":"1","key":"84_CR40","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s00039-016-0362-y","volume":"26","author":"T Kaufman","year":"2016","unstructured":"Kaufman, T., Kazhdan, D., Lubotzky, A.: Isoperimetric inequalities for Ramanujan complexes and topological expanders. Geom. Funct. Anal. 26(1), 250\u2013287 (2016). https:\/\/doi.org\/10.1007\/s00039-016-0362-y","journal-title":"Geom. Funct. Anal."},{"key":"84_CR41","doi-asserted-by":"publisher","unstructured":"Khot, S., Minzer, D., Safra, D.: On independent sets, 2-to-2 games, and Grassmann graphs. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of 49th ACM Symposium on Theory of Computing (STOC), pp. 576\u2013589 (2017). https:\/\/doi.org\/10.1145\/3055399.3055432","DOI":"10.1145\/3055399.3055432"},{"key":"84_CR42","doi-asserted-by":"publisher","unstructured":"Khot, S., Minzer, D., Safra, M.: Pseudorandom sets in Grassmann graph have near-perfect expansion. In: Thorup, M. (ed.) Proceedings of 59th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 592\u2013601 (2018). https:\/\/doi.org\/10.1109\/FOCS.2018.00062","DOI":"10.1109\/FOCS.2018.00062"},{"issue":"4","key":"84_CR43","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00493-006-0027-9","volume":"26","author":"N Linial","year":"2006","unstructured":"Linial, N., Meshulam, R.: Homological connectivity of random 2-complexes. Combinatorica 26(4), 475\u2013487 (2006). https:\/\/doi.org\/10.1007\/s00493-006-0027-9","journal-title":"Combinatorica"},{"issue":"3","key":"84_CR44","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8(3), 261\u2013277 (1988). https:\/\/doi.org\/10.1007\/BF02126799","journal-title":"Combinatorica"},{"issue":"6","key":"84_CR45","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1016\/j.ejc.2004.06.007","volume":"26","author":"A Lubotzky","year":"2005","unstructured":"Lubotzky, A., Samuels, B., Vishne, U.: Explicit constructions of Ramanujan complexes of type $$\\tilde{A_d}$$. Eur. J. Comb. 26(6), 965\u2013993 (2005). https:\/\/doi.org\/10.1016\/j.ejc.2004.06.007","journal-title":"Eur. J. Comb."},{"issue":"1","key":"84_CR46","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02772543","volume":"149","author":"A Lubotzky","year":"2005","unstructured":"Lubotzky, A., Samuels, B., Vishne, U.: Ramanujan complexes of type $$\\tilde{A_d}$$. Isr. J. Math. 149(1), 267\u2013299 (2005). https:\/\/doi.org\/10.1007\/BF02772543","journal-title":"Isr. J. Math."},{"key":"84_CR47","doi-asserted-by":"publisher","DOI":"10.4086\/cjtcs.2010.001","author":"A Montanaro","year":"2010","unstructured":"Montanaro, A., Osborne, T.: Quantum Boolean functions. Chic. J. Theoret. Comput. Sci. (2010). https:\/\/doi.org\/10.4086\/cjtcs.2010.001","journal-title":"Chic. J. Theoret. Comput. Sci."},{"issue":"1","key":"84_CR48","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1137\/060656838","volume":"38","author":"D Moshkovitz","year":"2008","unstructured":"Moshkovitz, D., Raz, R.: Sub-constant error low degree test of almost-linear size. SIAM J. Comput. 38(1), 140\u2013180 (2008). https:\/\/doi.org\/10.1137\/060656838","journal-title":"SIAM J. Comput."},{"issue":"6","key":"84_CR49","doi-asserted-by":"publisher","first-page":"2375","DOI":"10.1137\/100787325","volume":"42","author":"R O\u2019Donnell","year":"2013","unstructured":"O\u2019Donnell, R., Wimmer, K.: KKL, Kruskal-Katona, and monotone nets. SIAM J. Comput. 42(6), 2375\u20132399 (2013). https:\/\/doi.org\/10.1137\/100787325","journal-title":"SIAM J. Comput."},{"issue":"2","key":"84_CR50","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00454-017-9948-x","volume":"59","author":"I Oppenheim","year":"2018","unstructured":"Oppenheim, I.: Local spectral expansion approach to high dimensional expanders part I: descent of spectral gaps. Discret. Comput. Geom. 59(2), 293\u2013330 (2018). https:\/\/doi.org\/10.1007\/s00454-017-9948-x","journal-title":"Discret. Comput. Geom."},{"key":"84_CR51","unstructured":"Plaza, R.: Variations on differential posets. In: Stanton, D. (ed.) Invariant Theory and Tableaux, IMA Vol. Math. Appl., vol. 19, pp. 145\u2013165. Springer, Berlin (1990)"},{"issue":"4","key":"84_CR52","doi-asserted-by":"publisher","first-page":"P4.41","DOI":"10.37236\/5401","volume":"22","author":"R Plaza","year":"2015","unstructured":"Plaza, R.: Stability for intersecting families in $${PGL}(2, q)$$. Electron. J. Comb. 22(4), P4.41 (2015)","journal-title":"Electron. J. Comb."},{"issue":"4","key":"84_CR53","doi-asserted-by":"publisher","first-page":"919","DOI":"10.2307\/1990995","volume":"1","author":"RP Stanley","year":"1988","unstructured":"Stanley, R.P.: Differential posets. J. Am. Math. Sci. 1(4), 919\u2013961 (1988). https:\/\/doi.org\/10.2307\/1990995","journal-title":"J. Am. Math. Sci."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00084-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00084-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00084-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T10:07:44Z","timestamp":1716199664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00084-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,18]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00084-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,18]]},"assertion":[{"value":"28 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}