Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
93 views

Minimal set of geometric moves in various equivalence classes of triangulated geometries

I would like to get to know what is the minimal set of geometric changes "aka. moves" (topology preserving modifications / Pachner moves / bistellar moves) that can transform any 3-...
Kregnach's user avatar
  • 183
5 votes
1 answer
368 views

Six people standing on earth

Consider 6 people $p_i$, $i=1,\dots 6$, standing on a sphere $S^2$. We label the positions of these people by $p_i$ again. Suppose no pair of these points $p_i$ are antipodal. At each point $p_i$ ...
MathLearner's user avatar
6 votes
1 answer
539 views

Proofs of Euler's characteristic formula for n-Dim polytopes

Twenty proofs of Euler's formula V - E + F - 1 = 1, which applies to convex polyhedrons, i.e., 3-dimensional polytopes, are presented at the Geometry Junkyard. I'm interested in proofs of the more ...
Tom Copeland's user avatar
  • 10.5k
27 votes
2 answers
2k views

Combinatorics of K(Z,2)?

Anybody knows a semi-simplicial model for $K(Z,2)$ having finite number of simplexes in any dimension? With some regular description? I have heard about big activity on triangulating $CP^n$ but this ...
Nikolai Mnev's user avatar
  • 1,482
4 votes
0 answers
130 views

program to compute hurwitz numbers

Is there a computer program available to compute Hurwitz numbers easily? In fact I only care about counting covers $C\to\mathbb{P}^1$ branched over $0,1,\infty$, and am even willing to restrict to the ...
Hans Sachs's user avatar
18 votes
2 answers
984 views

A direct proof of the Harer-Zagier recursion enumerating the ways to paste a 2n-gon to get a genus g surface?

In a 1986 paper, Harer and Zagier proved the recursion: $$(n+1)e(g,n)=(4n-2)e(g,n-1)+(2n-1)(n-1)(2n-3)e(g-1,n-2)$$ where e(g,n) is the number of ways of grouping sides $S_1...S_{2n}$ of a 2n-gon ...
Alfredo Hubard's user avatar
2 votes
0 answers
208 views

Sylvester-Gallai-type theorem for quadratic polynomials

Let $F_1, F_2$ and $F_3$ be finites sets of irreducible polynomials in $\mathbb{C}[x_0, \ldots, x_n]$ of degree at most $2$ such that $F_1 \cap F_2 \cap F_3 = \varnothing$ and for every $Q_1, Q_2$ ...
Alexey Milovanov's user avatar
0 votes
0 answers
74 views

Upper bound on number of cells created by varieties of co-dimension 1

Say I have polynomials $p_1,p_2,\dots,p_m$ in $\mathbb{R}^n$ (ie. over $n$ variables), each of degree $d$. Is there an upper bound on the number of "regions" created by the surfaces $p_i = 0$? Let's ...
rishig's user avatar
  • 143