Related papers: Random complexes with free involution

We show that there is an almost complex structure on a differential calculus on finite points coming from a bidirected finite graph without multiple edges or loops. We concentrate on a polygon as a concrete case. In particular, a…

For the double complex structure of grading-restricted vertex algebra cohomology defined in \cite{Huang}, we introduce a multiplication of elements of double complex spaces. We show that the orthogonality and bi-grading conditions applied…

Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…

The immediate snapshot complexes were introduced as combinatorial models for the protocol complexes in the context of theoretical distributed computing. In the previous work we have developed a formal language of witness structures in order…

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

We provide new vanishing and glueing results for relative simplicial volume, following up on two current themes in bounded cohomology: The passage from amenable groups to boundedly acyclic groups and the use of equivariant topology. More…

We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…

The main result of this note is a parametrized version of the Borsuk-Ulam theorem. We show that for a continuous family of Borsuk-Ulam situations, parameterized by points of a compact manifold W, its solution set also depends continuously…

A large variety of interacting complex systems are characterized by interactions occurring between more than two nodes. These systems are described by simplicial complexes. Simplicial complexes are formed by simplices (nodes, links,…

Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…

We prove that any quasirandom uniform hypergraph $H$ can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our results also apply to multipartite hypergraphs and even to the…

We show that the probability for a finitely generated subgroup of the modular group, of size $n$, to be almost malnormal or non-parabolic, tends to 0 as $n$ tends to infinity -- where the notion of the size of a subgroup is based on a…

We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…

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…

We show that (with one possible exception) there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski dense.…

The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…

Let M be a closed (n-1)-connected 2n-dimensional smooth manifold with n > 2. In terms of the system of invariants for such manifolds introduced by Wall, we obtain necessary and sufficient conditions for M to admit an almost complex…

We propose a semiparametric family of copulas based on a set of orthonormal functions and a matrix. This new copula permits to reach values of Spearman's Rho arbitrarily close to one without introducing a singular component. Moreover, it…

Simplicial complexes are generalized network structures able to encode interactions occurring between more than two nodes. Simplicial complexes describe a large variety of complex interacting systems ranging from brain networks, to social…