# Tagged Questions

**6**

votes

**0**answers

139 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 ...

**0**

votes

**1**answer

205 views

### What are the morphisms in the category of zig-zags?

For some reason I am having trouble locating a transparent explanation of precisely what are the morphisms in the category of zig-zags. The objects of this category are specified completely by triples ...

**4**

votes

**2**answers

324 views

### Removing a simplicial subset from a simplicial set

Let $A, X$ be simplicial sets, and suppose there's an inclusion $A \longrightarrow X$. Geometrically realizing the inclusion map, we get a pair of spaces $(\mathcal{A}, \mathcal{X})$. I want to find ...

**13**

votes

**3**answers

616 views

### Testing simplicial complexes for shellability

Question
Are there efficient algorithms to check if a finite simplicial complex defined in terms of its maximal facets is shellable?
By efficient here I am willing to consider anything with ...

**8**

votes

**0**answers

114 views

### Diameter of simplicial complex mirrored in property of Stanley-Reisner ring?

Consider a pure finite abstract simplicial complex $\Delta$. Define its diameter as the maximal distance between any two facets, i.e., between any two faces of maximal dimension $d-1$. The distance ...

**15**

votes

**1**answer

495 views

### How many simplicial complexes on n vertices up to homotopy equivalence?

Fix a number $n$, and define $\gamma(n)$ to be the number of simplicial complexes on $n$ unlabeled vertices up to homotopy equivalence. It is unlikely that an explicit formula exists, but what is ...

**4**

votes

**0**answers

212 views

### Extending the vertex-facet correspondence from Δ to Θ

Recall that in the $n$-simplex $\Delta[n]$, we have a combinatorially crucial bijection between facets, (codimension $1$ faces) and vertices, where the $i$th face of a simplex corresponds to the full ...

**1**

vote

**1**answer

108 views

### Generalizing the internal angle of a graph in $\mathbb{E}^2$ to $\mathbb{S}^2$

I am currently working on research involving packing problems and am finding myself needing the tools from Combinatorial Geometry (in particular, I've been reading Pach and Agarwal's book on the ...

**2**

votes

**1**answer

336 views

### Extending the definition of “pure of dimension n” from simplicial complexes to simplicial sets?

Recall that a (combinatorial) simplicial complex $X$ is said to be $n$-dimensional if it contains at least one face of dimension $n$ and no faces of dimension $n+1$. Further, an $n$-dimensional ...

**8**

votes

**1**answer

378 views

### Does this “flipping lexicographic” ordering have a standard name?

I’ve run into the following straightforward variant of lexicographic ordering, and am wondering if it has a standard name. I’ve been calling it the flipping lexicographic ordering, for evident ...

**8**

votes

**0**answers

298 views

### A combinatorial approximation functor sSet->qCat

Let $sSet_J$ denote the category of simplicial sets equipped with the Joyal model structure. Simply by the fact that $sSet_J$ is locally presentable and its class of anodynes ($\neq \mathbf{Cof} \cap ...

**13**

votes

**3**answers

622 views

### Triangulations of polyhedra

A topologist came to me with this question, but everything I think should work doesn't.
How many triangulations are there of a polyhedron with n vertices?
By a "triangulation" of a polyhedron P we ...

**2**

votes

**2**answers

380 views

### Definition of and intuition for regular subdivisions of a polytope

I'm doing a research project that involves subdividing a product of simplices. Specifically, I'm looking at theorem 2.4 from this paper:
math.sfsu.edu/federico/Articles/tropOMs.pdf
which references ...

**5**

votes

**0**answers

285 views

### Expected degree of a vertex in a tetrahedralization?

Definitions
I will define the degree of a vertex in a tetrahedralization to be the number of highest dimensional cells (which in this case are tetrahedra) that touch the vertex.
Let $S$ be a fixed ...

**6**

votes

**0**answers

709 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, ...

**3**

votes

**1**answer

329 views

### Do all correlation coefficients induce a pseudometric?

The Kendall tau distance was originally defined as a correlation coefficient. It seems clear to me that every metric function $d$ that is bounded by $b$, induces a correlation coefficient. That is:
...