Related papers: Mixing in high-dimensional expanders
We consider a family of non-compact manifolds $X_\eps$ (``graph-like manifolds'') approaching a metric graph $X_0$ and establish convergence results of the related natural operators, namely the (Neumann) Laplacian $\laplacian {X_\eps}$ and…
In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…
For a standard path of connections going to a generic point at infinity in the moduli space $M_{DR}$ of connections on a compact Riemann surface, we show that the Laplace transform of the family of monodromy matrices has an analytic…
The rotational dimension is a minor monotone graph invariant related to the dimension of an Euclidean space containing a spectral embedding corresponding to the first nonzero eigenvalue of the graph Laplacian, which is introduced by…
In a recent work [2] with Datta, we introduced the mu vector (with respect to a given field) of simplicial complexes and used it to study tightness and lower bounds. In this paper, we modify the definition of mu vectors. With the new…
We study Laplacians on general countable weighted simplicial complexes from a conceptual point of view. These operators will first be introduced formally before showing that those formal operators coincide with self-adjoint realizations of…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
We consider a vector field $X$ on a closed manifold which admits a Lyapunov one form. We assume $X$ has Morse type zeros, satisfies the Morse--Smale transversality condition and has non-degenerate closed trajectories only. For a closed one…
The colourful simplicial depth conjecture states that any point in the convex hull of each of d+1 sets, or colours, of d+1 points in general position in R^d is contained in at least d^2+1 simplices with one vertex from each set. We verify…
A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…
Complex systems consist of interacting units whose interactions may be pairwise, involving two units, or higher-order, involving more than two units simultaneously. Graphs capture pairwise interactions and represent such systems as…
The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…
A long-standing problem with the many-body approximations for interacting condensed bosons has been the dichotomy between the ``conserving'' and ``gapless'' approximations, which either obey the conservations laws or satisfy the…
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…
We study Laplace-type operators on hybrid manifolds, i.e. on configurations consisting of closed two-dimensional manifolds and one-dimensional segments. Such an operator can be constructed by using the Laplace-Beltrami operators on each…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
Very recently Ma and Wu \cite{wu2024generalization} obtained a generalization of Fielder's lemma and applied to find adjacency, Laplacian, and signless Laplacian spectra of $P_n-$ product of commuting graphs. In this paper, we give a…
Random walks in expander graphs and their various derandomizations (e.g., replacement/zigzag product) are invaluable tools from pseudorandomness. Recently, Ta-Shma used s-wide replacement walks in his breakthrough construction of a binary…
A necessary and sufficient condition is presented for a graph algebra to satisfy a bracketing identity. The associative spectrum of an arbitrary graph algebra is shown to be either constant or exponentially growing.