Pith. sign in

REVIEW 1 major objections 4 minor 31 references

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier

T0 review · 1 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper gives the first explicit graphs in which every small set of vertices on either side has roughly 0.6d unique neighbors, breaking the spectral barrier of 0.5d.

desk verdict First explicit construction to break the 0.5d spectral barrier for two-sided vertex expanders, with a real but fixable gap in the structured base graph verification. read the letter →

arxiv 2411.11627 v1 pith:DI7OBKYI submitted 2024-11-18 math.CO cs.CCcs.DMcs.DS

Jun-Ting Hsieh , Ting-Chun Lin , Sidhanth Mohanty , Ryan O'Donnell , Rachel Yun Zhang This is my paper · ORCID
classification math.COcs.CCcs.DMcs.DS MSC 05C4805E45
keywords explicitvertexexpandersunique-neighborexpansiontwo-sidedspectralbarrierRamanujancliquecomplextripartitelineproducttriangledensityhigh-dimensional
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper constructs the first explicit two-sided vertex expanders that break the 0.5d spectral barrier. For any small error ε and any fixed aspect ratio, and all sufficiently large dL and dR, it gives an explicit infinite family of (5dL,5dR)-biregular bipartite graphs in which every sufficiently small subset on either side has at least roughly 0.6·(degree)·|S| unique neighbors, not merely 0.5d distinct neighbors. The construction uses a tripartite line product whose base graphs are vertex–face incidence graphs of the 4-dimensional Ramanujan clique complex, together with a constant-sized pseudorandom gadget, and a new bound on triangle density in small vertex sets of the Ramanujan complex is the key analytical ingredient. The result is the first explicit construction whose two-sided unique-neighbor expansion exceeds 1/2, the threshold that makes expander-based classical error-correcting codes work, and a step toward the 5/6 threshold needed for quantum LDPC codes.

What carries the argument

The load-bearing object is the structured bipartite base graph (Definition 2.3): a (k,D)-biregular graph G=(V,M,E) whose M-side is partitioned into k parts M_a, with each v∈V adjacent to exactly one vertex in each part, and whose common neighborhoods are constrained so that for u∈M_a and v∈M_b, N(u)∩N(v) is empty or exactly one of s 'special sets' of neighbors of u, each of size between D/(2s) and 2D/s. The construction instantiates G as the truncated vertex–face incidence graph of the Ramanujan clique complex of [LSV05a, LSV05b]. The tripartite line product places a copy of a constant-sized pseudorandom (dL,dR)-biregular gadget H between the DL left-neighbors and DR right-neighbors of each middle vertex, producing the final (kdL,kdR)-biregular graph on L∪R. The collision analysis rests on two derived properties of the base graphs: small-set triangle expansion (few vertices of V have three or more neighbors into a small U⊆M) and small-set skeleton expansion (the largest eigenvalue of the simple graph of length-2 walks through V on a small U⊆M is at most λ). For k=5 the new triangle-density bound gives DL,DR=Θ($q^{{10}}$), τ=O($q^{{6.5}}$), λ=O($q^{3}$), and sL,sR∈[$q^{4}$,O($q^{6}$)]; choosing gadget degrees dL,dR=Θ($q^{{3.25}}$) makes the analysis work, yielding the factor (k−2)/k=3/5.

What would settle it

Take the smallest nontrivial q and k=5 instance of the construction, enumerate for a fixed vertex u∈M and all v∈M_b with a common neighbor in R their common neighborhoods, and check that each equals Nbr_u(A_i) for one of the special sets A_i and that the A_i partition the neighbors of u into balanced groups; any deviation from Definition 2.3 disproves Lemma 3.18 and undermines the middle-to-right argument.

Watch

Extended reading notes

Core claim

The paper's central claim, Theorem 2.1, is that for every ε>0 and β∈(0,1] there is a d0 such that for all dL,dR≥d0 with dR/dL∈[β,β+ε], there is an explicit infinite family of (5dL,5dR)-biregular bipartite graphs that are (3/5−ε)-two-sided unique-neighbor expanders, and there is a poly(n)-time algorithm that outputs a member of the family with Θ(n) vertices. This is the first explicit construction to bypass the spectral barrier: previously Ramanujan graphs guaranteed only that every small set has at least 0.5d distinct neighbors, and examples show this factor can be tight, with some explicit Ramanujan graphs containing small sets that have zero unique neighbors. The construction proves the stronger unique-neighbor statement: every small set on the left has at least (3/5−ε)·5dL·|S| unique neighbors, and similarly on the right. The proof goes through a tripartite line product with a structured base graph supplied by the 4-dimensional Ramanujan clique complex and a constant-sized pseudorandom gadget; the key new analysis is a bound on the number of size-5 faces with at least three vertices in any small vertex set of the Ramanujan complex.

Load-bearing premise

The load-bearing premise is that the truncated vertex–face incidence graph of the Ramanujan clique complex satisfies the structured-bipartite common-neighborhood property with balanced special sets, a claim the paper asserts without giving the verification.

Editorial extensions

If this is right

  • For any fixed aspect ratio β and any small δ>0, once dL and dR are large enough, there is an explicit family of (5dL,5dR)-biregular two-sided unique-neighbor expanders with expansion 3/5−δ, constructible in polynomial time in the number of vertices.
  • Because the graphs have unique-neighbor expansion above 1/2 and carry the algebraic group-action property noted in Remark 1.1, they satisfy the main structural requirements for expander-based classical codes and some of the requirements for quantum LDPC constructions.
  • The new small-set triangle-density bound for the 4-dimensional Ramanujan clique complex is a standalone high-dimensional-expander fact: any vertex set of size at most δn contains at most O(q^{13/2}|U|) size-5 faces with at least three vertices.
  • If the same construction could be run with larger k, the unique-neighbor factor would become (k−2)/k; the paper identifies the missing ingredient as better density bounds for triangles or larger faces in the complex and for incidence graphs of subspace posets.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural next test is to run the omitted verification of Lemma 3.18 computationally for small q and k=5; if the special-set structure fails, the middle-to-right collision bound would need a different mechanism, while if it passes, the construction is fully explicit and ready to instantiate.
  • The key quantitative gain over the earlier line-product construction is that the square of the right-side base graph splits into many nearly Ramanujan components, so the relevant collision degree is roughly sqrt(DR/ℓ) rather than sqrt(DR); this suggests that any base family whose two-step graph is a union of many independent expanders would yield a similar gain, making the exact face-density bound
  • Because the gadget graph is found by brute force over constant-size graphs, the explicitness of the construction does not depend on random search; a useful extension would be to tabulate the smallest gadget degrees for which the pseudorandom-gadget properties hold, which would determine the practical constants in the theorem.
  • If improved triangle-density or tetrahedron-density bounds become available, plugging them into this construction is the most direct route to two-sided unique-neighbor expansion above 3/5 and toward the 5/6 threshold for quantum LDPC codes.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 4 minor

Summary. The paper constructs explicit two-sided vertex expanders that break the 0.5d spectral barrier. Using the tripartite line product framework of Hsieh–McKenzie–Mohanty–Paredes, the authors instantiate the base graph with a truncated vertex-face incidence graph of the 4-dimensional Ramanujan clique complex, and prove new bounds on the triangle density of small sets in that complex. The main theorem states that for any target aspect ratio, there exist explicit families of (5dL,5dR)-biregular graphs with (3/5 − ε)-two-sided unique-neighbor expansion for large degrees. The proof combines a left-to-middle analysis using small-set triangle expansion with a middle-to-right collision analysis using skeleton expansion and a pseudorandom gadget.

Significance. If the proof is completed, this is a substantial breakthrough: it is the first explicit construction to exceed the 1/2 spectral barrier for two-sided vertex expansion, resolving a question implicit in Kahale's work. The construction is explicit and polynomial-time, and the triangle-density analysis of small sets in the Ramanujan clique complex (Section 4, especially Lemma 4.8 and Corollary 4.9) is a technically interesting contribution in its own right, potentially useful for other HDX-based constructions. The proof is mostly self-contained and the parameter choices for k=5 are carefully checked (dL,dR = Θ(q^3.25) lies between λ/δ and δD/τ). The main caveat is the unverified structured base-graph property, which the authors explicitly acknowledge as omitted; this omission is load-bearing for the main claim.

major comments (1)
  1. [Section 3.2–3.3 (Lemmas 3.10 and 3.18), Definition 2.3(4), Definition 2.8(1), Lemma 5.3] The paper asserts, but does not prove, that the (truncated) vertex–face incidence graph of the Ramanujan clique complex is a structured bipartite graph satisfying Definition 2.3. Lemma 3.10 says 'we omit the details' and Lemma 3.18 says the verification is 'straightforward verification that we omit.' This omission is load-bearing for the main theorem. Definition 2.8(1) requires the pseudorandom gadget to control the total number of neighborhood vertices landing in any union of the special sets A_i ⊆ [DR] from Definition 2.3(4). The only provided proof that a random gadget satisfies this bound (Lemma 5.3) is for an arbitrary fixed balanced partition B = B1 ∪ ... ∪ Br of [DR]; its key distributional step, that Σ_{i∈W} |N(S)∩Bi| has the same law as |N(S)∩T| for a uniform T of size Σ|Bi|, uses the disjointness of the Bi. Definition 2.3(4) does not assert that the special sets are pairwise disjoint, nor that they cover [D], nor that after truncation by F in Lemma 3.18 they remain disjoint and balanced with sizes Θ(D/s). Lemma 3.18 does not establish any of these facts. Consequently, Lemma 2.10 (existence of a good gadget) and the application of Eq. (1) in the proof of Lemma 2.16 are not justified for the special sets arising from the construction. The authors must supply the missing verification or replace Definition 2.8(1) with a condition that can be proved for the actual special sets.
minor comments (4)
  1. [Definition 2.8(1)] The parameter r is not defined in Definition 2.8; it appears in the bound 'max{1/r · dL|S|, log D}'. The proof of Lemma 5.3 uses r for the number of blocks in a partition, but Definition 2.8 is stated before any partition is introduced. The intended identification r = sR(a,b) should be stated explicitly.
  2. [Lemma 3.18, proof] The sentence 'We claim that there if a face f that contains m' contains a typo ('there if' should be 'that if').
  3. [Section 4, notation] The notation d_{ij} = [k/(j-i)k]_q is confusing; the subscript k appears misplaced. The intended Gaussian binomial coefficient should be written as [ k / ((j-i) mod k) ]_q, with the modular reduction made explicit.
  4. [Observation 2.13] Observation 2.13 would benefit from stating explicitly that the special sets are those for the pair (a,b) and that the multiplicity bound holds for every v ∈ M_b; as written the observation is too informal for a formal proof.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular reduction: the 3/5 expansion factor is derived from a new triangle-density bound, not from a fitted input; the main flag is an omitted structural verification that is a proof gap, not a circular step.

full rationale

The claimed new result is not, on the written derivation, equivalent to any of its inputs. The 3/5 - epsilon factor comes from k-2/k with k=5 and from the derived O(q^{6.5}) triangle-density bound (Corollary 4.9), not from a fitted parameter or a normalization chosen to force the answer. The gadget pseudorandomness used in Definition 2.8 is proved for random biregular graphs in Lemma 5.3 using concentration, and the base-graph triangle and skeleton expansion are reduced to the Ramanujan clique complex of [LSV05b, LSV05a] (Sections 3-4). Self-citations to [HMMP24] supply the tripartite-line-product framework, Lemma 6.2, and gadget concentration lemmas; these are prior published results used as lemmas, and the central expansion theorem does not reduce to a self-citation chain. The one load-bearing issue found is not circularity but incompleteness: Lemma 3.18 says the structured-graph verification is 'straightforward verification that we omit', and Lemma 3.10 says 'we omit the details'. The middle-to-right analysis (Lemma 2.16) and Lemma 5.3's proof of Definition 2.8(1) require the special sets of Definition 2.3(4) to behave like a balanced partition B1 union ... union Br of [D_R]; the written verification in Lemma 5.3 is only for a fixed balanced partition, and Definition 2.3(4) only asserts sizes between D/(2s) and 2D/s. If the omitted verification does not establish disjoint balanced blocks, Eq. (1) and the saturated-vertex argument lack support. That would be a correctness gap in the proof, not a circular reduction, since the claimed expansion is not defined in terms of those special sets.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The central claim rests on cited constructions of Ramanujan complexes and spherical buildings, standard probabilistic tools, and one in-paper structural assertion (Lemma 3.18) that is not fully proved. No fitted empirical parameters or invented physical entities are introduced.

free parameters (1)
  • delta (small positive constant)
    Introduced in Theorem 2.11 to split low/high degree vertices and to control saturated vertices; the final expansion is (1 - delta - o_D(1)) * (k-2)/k, so any sufficiently small delta satisfying the parameter inequalities works. It is a proof parameter, not fitted to data, but the result's constant depends on choosing it small enough.
assumptions (5)
  • domain assumption The LSV05 Ramanujan clique complex Cay_k(PGL_k(F_{q^e}), S) exists with the stated spectral and link properties (Theorem 3.4) and can be constructed in poly(n) time.
    Used as the base graph in Definition 3.9; this is a cited prior construction (Lubotzky-Samuels-Vishne), not proved here.
  • domain assumption Bipartite graphs between parts of the spherical building P(F_q^k) have the second eigenvalue bound of Lemma 3.8 (from GHK+22).
    Used to bound edge densities inside links of the Ramanujan complex in Lemma 4.3.
  • standard math The expander mixing lemma and the concentration bound for sampling without replacement (Lemma 5.2) hold as stated.
    Standard tools invoked in Sections 4.1 and 5.
  • domain assumption Lemma 2.18 (from HMMP24): a bipartite graph with maximum eigenvalue lambda has (d1-1)(d2-1) <= lambda^2.
    Used to bound saturated vertices in Lemma 2.16; taken from the authors' prior work.
  • ad hoc to paper The truncated graph in Lemma 3.18 is a structured bipartite graph with the needed special sets and inherits triangle/skeleton expansion.
    This is asserted with omitted proof; flagged as a red flag. It is not a standard result and is load-bearing.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier." pith.science (2026). https://pith.science/paper/DI7OBKYI

@misc{pith2026241111627,
  author       = {Pith},
  title        = {Pith review of: Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DI7OBKYI}},
  note         = {Machine review of arXiv:2411.11627}
}
abstract

We construct the first explicit two-sided vertex expanders that bypass the spectral barrier. Previously, the strongest known explicit vertex expanders were given by $d$-regular Ramanujan graphs, whose spectral properties imply that every small subset of vertices $S$ has at least $0.5d|S|$ distinct neighbors. However, it is possible to construct Ramanujan graphs containing a small set $S$ with no more than $0.5d|S|$ neighbors. In fact, no explicit construction was known to break the $0.5 d$-barrier. In this work, we give an explicit construction of an infinite family of $d$-regular graphs (for large enough $d$) where every small set expands by a factor of $\approx 0.6d$. More generally, for large enough $d_1,d_2$, we give an infinite family of $(d_1,d_2)$-biregular graphs where small sets on the left expand by a factor of $\approx 0.6d_1$, and small sets on the right expand by a factor of $\approx 0.6d_2$. In fact, our construction satisfies an even stronger property: small sets on the left and right have unique-neighbor expansion $0.6d_1$ and $0.6d_2$ respectively. Our construction follows the tripartite line product framework of Hsieh, McKenzie, Mohanty & Paredes, and instantiates it using the face-vertex incidence of the $4$-dimensional Ramanujan clique complex as its base component. As a key part of our analysis, we derive new bounds on the triangle density of small sets in the Ramanujan clique complex.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 29 canonical work pages

  1. [1]

    Explicit unique-neighbor expanders

    Noga Alon and Michael Capalbo. Explicit unique-neighbor expanders. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. , pages 73--79. IEEE, 2002

    work page 2002

  2. [2]

    Bipartite unique-neighbour expanders via Ramanujan graphs

    Ron Asherov and Irit Dinur. Bipartite unique-neighbour expanders via Ramanujan graphs . arXiv preprint arXiv:2301.03072 , 2023

    work page Pith review arXiv 2023

  3. [3]

    Log-concave polynomials II : high-dimensional walks and an FPRAS for counting bases of a matroid

    Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant. Log-concave polynomials II : high-dimensional walks and an FPRAS for counting bases of a matroid. In Proceedings of the 51st annual Symposium on Theory of Computing (STOC) , pages 1--12, 2019

    work page 2019

  4. [4]

    Ramanujan type buildings

    Cristina Ballantine. Ramanujan type buildings. Canadian Journal of Mathematics , 52(6):1121--1148, 2000

    work page 2000

  5. [5]

    Two-sided lossless expanders in the unbalanced setting, 2024

    Eshan Chattopadhyay, Mohit Gurumukhani, Noam Ringach, and Yunya Zhao. Two-sided lossless expanders in the unbalanced setting, 2024

    work page 2024

  6. [6]

    Unique-neighbor expanders with better expansion for polynomial-sized sets, 2024

    Yeyuan Chen. Unique-neighbor expanders with better expansion for polynomial-sized sets, 2024

    work page 2024

  7. [7]

    Hdx condensers

    Itay Cohen, Roy Roth, and Amnon Ta-Shma. Hdx condensers. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages 1649--1664, 2023

    work page 2023

  8. [8]

    Randomness conductors and constant-degree lossless expanders

    Michael Capalbo, Omer Reingold, Salil Vadhan, and Avi Wigderson. Randomness conductors and constant-degree lossless expanders. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing , pages 659--668, 2002

    work page 2002

Show all 31 references
  1. [9]

    Donald Cartwright, Patrick Sol\' e , and Andrzej \. Z uk. Ramanujan geometries of type A _n . Discrete Mathematics , 269(1-3):35--43, 2003

    2003

  2. [10]

    Chernoff Bounds and Reverse Hypercontractivity on HDX

    Yotam Dikstein and Max Hopkins. Chernoff Bounds and Reverse Hypercontractivity on HDX . arXiv preprint arXiv:2404.10961 , 2024

    2024 arXiv

  3. [11]

    Eigenstripping, Spectral Decay, and Edge-Expansion on Posets

    Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, and Ruizhe Zhang. Eigenstripping, Spectral Decay, and Edge-Expansion on Posets . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022) . Schloss Dagstuhl-Leibni...

    2022

  4. [12]

    New Explicit Constant-Degree Lossless Expanders

    Louis Golowich. New Explicit Constant-Degree Lossless Expanders . arXiv preprint arXiv:2306.07551 , 2023

    2023 arXiv

  5. [13]

    Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes

    Venkatesan Guruswami, Christopher Umans, and Salil Vadhan. Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes . Journal of the ACM (JACM) , 56(4):1--34, 2009

    2009

  6. [14]

    Explicit lower bounds against (n)-rounds of sum-of-squares

    Max Hopkins and Ting-Chun Lin. Explicit lower bounds against (n)-rounds of sum-of-squares. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) , pages 662--673. IEEE, 2022

    2022

  7. [15]

    Expander graphs and their applications

    Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander graphs and their applications. Bulletin (new series) of the American Mathematical Society , 43(4):439--561, 2006

    2006

  8. [16]

    Explicit two-sided unique-neighbor expanders

    Jun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, and Pedro Paredes. Explicit two-sided unique-neighbor expanders. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages 788--799, 2024

    2024

  9. [17]

    Eigenvalues and expansion of regular graphs

    Nabil Kahale. Eigenvalues and expansion of regular graphs. Journal of the ACM (JACM) , 42(5):1091--1106, 1995

    1995

  10. [18]

    Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders

    Amitay Kamber and Tali Kaufman. Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders . In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages 426--435, 2022

    2022

  11. [19]

    Simple constructions of unique neighbor expanders from error-correcting codes, 2024

    Swastik Kopparty, Noga Ron-Zewi, and Shubhangi Saraf. Simple constructions of unique neighbor expanders from error-correcting codes, 2024

    2024

  12. [20]

    High-rate codes with sublinear-time decoding

    Swastik Kopparty, Shubhangi Saraf, and Sergey Yekhanin. High-rate codes with sublinear-time decoding. J. ACM , 61(5), September 2014

    2014

  13. [21]

    Unbalanced Expanders from Multiplicity Codes

    Itay Kalev and Amnon Ta-Shma. Unbalanced Expanders from Multiplicity Codes . In Amit Chakrabarti and Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022) , volume 245 of Leibniz International Pro...

    2022

  14. [22]

    Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs

    Dmitriy Kunisky and Xifan Yu. Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs. arXiv preprint arXiv:2404.17012 , 2024

    2024 arXiv

  15. [23]

    Good quantum LDPC codes with linear time decoder from lossless expanders

    Ting-Chun Lin and Min-Hsiu Hsieh. Good quantum LDPC codes with linear time decoder from lossless expanders . arXiv preprint arXiv:2203.03581 , 2022

    2022 arXiv

  16. [24]

    Ramanujan hypergraphs

    Wen-Ching Winnie Li. Ramanujan hypergraphs. Geometric and Functional Analysis , 14(2):380--399, 2004

    2004

  17. [25]

    Explicit constructions of R amanujan complexes of type A _d

    Alexander Lubotzky, Beth Samuels, and Uzi Vishne. Explicit constructions of R amanujan complexes of type A _d . European Journal of Combinatorics , 26(6):965--993, 2005

    2005

  18. [26]

    Ramanujan complexes of type A _d

    Alexander Lubotzky, Beth Samuels, and Uzi Vishne. Ramanujan complexes of type A _d . Israel Journal of Mathematics , 149:267--299, 2005. Probability in mathematics

    2005

  19. [27]

    Existence and explicit constructions of q+1 regular R amanujan graphs for every prime power q

    Moshe Morgenstern. Existence and explicit constructions of q+1 regular R amanujan graphs for every prime power q . J. Combin. Theory Ser. B , 62(1):44--62, 1994

    1994

  20. [28]

    Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors

    Omer Reingold, Salil Vadhan, and Avi Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In Proceedings 41st Annual Symposium on Foundations of Computer Science , pages 3--13. IEEE, 2000

    2000

  21. [29]

    Ramanujan Hypergraph Based on B ruhat-- T its Building

    Alireza Sarveniazi. Ramanujan Hypergraph Based on B ruhat-- T its Building . PhD thesis, University of G \"o ttingen, 2004

    2004

  22. [30]

    Expander codes

    Michael Sipser and Daniel Spielman. Expander codes. IEEE Trans. Inform. Theory , 42(6, part 1):1710--1722, 1996

    1996

  23. [31]

    Loss-less condensers, unbalanced expanders, and extractors

    Amnon Ta-Shma, Christopher Umans, and David Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing , STOC '01, page 143–152, New York, NY, USA, 2001. Association for Computing Machinery

    2001

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.