Related papers: Lower Bound Theorems and a Generalized Lower Bound…

We present a short proof of the following Pontryagin theorem, whose original proof was complicated and has never been published in details: {\bf Theorem.} Let $M$ be a connected oriented closed smooth 3-manifold. Let $L_1(M)$ be the set of…

We give a complete combinatorial characterization of weakly $d$-Tverberg complexes. These complexes record which intersection combinatorics of convex hulls necessarily arise in any sufficiently large general position point set in $\mathbb…

We introduce "$t$-LC triangulated manifolds" as those triangulations obtainable from a tree of $d$-simplices by recursively identifying two boundary $(d-1)$-faces whose intersection has dimension at least $d-t-1$. The $t$-LC notion…

For each fixed $d\ge 1$, we obtain asymptotic estimates for the number of $d$-representable simplicial complexes on $n$ vertices as a function of $n$. The case $d=1$ corresponds to counting interval graphs, and we obtain new results in this…

A conjecture of Kalai asserts that for $d\geq 4$, the affine type of a prime simplicial $d$-polytope $P$ can be reconstructed from the space of affine $2$-stresses of $P$. We prove this conjecture for all $d\geq 5$. We also prove the…

We extend the assertion of the Generalized Lower Bound Theorem (GLBT) to general polytopes under the assumption that their low dimensional skeleton is simplicial, with partial results for the general case. We prove a quantitative version of…

In a rooted tree, we call a vertex {\em balanced} if it is at equal distance from all its descendant leaves. We count balanced vertices in three different tree varieties. For decreasing binary trees, we can prove that the probability that a…

This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…

We develop a generalization of manifold calculus in the sense of Goodwillie-Weiss where the manifold is replaced by a simplicial complex. We consider functors from the category of open subsets of a fixed simplical complex into the category…

This paper has been withdrawn by the author. Peterson and Woodall previously proved that the list-edge-colouring conjecture holds for graphs without odd cycles of length 5 or longer. D. Peterson and D. R. Woodall, Edge-choosability in…

In this paper, the concept of balanced manifolds is generalized to reduced complex spaces: the class B and balanced spaces. Compared with the case of Kahlerian, the class B is similar to the Fujiki class C and the balanced space is similar…

In this paper, we show that there is a close relationship between generalized subtangent manifolds and Lie groupoids. We obtain equivalent assertions among the integrability conditions of generalized almost subtangent manifolds, the…

The Bounded Negativity Conjecture predicts that for any smooth complex surface $X$ there exists a lower bound for the selfintersection of reduced divisors on $X$. This conjecture is open. It is also not known if the existence of such a…

For $d \geq 2$, Walkup's class ${\cal K}(d)$ consists of the $d$-dimensional simplicial complexes all whose vertex-links are stacked $(d-1)$-spheres. Kalai showed that for $d \geq 4$, all connected members of ${\cal K}(d)$ are obtained from…

We construct new examples of immersed minimal surfaces with catenoid ends and finite total curvature, of both genus zero and higher genus. In the genus zero case, we classify all such surfaces with at most $2n+1$ ends, and with symmetry…

Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…

This is a survey of recent advances in commutative algebra, especially in mixed characteristic, obtained by using the theory of perfectoid spaces. An explanation of these techniques and a short account of the author's proof of the direct…

A vertex coloring of a simplicial complex $\Delta$ is called a linear coloring if it satisfies the property that for every pair of facets $(F_1, F_2)$ of $\Delta$, there exists no pair of vertices $(v_1, v_2)$ with the same color such that…

We introduce the notions of mixed resolutions and simplicial sections, and prove a theorem relating them. This result is used (in another paper) to study deformation quantization in algebraic geometry.

A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…