Minimal Triangulations Research Articles

Propagation Computation for Mixed Bayesian Networks Using Minimal Strong Triangulation

Propagation Computation for Mixed Bayesian Networks Using Minimal Strong Triangulation

Tight Complexes Are Golod

Abstract Golodness of a simplicial complex is defined algebraically in terms of the Stanley–Reisner ring, and it has been a long-standing problem to find its combinatorial characterization. Tightness of a simplicial complex is a combinatorial analogue of a tight embedding of a manifold into Euclidean space, and has been studied in connection to minimal manifold triangulations. In this paper, by using an idea from toric topology, we prove that tight complexes are Golod, and as a corollary, we obtain that a triangulation of a closed connected orientable manifold is Golod if and only if it is tight, which is a combinatorial characterization of Golodness for manifold triangulations.

Graphical Local Genetic Algorithm for High-Dimensional Log-Linear Models

Graphical log-linear models are effective for representing complex structures that emerge from high-dimensional data. It is challenging to fit an appropriate model in the high-dimensional setting and many existing methods rely on a convenient class of models, called decomposable models, which lend well to a stepwise approach. However, these methods restrict the pool of candidate models from which they can search, and these methods are difficult to scale. It can be shown that a non-decomposable model can be approximated by the decomposable model which is its minimal triangulation, thus extending the convenient computational properties of decomposable models to any model. In this paper, we propose a local genetic algorithm with a crossover-hill-climbing operator, adapted for log-linear graphical models. We show that the graphical local genetic algorithm can be used successfully to fit non-decomposable models for both a low number of variables and a high number of variables. We use the posterior probability as a measure of fitness and parallel computing to decrease the computation time.

Triangulations of non-archimedean curves, semi-stable reduction, and ramification

Let K be a complete discretely valued field with algebraically closed residue field and let ℭ be a smooth projective and geometrically connected algebraic K-curve of genus g. Assume that g⩾2, so that there exists a minimal finite Galois extension L of K such that ℭ L admits a semi-stable model. In this paper, we study the extension L∣K in terms of the minimal triangulation of C, a distinguished finite subset of the Berkovich analytification C of ℭ. We prove that the least common multiple d of the multiplicities of the points of the minimal triangulation always divides the degree [L:K]. Moreover, in the special case when d is prime to the residue characteristic of K, then we show that d=[L:K], obtaining a new proof of a classical theorem of T. Saito. We then discuss curves with marked points, which allows us to prove analogous results in the case of elliptic curves, whose minimal triangulations we describe in full in the tame case. In the last section, we illustrate through several examples how our results explain the failure of the most natural extensions of Saito’s theorem to the wildly ramified case.

Reconstruction anabélienne du squelette des courbes analytiques

In this work we bring to light some anabelian behaviours of analytic curves in the setting of Berkovich geometry. We show more precisely that the knowledge of the tempered fundamental group of some curves that we call analytically anabelian determines their analytic skeletons as graphs. The tempered fundamental group of a Berkovich space, introduced by Andr\'e, enabled Mochizuki to prove the first result of anabelian geometry in Berkovich geometry concerning analytifications of algebraic hyperbolic curves over $\overline{\mathbb{Q}}_p$. To that end, Mochizuki developed the categorical language of semi-graphs of anabelio\ids and tempero\ids. Our work consists in associating a graph of anabelio\ids to a Berkovich curve equipped with a minimal triangulation and in adapting the results of Mochizuki in order to recover the analytic skeleton of the curve. The novelty of this anabelian result in Berkovich geometry is that the curves we are interested in are not supposed anymore to be of algebraic nature. We show for example that the famous Drinfeld half-plane is an analytically anabelian curve.

Estimates of covering type and minimal triangulations based on category weight

Abstract In a recent publication [D. Govc, W. A. Marzantowicz and P. Pavešić, Estimates of covering type and the number of vertices of minimal triangulations, Discrete Comput. Geom. 63 2020, 1, 31–48], we have introduced a new method, based on the Lusternik–Schnirelmann category and the cohomology ring of a space X, that yields lower bounds for the size of a triangulation of X. In this current paper, we present an important extension that takes into account the fundamental group of X. In fact, if π 1 ⁢ ( X ) {\pi_{1}(X)} contains elements of finite order, then one can often find cohomology classes of high ‘category weight’, which in turn allow for much stronger estimates of the size of triangulations of X. We develop several weighted estimates and then apply our method to compute explicit lower bounds for the size of triangulations of orbit spaces of cyclic group actions on a variety of spaces including products of spheres, Stiefel manifolds, Lie groups and highly-connected manifolds.

Avoidable vertices and edges in graphs: Existence, characterization, and applications

A vertex in a graph is simplicial if its neighborhood forms a clique. We consider three generalizations of the concept of simplicial vertices: avoidable vertices (also known as OCF-vertices), simplicial paths, and their common generalization avoidable paths. In an earlier version of this paper, published as an extended abstract in the proceedings of the 16th International Symposium on Algorithms and Data Structures (WADS 2019), we presented a general conjecture on the existence of avoidable paths. The conjecture was recently proved by Bonamy et al. (2020). The conjecture—now a theorem—implies a result due to Ohtsuki, Cheung, and Fujisawa from 1976 on the existence of avoidable vertices and a result due to Chvátal, Sritharan, and Rusu from 2002 on the existence of simplicial paths in graphs excluding all sufficiently long induced cycles. In turn, both of these results generalize Dirac’s classical result on the existence of simplicial vertices in chordal graphs.We prove that every graph with at least two edges has two avoidable edges, which strengthens the statement of the theorem of Bonamy et al. for the case of paths of length one. We point out a close relationship between avoidable vertices in a graph and its minimal triangulations, and identify new algorithmic uses of avoidable vertices, leading to new polynomially solvable cases of the maximum weight clique problem in two classes of graphs simultaneously generalizing chordal graphs and circular-arc graphs. Finally, we observe that the results about the existence of avoidable vertices and edges have interesting consequences for highly symmetric graphs: in a vertex-transitive graph every induced two-edge path closes to an induced cycle, while in an edge-transitive graph every three-edge path closes to a cycle and every induced three-edge path closes to an induced cycle.

Upper Bounds for the Regularity of Gap-Free Graphs in Terms of Minimal Triangulation

Upper Bounds for the Regularity of Gap-Free Graphs in Terms of Minimal Triangulation

Poor Ideal Three-Edge Triangulations Are Minimal

An ideal triangulation of a compact \( 3 \)-manifold with nonempty boundary is known to be minimal if and only if the triangulation contains the minimum number of edges among all ideal triangulations of the manifold. Therefore, every ideal one-edge triangulation (i.e., an ideal singular triangulation with exactly one edge) is minimal. Vesnin, Turaev, and Fominykh showed that an ideal two-edge triangulation is minimal if no \( 3 \)–\( 2 \) Pachner move can be applied. In this paper we show that each of the so-called poor ideal three-edge triangulations is minimal. We exploit this property to construct minimal ideal triangulations for an infinite family of hyperbolic \( 3 \)-manifolds with totally geodesic boundary.

Minimal flag triangulations of lower-dimensional manifolds

We prove the following results on flag triangulations of 2- and 3-manifolds. In dimension 2, we prove that the vertex-minimal flag triangulations of $\mathbb{R} P^2$ and $\mathbb{S}^1\times \mathbb{S}^1$ have 11 and 12 vertices, respectively. In general, we show that $8+3k$ (resp. $8+4k$) vertices suffice to obtain a flag triangulation of the connected sum of $k$ copies of $\mathbb{R} P^2$ (resp. $\mathbb{S}^1\times \mathbb{S}^1$). In dimension 3, we describe an algorithm based on the Lutz-Nevo theorem which provides supporting computational evidence for the following generalization of the Charney-Davis conjecture: for any flag 3-manifold, $\gamma_2:=f_1-5f_0+16\geq 16 \beta_1$, where $f_i$ is the number of $i$-dimensional faces and $\beta_1$ is the first Betti number over a field. The conjecture is tight in the sense that for any value of $\beta_1$, there exists a flag 3-manifold for which the equality holds.

Bayesian graph selection consistency under model misspecification.

Gaussian graphical models are a popular tool to learn the dependence structure in the form of a graph among variables of interest. Bayesian methods have gained in popularity in the last two decades due to their ability to simultaneously learn the covariance and the graph. There is a wide variety of model-based methods to learn the underlying graph assuming various forms of the graphical structure. Although for scalability of the Markov chain Monte Carlo algorithms, decomposability is commonly imposed on the graph space, its possible implication on the posterior distribution of the graph is not clear. An open problem in Bayesian decomposable structure learning is whether the posterior distribution is able to select a meaningful decomposable graph that is "close" to the true non-decomposable graph, when the dimension of the variables increases with the sample size. In this article, we explore specific conditions on the true precision matrix and the graph, which results in an affirmative answer to this question with a commonly used hyper-inverse Wishart prior on the covariance matrix and a suitable complexity prior on the graph space. In absence of structural sparsity assumptions, our strong selection consistency holds in a high-dimensional setting where p = O(nα ) for α < 1/3. We show when the true graph is non-decomposable, the posterior distribution concentrates on a set of graphs that are minimal triangulations of the true graph.

Simultaneous current graph constructions for minimum triangulations and complete graph embeddings

The problems of the genus of the complete graphs and minimum triangulations for each surface were both solved using the theory of current graphs, and each of them divided into twelve different cases, depending on the residue modulo 12 of the number of vertices. Cases 8 and 11 were of particular difficulty for both problems, with multiple families of current graphs developed to solve these cases. We solve these cases in a unified manner with families of current graphs applicable to both problems. Additionally, we give new constructions to both problems for Cases 6 and 9, which greatly simplify previous constructions by Ringel, Youngs, Guy, and Jungerman. All these new constructions are index 3 current graphs sharing nearly all of the structure of the simple solution for Case 5 of the Map Color Theorem.

A computer code for topological quantum spin systems over triangulated surfaces

We derive explicit closed-form matrix representations of Hamiltonians drawn from tensored algebras, such as quantum spin Hamiltonians. These formulas enable us to soft-code generic Hamiltonian systems and to systematize the input data for uniformly structured as well as for un-structured Hamiltonians. The result is an optimal computer code that can be used as a black box that takes in certain input files and returns spectral information about the Hamiltonian. The code is tested on Kitaev’s toric model deployed on triangulated surfaces of genus 0 and 1. The efficiency of our code enables these simulations to be performed on an ordinary laptop. The input file corresponding to the minimal triangulation of genus 2 is also supplied.

Efficiently enumerating minimal triangulations

We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where “proper” means that the tree decomposition cannot be improved by removing or splitting a bag. The algorithm can incorporate any method for (ordinary, single result) triangulation or tree decomposition, and can serve as an anytime algorithm to improve such a method. We describe an extensive experimental study of an implementation on real data from different fields. Our experiments show that the algorithm improves upon central quality measures over the underlying tree decompositions, and is able to produce a large number of high-quality decompositions.

Minimal Triangulations of Circle Bundles, Circular Permutations, and the Binary Chern Cocycle

We investigate a PL topology question: which circle bundles can be triangulated over a given triangulation of the base? The question gets a simple answer emphasizing the role of minimal triangulations encoded by local systems of circular permutations of vertices of the base simplices. The answer is based on an experimental fact: the classical Huntington transitivity axiom for cyclic orders can be expressed as the universal binary Chern cocycle.

ℤ2–Thurston norm and complexity of 3–manifolds, II

In this sequel to earlier papers by three of the authors, we obtain a new bound on the complexity of a closed 3--manifold, as well as a characterisation of manifolds realising our complexity bounds. As an application, we obtain the first infinite families of minimal triangulations of Seifert fibred spaces modelled on Thurston's geometry $\widetilde{\text{SL}_2(\mathbb{R})}.$

On minimal ideal triangulations of cusped hyperbolic 3‐manifolds

Previous work of the authors studies minimal triangulations of closed 3-manifolds using a characterisation of low degree edges, embedded layered solid torus subcomplexes and 1-dimensional Z 2 -cohomology. The underlying blueprint is now used in the study of minimal ideal triangulations. As an application, it is shown that the monodromy ideal triangulations of the hyperbolic once-punctured torus bundles are minimal.

A generating theorem of punctured surface triangulations with inner degree at least 4

Abstract Given any punctured surface F2, we present a method for generating all of F2 triangulations with inner vertices of degree ≥ 4 and boundary vertices of degree ≥ 3. The method is based on a set of expansive operations which includes the well-known vertex splitting and octahedron addition. By reversing this method we get a procedure to obtain minimal triangulations by a sequence of intermediate triangulations, all of them within the given family.

Balanced Triangulations on few Vertices and an Implementation of Cross-Flips

A $d$-dimensional simplicial complex is balanced if the underlying graph is $(d+1)$-colorable. We present an implementation of cross-flips, a set of local moves introduced by Izmestiev, Klee and Novik which connect any two PL-homeomorphic balanced combinatorial manifolds. As a result we exhibit a vertex minimal balanced triangulation of the real projective plane, of the dunce hat and of the real projective space, as well as several balanced triangulations of surfaces and 3-manifolds on few vertices. In particular we construct small balanced triangulations of the 3-sphere that are non-shellable and shellable but not vertex decomposable.

Bayesian networks: The minimal triangulations of a graph

Graph triangulation plays an essential role in the study of the Bayesian networks, especially in the celebrated Junction Tree Algorithm. Here we present a simple new proof for CompMLSM by Berry et al. (2009), which generalizes all known algorithms searching for the minimal triangulations of a graph. We also show how CompMLSM may be implemented in our General Minimal Triangulation algorithm.