Frank H. Lutz
In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal triangulations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We explicitly construct small triangulations for a number of well-known 3-dimensional manifolds and give a brief outline of some aspects of the underlying theory of 3-manifolds and its historical development.
We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a vertex-transitive automorphism group on $n\leq 13$ vertices. With the exception of actions of groups of small order, the enumeration is extended to 14 and 15 vertices.
Principal circle bundle over a PL polyhedron can be triangulated and thus obtains combinatorics. The triangulation is assembled from triangulated circle bundles over simplices. To every triangulated circle bundle over a simplex we associate a necklace (in combinatorial sense). We express rational local formulas for all powers of first Chern class in the terms of mathematical expectations of parities of the associated necklaces. This rational parity is a combinatorial isomorphism invariant of triangulated circle bundle over simplex, measuring mixing by triangulation of the circular graphs over …
We construct 2^{Ω(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves that asymptotically, there are far more combinatorial types of triangulated 3-spheres than of simplicial 4-polytopes on n vertices. This complements results of Kalai (1988), who had proved a similar statement about d-spheres and (d+1)-polytopes for fixed d >= 4.
Here we are fixing an output of a trivial calculation based on Konsevich's differential 2-form for the Chern class of polygon bundle. As a result an interesting combinatorics and arithmetics jumps right out of a jukebox. The calculation gives very simple rational combinatorial characteristics (we call it "curvature") of a triangulated $S^1$ bundle over a 2-simplex, which is a local combinatorial formula for the first Chern class. The curvature is expressed in terms of cyclic word in 3-character alphabet associated to the bundle. From the point of view of simplicial combinatorics the word is a …
The aim of this paper is to give a survey of the known results concerning centrally symmetric polytopes, spheres, and manifolds. We further enumerate nearly neighborly centrally symmetric spheres and centrally symmetric products of spheres with dihedral or cyclic symmetry on few vertices, and we present an infinite series of vertex-transitive nearly neighborly centrally symmetric 3-spheres.
We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can be obtained by choosing coordinates randomly.
We give an explicit combinatorial formula for the Laurent expansion of any arc or closed curve on an unpunctured triangulated orbifold. We do this by extending the snake graph construction of Musiker, Schiffler, and Williams to unpunctured orbifolds. In the case of an ordinary arc, this gives a combinatorial proof of positivity to the generalized cluster algebra from this orbifold.
We present a fast enumeration algorithm for combinatorial 2- and 3-manifolds. In particular, we enumerate all triangulated surfaces with 11 and 12 vertices and all triangulated 3-manifolds with 11 vertices. We further determine all equivelar polyhedral maps on the non-orientable surface of genus 4 as well as all equivelar triangulations of the orientable surface of genus 3 and the non-orientable surfaces of genus 5 and 6.
Combinatorial cluster expansion formulas from triangulated surfaces
本文给出了由三角剖分曲面定义的带主系数簇代数的簇展开公式，用角的完美匹配表示，简化了 Musiker-Schiffler-Williams 的公式，并证明其与蛇图、二部图完美匹配及带势箭图极小割的双射对应关系。
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most a fixed number of vertices. We specialize the theory for the case where the number of vertices is at most 11 and we get theoretical restrictions on genus-surfaces allowing us to get the list of triangulations of closed surfaces with at most 11 vertices.
If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the vertices of platonic solids have to be used. With a coloring monodromy one can associate a branched cover. This generalizes to a space of germs between two triangulated surfaces. We also discuss relations with Belyi surfaces and with cone-metrics of constant curvature.
We show that if a connected, Hom-finite, Krull-Schmidt triangulated category has an Auslander-Reiten quiver component with Dynkin tree class then the category has Auslander-Reiten triangles and that component is the entire quiver. This is an analogue for triangulated categories of a theorem of Auslander, and extends a previous result of Scherotzke. We also show that if there is a quiver component with extended Dynkin tree class, then other components must also have extended Dynkin class or one of a small set of infinite trees, provided there is a non-zero homomorphism between the components. T…
We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial operations; (b) in dimension $d \geq 4$, if $Δ$ is a tight connected closed homology $d$-manifold whose $i$th homology vanishes for $1 < i < d-1$, then $Δ$ is a stacked triangulation of a manifold.These results give affirmative answers to questions posed by Novik and Swartz and by Effenberger.
We investigate triangulations of the two-dimensional sphere and torus with the faces properly colored white and black. We focus on matchings between white triangles and incident vertices. On the torus our objects are perfect pairings, whereas on the sphere this is only true after removing one triangle and its vertices. In the latter case, such matchings (first studied by Tutte) extend the notion of state in Kauffman's formal knot theory and we show that his Clock Theorem, in its form due to Gilmer and Litherland, also extends: the set of matchings naturally forms a distributive lattice. Here t…
A triangulation of a surface is called $q$-equivelar if each of its vertices is incident with exactly $q$ triangles. In 1972 Altshuler had shown that an equivelar triangulation of torus has a Hamiltonian Circuit. Here we present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in equivelar triangulation of a surface.
We introduce the $k$-stellated spheres and consider the class ${\cal W}_k(d)$ of triangulated $d$-manifolds all whose vertex links are $k$-stellated, and its subclass ${\cal W}^{\ast}_k(d)$ consisting of the $(k+1)$-neighbourly members of ${\cal W}_k(d)$. We introduce the mu-vector of any simplicial complex and show that, in the case of 2-neighbourly simplicial complexes, the mu-vector dominates the vector of its Betti numbers componentwise; the two vectors are equal precisely for tight simplicial complexes. We are able to estimate/compute certain alternating sums of the components of the mu-v…
How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial map in triangulated combinatorial surfaces (or their dual cross-metric counterpart). Our work builds upon Riemannian systolic inequalities, which bound the minimum length of non-trivial closed curves in terms of the genus and the area of the surface. We first describe a systematic way to translate Riemannian systolic inequalities to a discrete…
We give a complete enumeration of all combinatorial 3-manifolds with 10 vertices: There are precisely 247882 triangulated 3-spheres with 10 vertices as well as 518 vertex-minimal triangulations of the sphere product $S^2\times S^1$ and 615 triangulations of the twisted sphere product $S^2_\times_S^1$. All the 3-spheres with up to 10 vertices are shellable, but there are 29 vertex-minimal non-shellable 3-balls with 9 vertices.
In a recent work [2] with Datta, we introduced the mu vector (with respect to a given field) of simplicial complexes and used it to study tightness and lower bounds. In this paper, we modify the definition of mu vectors. With the new definition, most results of [2] become correct without the hypothesis of 2-neighbourliness. In particular, the combinatorial Morse inequalities of [2] are now true of all simplicial complexes. As an application, we prove the following generalized lower bound theorem (GLBT) for connected locally tame combinatorial manifolds. If $M$ is such a manifold of dimension $…
In this paper we present a self-contained combinatorial proof of the lower bound theorem for normal pseudomanifolds, including a treatment of the cases of equality in this theorem. We also discuss McMullen and Walkup's generalised lower bound conjecture for triangulated spheres in the context of the lower bound theorem. Finally, we pose a new lower bound conjecture for non-simply connected triangulated manifolds.
We give explicit realizations with small integer coordinates for all triangulated tori with up to 12 vertices. In particular, we provide coordinate-minimal realizations in general position for all triangulations of the torus with 7, 8, 9, and 10 vertices. For the unique 7-vertex triangulation of the torus we show that all corresponding 72 oriented matroids are realizable in the 6x6x6-cube. Moreover, we present polyhedral tori with 8 vertices in the 2x2x2-cube, general position realizations of triangulated tori with 8 vertices in the 2x2x3-cuboid as well as polyhedral tori with 9 and 10 vertice…
We give an explicit construction of vertex-transitive tight triangulations of $d$-manifolds for $d\geq 2$. More explicitly, for each $d\geq 2$, we construct two $(d^2+5d+5)$-vertex neighborly triangulated $d$-manifolds whose vertex-links are stacked spheres. The only other non-trivial series of such tight triangulated manifolds currently known is the series of non-simply connected triangulated $d$-manifolds with $2d+3$ vertices constructed by Kühnel. The manifolds we construct are strongly minimal. For $d\geq 3$, they are also tight neighborly as defined by Lutz, Sulanke and Swartz. Like Kühne…
Odd sun-free Triangulated Graphs are $S$-perfect
本文研究$S$-完美图的结构性质，证明了弦图是$S$-完美的充要条件是不含奇太阳，该结果为$S$-完美图的禁用子图结构刻画猜想提供了支撑。
On the expansion formulas of cluster varieties from surfaces and their combinatorial properties
本文研究了从表面出发的簇代数展开公式及其组合性质，通过三角剖分翻转推导递推关系，并证明了簇突变的稳定性特性。
Schnyder woods are a well-known combinatorial structure for plane triangulations, which yields a decomposition into 3 spanning trees. We extend here definitions and algorithms for Schnyder woods to closed orientable surfaces of arbitrary genus. In particular, we describe a method to traverse a triangulation of genus $g$ and compute a so-called $g$-Schnyder wood on the way. As an application, we give a procedure to encode a triangulation of genus $g$ and $n$ vertices in $4n+O(g \log(n))$ bits. This matches the worst-case encoding rate of Edgebreaker in positive genus. All the algorithms present…
Construction of combinatorial manifolds with the prescribed sets of links of vertices
本文研究有向闭组合流形顶点链接同构类集合的变换L及其求逆问题，通过显式构造证明平衡组合球面集合在扩充后属于L的像集，并基于奇点消解将其应用于带奇点流形配边及有理Pontryagin类的局部公式构造。
The 4-dimensional abstract Kummer variety K^4 with 16 nodes leads to the K3 surface by resolving the 16 singularities. Here we present a simplicial realization of this minimal resolution. Starting with a minimal 16-vertex triangulation of K^4 we resolve its 16 isolated singularities - step by step - by simplicial blowups. As a result we obtain a 17-vertex triangulation of the standard PL K3 surface. A key step is the construction of a triangulated version of the mapping cylinder of the Hopf map from the real projective 3-space onto the 2-sphere with the minimum number of vertices. Moreover we …
We study a variation of Bagchi and Datta's $σ$-vector of a simplicial complex $C$, whose entries are defined as weighted averages of Betti numbers of induced subcomplexes of $C$. We show that these invariants satisfy an Alexander-Dehn-Sommerville type identity, and behave nicely under natural operations on triangulated manifolds and spheres such as connected sums and bistellar flips. In the language of commutative algebra, the invariants are weighted sums of graded Betti numbers of the Stanley-Reisner ring of $C$. This interpretation implies, by a result of Adiprasito, that the Billera-Lee sph…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we completely enumerate all combinatorial types of 4-dimensional polytopes with 9 vertices. It is shown that all of those combinatorial types are rational: They can be realized with rational coordinates. We find 316014 combinatorial spheres on 9 vertices. Of those, 274148 can be realized as the boundary complex of a four-dimensional polytope and the remaining 41866 a…
In terms of the number of triangles, it is known that there are more than exponentially many triangulations of surfaces, but only exponentially many triangulations of surfaces with bounded genus. In this paper we provide a first geometric extension of this result to higher dimensions. We show that in terms of the number of facets, there are only exponentially many geometric triangulations of space forms with bounded geometry in the sense of Cheeger (curvature and volume bounded below, and diameter bounded above). This establishes a combinatorial version of Cheeger's finiteness theorem. Further…
A Complete Classification of Discrete $d$-Pseudomanifolds with at Most $2d+7$ Vertices
本文完全分类了顶点数不超过2d+7的离散d-伪流形，证明了最小顶点数为2(d+1)，并建立了与旗正规d-伪流形边图的等价性，给出了旗正规d-伪流形为球面的最优刻画，构造了非球面例子。
Ky Fan theorem for sphere bundles
本文将经典 Ky Fan 定理从三角剖分球面推广到三角剖分球丛的全空间，扩展了关于对跖着色的组合拓扑结论。
There is no 5,7-triangulation of the torus, that is, no triangulation with exactly two exceptional vertices, of degree 5 and 7. Similarly, there is no 3,5-quadrangulation. The vertices of a 2,4-hexangulation of the torus cannot be bicolored. Similar statements hold for 4,8-triangulations and 2,6-quadrangulations. We prove these results, of which the first two are known and the others seem to be new, as corollaries of a theorem on the holonomy group of a euclidean cone metric on the torus with just two cone points. We provide two proofs of this theorem: One argument is metric in nature, the oth…
Nicholas Pippenger and Kristin Schleich have recently given a combinatorial interpretation for the second-order super-Catalan numbers (u_{n})_{n>=0}=(3,2,3,6,14,36,...): they count "aligned cubic trees" on n internal vertices. Here we give a combinatorial interpretation of the recurrence u_{n} = Sum_{k=0}^{n/2-1} ({n-2}choose{2k} 2^{n-2-2k} u_{k}): it counts these trees by number of deep interior vertices where deep interior means "neither a leaf nor adjacent to a leaf".
Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of the concept of convexity. In even dimensions, super-neighborliness is known to be a purely combinatorial condition which implies the tightness of a triangulation. Here we present other sufficient and purely combinatorial conditions which can be applied to the odd-dimensional case as well. One of the conditions is that all vertex links are stacked spheres, whic…
The search for universality in random triangulations of manifolds, like those featuring in (Euclidean) Dynamical Triangulations, is central to the random geometry approach to quantum gravity. In case of the 3-sphere, or any other manifold of dimension greater than two for that matter, the pursuit is held back by serious challenges, including the wide open problem of enumerating triangulations. In an attempt to bypass the toughest challenges we identify a restricted family of triangulations, of which the enumeration appears less daunting. In a nutshell, the family consists of triangulated 3-sph…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent pentagons. We show that the tiling cannot have only one vertex of degree >3. Moreover, we construct earth map tilings, which give classifications under the condition that vertices of degree >3 are at least of distance 4 apart, or under the condition that there are exactly two vertices of degree >3.
The Sperner and Tucker lemmas are combinatorial analogous of the Brouwer and Borsuk - Ulam theorems with many useful applications. These classic lemmas are concerning labellings of triangulated discs and spheres. In this paper we show that discs and spheres can be substituted by large classes of manifolds with or without boundary.
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces. Further, we define multiplication of these objects, that coincides with the multiplication of permutations. We consider closed under multiplication classes of combinatorial maps that consist of closed classes of combinatorial maps with fixed edges where each such class is defined by a knot. One class among them is special, containing selfconjugate maps.
Mayer's theory of cluster integrals allows one to write the partition function of a gas model as a generating function of weighted graphs. Recently, Labelle, Leroux and Ducharme have studied the graph weights arising from the one-dimensional hard-core gas model and noticed that the sum of the weights over all connected graphs with $n$ vertices is $(-n)^{n-1}$. This is, up to sign, the number of rooted Cayley trees on $n$ vertices and the authors asked for a combinatorial explanation. The main goal of this article is to provide such an explanation.
Random Colorings in Manifolds
本文提出基于三角剖分顶点随机着色构造任意维随机子流形的方法，刻画可出现子流形的拓扑条件，证明三维球中平凡纽结概率指数衰减，并分析期望 Euler 示性数、同调渗流及拓扑搜索应用。
Bowlin and Brin defined the class of color graphs, whose vertices are triangulated polygons compatible with a fixed four-coloring of the polygon vertices. In this article it is proven that each color graph has a vertex-induced embedding in a hypercube, and an upper bound is given for the hypercube dimension. The color graphs for $n$-gons up to $n=8$ are listed and some of their features are discussed. Finally it is shown that certain color graphs cannot be isometrically embedded in a hypercube of any dimension.
On the number of drawings of a combinatorial triangulation
本文研究组合三角剖分在平面点集上作为几何三角剖分的绘制方式数量，证明存在下界$\Omega(1.31^n)$并给出双链点集上的上界。
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge of algebra and topology. On the other hand, we also develop new techniques and results using this approach. In particular, we provide - A novel, self-contained method of establishing Reisner's theorem and Schenzel's formula for Buchsbaum complexes. - A simple new way to establish Poincaré duality for face rings of manifolds, in much greater generality and p…
A combinatorial bound on the number of distinct eigenvalues of a graph
本文研究了图的distinct eigenvalues数量的组合界，并探讨了minor-monotone floor的相关性质。
We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids recently introduced by the second author to construct counter-examples to the Hirsch conjecture. We show that the `strong $d$-step Theorem' that allows to construct such large-diameter polytopes from `non-$d$-step' prismatoids still works at this combinatorial level. Then, using metaheuristic methods on the flip graph, we construct four combinatorially different non-$d$-step $4$-dimensional topological prismatoids with $14$ vertices. This implies the existence of $8$-dimensional spheres with $18$ v…
Faber-Krahn inequalities for first Dirichlet eigenvalues of combinatorial $p$-Laplacian on graphs with boundary
本文研究了图上组合p-拉普拉斯算子的第一狄利克雷特征值的费伯-克兰不等式，证明当p>1时，具有n个顶点或n条边的连通图的最小第一p-狄利克雷特征值仅在 tadpole 图T_{n,3}上取得。
The Faber-Krahn inequality states that among all open domains with a fixed volume in R^n, the ball minimizes the first Dirichlet eigenvalue of the Laplacian. We study an asymptotic discrete analogue of this for the combinatorial Dirichlet Laplacian acting on induced subgraphs of Z^2. Namely, an induced subgraph G with n vertices is called a minimizing subgraph if it minimizes the first eigenvalue of the combinatorial Dirichlet Laplacian among all induced subgraphs with n vertices. Consider an induced subgraph G and take the interior of the union of closed squares of area 1 about each point of …
We give a combinatorial proof of a recent result of Bóna by constructing a bijection from the set of all neighbors of leaves of increasing trees of size $n$ to the set of derangements of length $n$.
The maximum volume polytope with nine vertices inscribed in the sphere
该研究解决了凸几何中9顶点内接球面最大体积多面体的经典问题，结合组合与几何方法，确定了其体积上界及对应构型。
In this note we prove that the number of combinatorial types of $d$-polytopes with $d+1+α$ vertices and $d+1+β$ facets is bounded by a constant independent of $d$.
A planar PCC graph is a simple connected planar graph with everywhere positive combinatorial curvature which is not a prism or an antiprism and with all vertices of degree at least 3. We prove that every planar PCC graph has at most 208 vertices, thus answering completely a question raised by DeVos and Mohar. The proof is based on a refined discharging technique and on an accurate low-scale combinatorical description of such graphs. We also prove that all faces in a planar PCC graph have at most 41 sides, and this result is sharp as well.
The study of combinatorial games is intimately tied to the study of graphs, as any game can be realized as a directed graph in which players take turns traversing the edges until reaching a sink. However, there have heretofore been few efforts towards analyzing game graphs using graph theoretic metrics and techniques. A set $S$ of vertices in a graph $G$ resolves $G$ if every vertex in $G$ is uniquely determined by the vector of its distances from the vertices in $S$. A metric basis of $G$ is a smallest resolving set and the metric dimension is the cardinality of a metric basis. In this articl…
Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian case, where the inequality holds under a topological assumption of "essentiality", our proofs rely on a combinatorial analogue of that assumption. Under a stronger assumption, expressed in terms of cohomology cup-length, we improve our results quantitatively. We also illustrate our methods in the continuous setting, generalizing and improving quantitatively …
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a condensed but very basic introduction to the algebraic topology of simplicial manifolds. This text will appear as a chapter in the forthcoming book "Triangulated Manifolds with Few Vertices" by Frank H. Lutz.
A centrally symmetric $2d$-vertex combinatorial triangulation of the product of spheres $§^i\times§^{d-2-i}$ is constructed for all pairs of non-negative integers $i$ and $d$ with $0\leq i \leq d-2$. For the case of $i=d-2-i$, the existence of such a triangulation was conjectured by Sparla. The constructed complex admits a vertex-transitive action by a group of order $4d$. The crux of this construction is a definition of a certain full-dimensional subcomplex, $\B(i,d)$, of the boundary complex of the $d$-dimensional cross-polytope. This complex $\B(i,d)$ is a combinatorial manifold with bounda…
An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
本文提出一种代数-组合方法，用于计算高正则性有限图中顶点间的平均到达时间，并应用于多种图类。通过最大熵随机游走与权重均衡划分的联系，扩展了已知结果。
For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested in polynomial time, and for every $f$-vector of $3$-polytopes, there exists an inscribable polytope with that $f$-vector. For higher-dimensional polytopes, much less is known. Of course, for any inscribable polytope, all of its lower-dimensional faces need to be inscribable, but this condition does not appear to be very strong. We observe non-trivial new ob…
We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let $G$ be a weighted graph with $n$ vertices. In the most general setting, the $n$ vertices are known and no other information about $G$ is given. The problem is finding all edges of $G$ and their weights using additive queries, where, for an additive query, one chooses a set of vertices and asks the sum of the weights of edges with both ends in the set. This model has been extensively used in bioinformatics including genom sequencing. Extending recent results of Bshouty and Mazzawi, and Choi …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。