Related papers: High dimensional expansion using zig-zag product

We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…

We study a generalized notion of a homogeneous skew-product extension of a probability-preserving system in which the homogeneous space fibres are allowed to vary over the ergodic decomposition of the base. The construction of such…

Continuing previous work we develop a certain piece of functional analysis on general graphs and use it to create what Connes calls a 'spectral triple', i.e. a Hilbert space structure, a representation of a certain (function) algebra and a…

Let $G= (V,E)$ be a finite graph. For $d_0>0$ we say that $G$ is $d_0$-regular, if every $v\in V$ has degree $d_0$. We say that $G$ is $(d_0, d_1)$-regular, for $0<d_1<d_0$, if $G$ is $d_0$ regular and for every $v\in V$, the subgraph…

Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…

Torsion polynomials connect the genus of a hyperbolic knot (a topological invariant) with the discrete faithful representation (a geometric invariant). Using a new combinatorial structure of an ideal triangulation of a 3-manifold that…

We provide an upper bound on the Cheeger constant and first eigenvalue of the Laplacian of a finite-volume hyperbolic 3-manifold M, in terms of data from any surgery diagram for M. This has several consequences. We prove that a family of…

In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…

We study contact structures compatible with genus one open book decompositions with one boundary component. Any monodromy for such an open book can be written as a product of Dehn twists around dual non-separating curves in the…

One of the most important properties of high dimensional expanders is that high dimensional random walks converge rapidly. This property has proven to be extremely useful in variety of fields in the theory of computer science from agreement…

We discuss on some families of skew product maps on a square. For a kind of skew product maps with coupled-expanding property, we estimate Hausdorff dimension of its attractor. And we prove that there exists an ergodic measure with full…

Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in…

We study high order random walks in high dimensional expanders; namely, in complexes which are local spectral expanders. Recent works have studied the spectrum of high order walks and deduced fast mixing. However, the spectral gap of high…

The notion of a symplectic expansion directly relates the topology of a surface to formal symplectic geometry. We give a method to construct a symplectic expansion by solving a recurrence formula given in terms of the…

A conjecture regarding the structure of expander graphs is discussed.

Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition in the sense of Szemer\'edi. In this paper we set out a…

In this paper, we present a new hypercomplex number system, Trinition, that has an unusual structure of commutativity, noncommutativity, nonassociativity, and deformability.

We derive Singleton-type bounds on the free distance and column distances of trellis codes. Our results show that, at a given time instant, the maximum attainable column distance of trellis codes can exceed that of convolutional codes.…

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

Convolutional Low-Density-Parity-Check (LDPC) ensembles have excellent performance. Their iterative threshold increases with their average degree, or with the size of the coupling window in randomized constructions. In the later case, as…