Related papers: Deterministic simplicial complexes
We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in R^d may be colored with d+1 colors so that no two simplices that share a (d-1)-facet have the same color. In R^2 this says…
We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…
Expander graphs have been a focus of attention in computer science in the last four decades. In recent years a high dimensional theory of expanders is emerging. There are several possible generalizations of the theory of expansion to…
We present extremal constructions connected with the property of simplicial collapsibility. (1) For each $d \ge 2$, there are collapsible (and shellable) simplicial $d$-complexes with only one free face. Also, there are non-evasive…
The face numbers of simplicial complexes without missing faces of dimension larger than $i$ are studied. It is shown that among all such $(d-1)$-dimensional complexes with non-vanishing top homology, a certain polytopal sphere has the…
We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is \emph{shelling completable} if $\Delta$ can be realized as the initial sequence of some shelling of $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the…
The theory of $k$-regular graphs is closely related to group theory. Every $k$-regular, bipartite graph is a Schreier graph with respect to some group $G$, a set of generators $S$ (depending only on $k$) and a subgroup $H$. The goal of this…
Our first main result is a uniform bound, in every dimension $k \in \mathbb N$, on the topological Tur\'an numbers of $k$-dimensional simplicial complexes: for each $k \in \mathbb N$, there is a $\lambda_k \ge k^{-2k^2}$ such that for any…
In this paper we introduce the notion of a $d$-dimensional cycle which is a homological generalization of the idea of a graph cycle to higher dimensions. We examine both the combinatorial and homological properties of this structure and use…
High dimensional expanders (HDXs) are a hypergraph generalization of expander graphs. They are extensively studied in the math and TCS communities due to their many applications. Like expander graphs, HDXs are especially interesting for…
A simplex-based network is referred to as a higher-order network, in which describe that the interactions can include more than two nodes. Many multicomponent interactions can be grasped through simplicial complexes, which have recently…
The vertex-weighted Laplacian naturally extends the combinatorial Laplacian for simplicial complexes. Inspired by Lew's foundational techniques for vertex-weighted Laplacians, we present a comprehensive spectral analysis of this operator.…
In projective dimension growth results, one bounds the number of rational points of height at most $H$ on an irreducible hypersurface in $\mathbb P^n$ of degree $d>3$ by $C(n)d^2 H^{n-1}(\log H)^{M(n)}$, where the quadratic dependence in…
Network science is a powerful framework allowing to model complex systems, it is capable to describe and take into account the intricate web of connections existing among the constituting basic element of the system. Recently scholars have…
A self-similar growth-fragmentation describes the evolution of particles that grow and split as time passes. Its genealogy yields a self-similar continuum tree endowed with an intrinsic measure. Extending results of Haas for pure…
We resolve a conjecture of Kalai asserting that the $g_2$-number of any simplicial complex $\Delta$ that represents a connected normal pseudomanifold of dimension $d\geq 3$ is at least as large as ${d+2 \choose 2}m(\Delta)$, where…
We investigate the giant component formed via high-dimensional paths in the multi-parameter random simplicial complex (MRSC) model. For a $d$-dimensional simplicial complex, we define $d$-dimensional connectivity through incidence between…
We survey determinantal singularities, their deformations, and their topology. This class of singularities generalizes the well studied case of complete intersections in several different aspects, but exhibits a plethora of new phenomena…
For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…
In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…