Geometry of cut-complexes and threshold logic

Geometric methods of convex polytopes are applied to demonstrate a new connection between convexity and threshold logic. A cut-complex is a cubical complex whose vertices are strictly separable from rest of the vertices of then-cube by a hyperplane ofR ⁿ . Cutcomplexes are geometric presentations for threshold Boolean functions and thus are related to threshold logic. For an old classical theorem of threshold logic a shorter but geometric proof is given. The dimension of the cube hull of a cut-complex is shown to be the same as the maximum degree of the vertices in the complex. A consequence of the latter result indicates that any two isomorphic cut-complexes are isometric.This research was partially supported by FIPI-University of Puerto Rico, by Inter American University of Puerto Rico at Bayamon and by IPM, Tehran, Iran.     

Neighborly Cubical Polytopes

Neighborly cubical polytopes exist: for any n≥ d≥ 2r+2 , there is a cubical convex d -polytope C _d ⁿ whose r -skeleton is combinatorially equivalent to that of the n -dimensional cube. This solves a problem of Babson, Billera, and Chan. Kalai conjectured that the boundary of a neighborly cubical polytope C _d ⁿ maximizes the f -vector among all cubical (d-1) -spheres with 2 ⁿ vertices. While we show that this is true for polytopal spheres if n≤ d+1 , we also give a counterexample for d=4 and n=6 . Further, the existence of neighborly cubical polytopes shows that the graph of the n -dimensional cube, where n\ge5 , is ``dimensionally ambiguous' in the sense of Grünbaum. We also show that the graph of the 5 -cube is ``strongly 4 -ambiguous.' In the special case d=4 , neighborly cubical polytopes have f ₃ =(f ₀ /4) log ₂ (f ₀ /4) vertices, so the facet—vertex ratio f ₃ /f ₀ is not bounded; this solves a problem of Kalai, Perles, and Stanley studied by Jockusch. Received December 30, 1998. Online publication May 15, 2000.     

Lower Bounds for Cubical Pseudomanifolds

It is verified that the number of vertices in a d-dimensional cubical pseudomanifold is at least 2 ^d+1. Using Adin’s cubical h-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for some special classes of cubical spheres in higher dimensions.     

Cubical 4-Polytopes with Few Vertices

A cubical polytope is a convex polytope all of whose facets are conbinatorial cubes. A d-polytope Pis called almost simple if, in the graph of P, each vertex of Pis d-valent of (d+ 1)-valent. It is known that, for d> 4, all but one cubical d-polytopes with up to 2^d+1vertices are almost simple, which provides a complete enumeration of all the cubical d-polytopes with up to 2^d+1vertices. We show that this result is also true for d=4.     

Simple polytopes without small separators

We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least Ω(n/log^3/2 n). This disproves a conjecture by Kalai from 1991/2004.     

Cubical d-Polytopes with Few Vertices for d>4

A cubical polytope is a convex polytope all of whose facets are combinatorial cubes. A d-polytope P is called almost simple if, in the graph of P, each vertex of P is d-valent or (d+1)-valent. We show that, for d>4, all but one cubicald -polytopes with up to 2 ^d+1 vertices are almost simple. This provides a complete enumeration of all the cubical d-polytopes with up to 2 ^d+1 vertices, for d>4.     

Triangulation de Delaunay et Triangulation des Tores

We present a construction of triangulations of the torus \mathbbTⁿ{\mathbb{T}^n} with 2 ⁿ⁺¹−1 vertices, starting from the Delaunay triangulation of a generic lattices. The typical example is the Kühnel–Lassmann triangulation, with help of the lattice A^*_n{A^{*}_{n}} . Concerning this triangulation, we also prove a result of unicity for some values of n.     

A note on the cubical dimension of new classes of binary trees

The cubical dimension of a graph G is the smallest dimension of a hypercube into which G is embeddable as a subgraph. The conjecture of Havel (1984) claims that the cubical dimension of every balanced binary tree with 2 ⁿ vertices, n ? 1, is n. The 2-rooted complete binary tree of depth n is obtained from two copies of the complete binary tree of depth n by adding an edge linking their respective roots. In this paper, we determine the cubical dimension of trees obtained by subdividing twice a 2-rooted complete binary tree and prove that every such balanced tree satisfies the conjecture of Havel.     

Connectivity threshold for random chordal graphs

We introduce a model for random chordal graphs. We determine the thresholds for: the first edge, completeness, isolated vertices and connectivity. Like the Erdös-Rényi model, the thresholds for isolated vertices and connectivity are the same. Unlike the Erdös-Rényi model in which the threshold occurs at 1/2n logn edges, this threshold occurs atO(n ²) edges.Research supported in part by the Office of Naval Research, contract number N00014-85-K0622.     

Random I-colorable graphs

In this article we investigate properties of the class of all l-colorable graphs on n vertices, where l = l(n) may depend on n. Let G^l_n denote a uniformly chosen element of this class, i.e., a random l-colorable graph. For a random graph G^l_n we study in particular the property of being uniquely l-colorable. We show that not only does there exist a threshold function l = l(n) for this property, but this threshold corresponds to the chromatic number of a random graph. We also prove similar results for the class of all l-colorable graphs on n vertices with m = m(n) edges.     

The cubicald-polytopes with fewer than 2 d+1 vertices

A cubical polytope is a convex polytope of which every facet is a combinatorial cube. We give here a complete enumeration of all the cubicald-polytopes with fewer than 2 ^d+1 vertices, ford≥4.     

Combinatorial Groupoids,Cubical Complexes,and the Lovász Conjecture

This paper lays the foundation for a theory of combinatorial groupoids that allows us to use concepts like “holonomy”, “parallel transport”, “bundles”, “combinatorial curvature”, etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes and other combinatorial objects. We introduce a new, holonomy-type invariant for cubical complexes, leading to a combinatorial “Theorema Egregium” for cubical complexes that are non-embeddable into cubical lattices. Parallel transport of Hom-complexes and maps is used as a tool to extend Babson–Kozlov–Lovász graph coloring results to more general statements about nondegenerate maps (colorings) of simplicial complexes and graphs. The author was supported by grants 144014 and 144026 of the Serbian Ministry of Science and Technology.     

Construction and Analysis of Projected Deformed Products

We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and the analysis of deformed products such that specified faces (e.g., all the k-faces) are “strictly preserved” under projection. Thus, starting from an arbitrary neighborly simplicial (d?2)-polytope Q on n?1 vertices, we construct a deformed n-cube, whose projection to the last d coordinates yields a neighborly cubical d -polytope. As an extension of the cubical case, we construct matrix representations of deformed products of (even) polygons (DPPs) which have a projection to d-space that retains the complete $(\lfloor\tfrac{d}{2}\rfloor-1)We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and the analysis of deformed products such that specified faces (e.g., all the k-faces) are “strictly preserved” under projection. Thus, starting from an arbitrary neighborly simplicial (d−2)-polytope Q on n−1 vertices, we construct a deformed n-cube, whose projection to the last d coordinates yields a neighborly cubical d -polytope. As an extension of the cubical case, we construct matrix representations of deformed products of (even) polygons (DPPs) which have a projection to d-space that retains the complete (?\tfracd2?-1)(\lfloor\tfrac{d}{2}\rfloor-1) -skeleton.     

Embeddings of chemical graphs in hypercubes

We study planar graphs embedded in the plane that have chemical applications: the degrees of all vertices are 3 or 2, all internal faces but one or two arer-gons, and each internal face is a simply connected domain. For wide classes of such graphs, we solve the existence problem for embeddings of the graph metric on the vertices in multidimensional cubes or cubical lattices preserving or doubling all the distances. Incidentally we present a complete classification of some interesting families of such graphs. Translated fromMatematicheskie Zametki, Vol. 68, No. 3, pp. 339–352, September, 2000.     

A geometric model for cluster categories of type <Emphasis Type="Italic">D</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

We give a geometric realization of cluster categories of type D _n using a polygon with n vertices and one puncture in its center as a model. In this realization, the indecomposable objects of the cluster category correspond to certain homotopy classes of paths between two vertices.     

Competition graphs and clique dimensions

Here it is proved that for almost all simple graphs over n vertices one needs Ω(n^4/3(log n)^?4/3) extra vertices to obtain them as a double competition graph of a digraph. on the other hand O(n^5/3) extra vertices are always sufficient. Several problems remain open.     

The cardinality of the separated vertex set of a multidimensional cube

An n-dimensional cube and the sphere inscribed into it are considered. The conjecture of A. Ben-Tal, A. Nemirovski, and C. Roos states that each tangent hyperplane to the sphere strictly separates not more than 2 ⁿ⁻² cube vertices. In this paper this conjecture is proved for n ≤ 6. New examples of hyperplanes separating exactly 2 ⁿ⁻² cube vertices are constructed for any n. It is proved that hyperplanes orthogonal to radius vectors of cube vertices separate less than 2 ⁿ⁻² cube vertices for n ≥ 3.     

Infinite Random Geometric Graphs

We introduce a new class of countably infinite random geometric graphs, whose vertices V are points in a metric space, and vertices are adjacent independently with probability p ? (0, 1){p \in (0, 1)} if the metric distance between the vertices is below a given threshold. For certain choices of V as a countable dense set in \mathbbRⁿ{\mathbb{R}^n} equipped with the metric derived from the L _∞-norm, it is shown that with probability 1 such infinite random geometric graphs have a unique isomorphism type. The isomorphism type, which we call GR _n , is characterized by a geometric analogue of the existentially closed adjacency property, and we give a deterministic construction of GR _n . In contrast, we show that infinite random geometric graphs in \mathbbR²{\mathbb{R}^{2}} with the Euclidean metric are not necessarily isomorphic.     

Chromaticity of two-trees

The graphs called 2-trees are defined by recursion. The smallest 2-tree is the complete graph on 2 vertices. A 2-tree on n + 1 vertices (where n ≥ 2) is obtained by adding a new vertex adjacent to each of 2 arbitrarily selected adjacent vertices in a 2-tree on n vertices. A graph G is a 2-tree on n(≥2) vertices if and only if its chromatic polynomial is equal to γ(γ - 1)(γ - 2)^n—2.     

Untangling Polygons and Graphs

Untangling is a process in which some vertices in a drawing of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C _n while keeping Ω(n ^2/3) vertices fixed. For any connected graph G, we also present an upper bound on the number of fixed vertices in the worst case. The bound is a function of the number of vertices, maximum degree, and diameter of G. One consequence is that every 3-connected planar graph has a drawing δ such that at most O((nlog n)^2/3) vertices are fixed in every untangling of δ.