English
Related papers

Related papers: Topology of random 2-dimensional cubical complexes

200 papers

We construct a CW decomposition $C_n$ of the $n$-dimensional half cube in a manner compatible with its structure as a polytope. For each $3 \leq k \leq n$, the complex $C_n$ has a subcomplex $C_{n, k}$, which coincides with the clique…

Geometric Topology · Mathematics 2008-12-04 R. M. Green

We prove a conjecture of Penrose about the standard random geometric graph process, in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of lengths taken in the l_p norm. We show…

Combinatorics · Mathematics 2009-07-28 Xavier Pérez-Giménez , Nicholas C. Wormald

We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…

Group Theory · Mathematics 2007-05-23 J. -F. Lafont

Motivated by applications such as discovering strong ties in social networks and assembling genome subsequences in biology, we study the problem of recovering a hidden $2k$-nearest neighbor (NN) graph in an $n$-vertex complete graph, whose…

Data Structures and Algorithms · Computer Science 2019-11-21 Jian Ding , Yihong Wu , Jiaming Xu , Dana Yang

We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…

Commutative Algebra · Mathematics 2017-10-25 Jesus De Loera , Christopher O'Neill , Dane Wilburne

For a $2n+1$-dimensional compact Sasakian manifold, if $n\ge 2$, we prove that the analytic germ of the variety of representations of the fundamental group at every semi-simple representation is quadratic. To prove this result, we prove the…

Differential Geometry · Mathematics 2020-07-30 Hisashi Kasuya

We study the spectral gap of the Erd\H{o}s--R\'enyi random graph through the connectivity threshold. In particular, we show that for any fixed $\delta > 0$ if $$p \ge \frac{(1/2 + \delta) \log n}{n},$$ then the normalized graph Laplacian of…

Combinatorics · Mathematics 2019-07-16 Christopher Hoffman , Matthew Kahle , Elliot Paquette

We develop a toric topological framework for studying the cohomology of Vietoris--Rips complexes $VR(Q_n;r)$ of hypercube graphs. Using total domination invariants and spectral methods, we establish general lower bounds on connectivity,…

Combinatorics · Mathematics 2026-05-04 Martin Bendersky , Salvatore Elia , Jelena Grbic

The main objective of this paper is to determine the simplicial and cyclic cohomology groups of the Cuntz semigroup algebra $\ell^1(\Cuntz)$. In order to do so, we first establish some general results which can be used when studying…

Functional Analysis · Mathematics 2010-07-28 Frédéric Gourdeau , Michael C. White

Let $\mathbb{S}_n$ denote the symmetric group on $[n]=\{1,\ldots,n\}$ with the uniform probability measure. For a permutation $\pi \in \mathbb{S}_n$ let $X_{\pi}$ denote the simplicial complex on the vertex set $[n]$ whose simplices are all…

Combinatorics · Mathematics 2024-06-28 Roy Meshulam , Omer Moyal

In this article we study Cohen-Macaulay modules over one-dimensional hypersurface singularities and the relationship with the representation theory of associative algebras using methods of cluster tilting theory. We give a criterion for…

Representation Theory · Mathematics 2010-11-01 Igor Burban , Osamu Iyama , Bernhard Keller , Idun Reiten

We construct finitely generated simple torsion-free groups with strong homological control. Our main result is that every subset of $\mathbb{N} \cup \{\infty\}$, with some obvious exceptions, can be realized as the set of dimensions of…

Group Theory · Mathematics 2025-04-14 Francesco Fournier-Facio , Bin Sun

We prove that random $\mathbb{Z}$-homomorphisms on weakly expanding bipartite graphs exhibit a strong "flatness" phenomenon. Extending prior work of Peled, Samotij, and Yehudayoff for expanders, we first show that on any bipartite $(n, d,…

Combinatorics · Mathematics 2026-04-06 Dingding Dong , Jinyoung Park

We give an $O(n^2(k+\log n))$ algorithm for computing the $k$-dimensional persistent homology of a filtration of clique complexes of cyclic graphs on $n$ vertices. This is nearly quadratic in the number of vertices $n$, and therefore a…

Computational Geometry · Computer Science 2019-10-15 Henry Adams , Ethan Coldren , Sean Willmot

A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. This random graph is a particular case of the soft random graph model introduced by Penrose, in…

Algebraic Topology · Mathematics 2025-07-15 Julián David Candela

A Hamiltonian cycle in a graph is a spanning subgraph that is homeomorphic to a circle. With this in mind, it is natural to define a Hamiltonian d-sphere in a d-dimensional simplicial complex as a spanning subcomplex that is homeomorphic to…

Combinatorics · Mathematics 2018-09-26 Zur Luria , Ran J. Tessler

We study the space $Q_n$ of all configurations of $n$ ordered points on the circle such that no three points coincide, and in which one of the points (say, the last one) is fixed. We compute its fundamental group for $n<6$ and describe its…

Group Theory · Mathematics 2025-10-29 Jacob Mostovoy

We show that certain classes of graphs of free groups contain surface subgroups, including groups with positive $b_2$ obtained by doubling free groups along collections of subgroups, and groups obtained by "random" ascending HNN extensions…

Group Theory · Mathematics 2015-11-03 Danny Calegari , Alden Walker

We consider two random group models: the hexagonal model and the square model, defined as the quotient of a free group by a random set of reduced words of length four and six respectively. Our first main result is that in this model there…

Group Theory · Mathematics 2019-06-25 Tomasz Odrzygóźdź

We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…

Combinatorics · Mathematics 2019-09-05 Johannes Carmesin
‹ Prev 1 4 5 6 7 8 10 Next ›