Related papers: Improved Product-Based High-Dimensional Expanders

Ramanujan graphs have extremal spectral properties, which imply a remarkable combinatorial behavior. In this paper we compute the high dimensional Hodge-Laplace spectrum of Ramanujan triangle complexes, and show that it implies a…

This paper introduces an extended notion of expansion suitable for radio networks. A graph $G=(V,E)$ is called an $(\alpha_w, \beta_w)$-{wireless expander} if for every subset $S \subseteq V$ s.t. $|S|\leq \alpha_w \cdot |V|$, there exists…

We study the problem of constructing explicit codes whose rate and distance match the Gilbert-Varshamov bound in the low-rate, high-distance regime. In 2017, Ta-Shma gave an explicit family of codes where every pair of codewords has…

Motivated by recent work of George Andrews and Mircea Merca on the expansion of the quotient of the truncation of Euler's pentagonal number series by the complete series, we provide similar expansion results for averages involving…

We construct a new family of trivalent expanders tessellating hyperbolic surfaces with large isometry groups. These graphs are obtained from a family of Cayley graphs of nilpotent groups via $(\Delta-Y)$-transformations. We compare this…

For an input graph $G$, an additive spanner is a sparse subgraph $H$ whose shortest paths match those of $G$ up to small additive error. We prove two new lower bounds in the area of additive spanners: 1) We construct $n$-node graphs $G$ for…

Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…

We introduce a new model of random $d$-dimensional simplicial complexes, for $d\geq 2$, whose $(d-1)$-cells have bounded degrees. We show that with high probability, complexes sampled according to this model are coboundary expanders. The…

We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…

Powering the adjacency matrix of an expander graph results in a better expander of higher degree. In this paper we seek an analogue operation for high-dimensional expanders. We show that the naive approach to powering does not preserve…

In this work we propose a generalization of the Hadamard product between two matrices to a tensor-valued, multi-linear product between k matrices for any $k \ge 1$. A multi-linear dual operator to the generalized Hadamard product is…

To date, high-resolution (< 1 nm) imaging of extended objects in three-dimensions (3D) has not been possible. A restriction known as the Crowther criterion forces a tradeoff between object size and resolution for 3D reconstructions by…

A small cover was introduced by Davis and Januszkiewicz as an $n$-dimensional closed manifold with a locally standard $Z_2)^n$-action such that its orbit space is a simple convex polytope. There exist a one-to-one correspondence between…

The finite gain-bandwidth product is a fundamental figure of merit that restricts the operation of standard optical amplifiers. In microcavity setups, this becomes a serious problem due to the narrow bandwidth of the device. Here we…

We propose a tensor product structure that is compatible with the hypergraph structure. We define the algebraic connectivity of the $(m+1)$-uniform hypergraph in this product, and prove the relationship with the vertex connectivity. We…

In this paper, we consider a relation between $k$-way expansion constant of a finite graph and the expansion constants of subgraphs in a $k$-partition of the graph. Using this relation, we show that a sequence of finite graphs which have…

We conclude our work [arXiv:2403.07628, arXiv:2503.12644] on asymptotic expansions at the soft edge for the classical $n$-dimensional Gaussian and Laguerre ensembles, now studying the gap-probability generating functions. We show that the…

We improve both dimension compression and expansion bounds for homeomorphisms with $p$-exponentially integrable distortion. To the first direction we also introduce estimates for the compression multifractal spectra, which will be used to…

Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for…

We give new bounds on the cosystolic expansion constants of several families of high dimensional expanders, and the known coboundary expansion constants of order complexes of homogeneous geometric lattices, including the spherical building…