# Tagged Questions

**6**

votes

**0**answers

138 views

### Uniformly sampling from the set of all simplicial maps

Let $K$ and $L$ be finite simplicial complexes that remain fixed throughout.
How does one efficiently sample (according to the uniform distribution) elements from the finite set of simplicial ...

**3**

votes

**1**answer

258 views

### Does each “prod-simplicial” regular cell complex come from a unique rooted tree?

Since about the time I asked the question, What is the precise relationship between "prodsimplicial sets" and rooted trees? I have been playing with these rooted trees and their ...

**3**

votes

**1**answer

230 views

### Generalizing the circle packing theorem to 3-dimensions

The circle packing theorem (Koebeâ€“Andreevâ€“Thurston theorem) states that every finite planar graph is the nerve of some disk packing in the plane, where the nerve of a packing $P$ is a graph $G=(V,E)$, ...

**3**

votes

**1**answer

456 views

### What is the chromatic number of the graph whose vertices dimension $n-2$ subsimplicies of $\Delta^n$ and an edge between two vertices is given if the two associated $n-2$ vertices are contained in the same $n-1$ subsimplex?

Let us first remark that all of this takes place on the boundary of $\Delta^n$. The question that I wanted to solve that led to the question in the title is as follows: Let ...

**4**

votes

**2**answers

463 views

### Generalization of Hamiltonian cycles to “Hamiltonian spheres”

One possible generalization of a Hamiltonian cycle in a triangulated plane graph is what could be
called a Hamiltonian sphere: a collection of triangles within a simplicial complex in $\mathbb{R}^3$
...

**6**

votes

**0**answers

697 views

### Simplicial Representations of (Hyper)Graph Complexes

For graph complexes, which are families of graph [on a fixed number of vertices n] closed under the deletion of edges, there is a natural simplicial complex capturing that information. Specifically, ...

**2**

votes

**3**answers

867 views

### Boolean network as a gauge field

Consider a set of N binary-state nodes at "time" t, each of which is a (boolean) transition function of two nodes in the set, evaluated at time t-1. Thus there are N of these boolean functions of two ...