Related papers: Transitive bounded-degree 2-expanders from regular…

We study criteria for deciding when the normal subgroup generated by a single polynomial automorphism of $\mathbb{A}^n$ is as large as possible, namely equal to the normal closure of the special linear group in the special automorphism…

In our recent work we described conditions under which a multi-parameter random simplicial complex is connected and simply connected. We showed that the Betti numbers of multi-parameter random simplicial complexes in one specific dimension…

The past two decades have seen significant successes in our understanding of complex networked systems, from the mapping of real-world social, biological and technological networks to the establishment of generative models recovering their…

The motion of a graph is the minimal degree of its full automorphism group. Babai conjectured that the motion of a primitive distance-regular graph on $n$ vertices of diameter greater than two is at least $n/C$ for some universal constant…

We present a new explicit construction for expander graphs with nearly optimal spectral gap. The construction is based on a series of 2-lift operations. Let $G$ be a graph on $n$ vertices. A 2-lift of $G$ is a graph $H$ on $2n$ vertices,…

Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…

It is known that there are precisely three transitive permutation groups of degree $6$ that admit an invariant partition with three parts of size $2$ such that the kernel of the action on the parts has order $4$; these groups are called…

We study the problem of constructing explicit sparse graphs that exhibit strong vertex expansion. Our main result is the first two-sided construction of imbalanced unique-neighbor expanders, meaning bipartite graphs where small sets…

We associate an square to any two dimensional evolution algebra. This geometric object is uniquely determined, does not depend on the basis and describes the structure and the behaviour of the algebra. We determine the identities of degrees…

A weighted $d-$complex is a simplicial complex of dimension $d$ in which each face is assigned a real-valued weight. We derive three key results here concerning persistence diagrams and minimal spanning acycles (MSAs) of such complexes.…

We canonically identify the groups of isometries and dilations of local fields and their rings of integers with subgroups of the automorphism group of the $(d+1)$-regular tree $\widetilde T_{d+1}$, where $d$ is the residual degree. Then we…

We study the geometries generated by two-dimensional causal dynamical triangulations (CDT) coupled to $d$ massless scalar fields. Using methods similar to those used to study four-dimensional CDT we show that there exists a $c=1$ "barrier",…

We study smooth, proper embeddings of noncompact surfaces in 4-manifolds, focusing on exotic planes and annuli, i.e., embeddings pairwise homeomorphic to the standard embeddings of R^2 and R^2-int D^2 in R^4. We encounter two uncountable…

In this paper, we present a new construction of simplicial complexes of subpolynomial degree with arbitrarily good local spectral expansion. Previously, the only known high-dimensional expanders (HDXs) with arbitrarily good expansion and…

We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…

The degree-restricted random process is a natural algorithmic model for generating graphs with degree sequence D_n=(d_1, \ldots, d_n): starting with an empty n-vertex graph, it sequentially adds new random edges so that the degree of each…

We prove a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to…

A $(d-1)$-dimensional simplicial complex is called balanced if its underlying graph admits a proper $d$-coloring. We show that many well-known face enumeration results have natural balanced analogs (or at least conjectural analogs).…

Cubical complexes are metric spaces constructed by gluing together unit cubes in an analogous way to the construction of simplicial complexes. We construct Brownian motion on such spaces, define random walks, and prove that the transition…

Simplicial complexes are gaining increasing scientific attention as they are generalized network structures that can represent the many-body interactions existing in complex systems raging from the brain to high-order social networks.…