Related papers: Polycubes via Dual Loops

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

We approach the cycle double cover conjecture by looking for a circular 2-cell embedding of cubic graphs on an arbitrary surface. It is easy to see that if such an embedding exists, we can get to it from an arbitrary starting 2-cell…

Discovery of clusters with high symmetrical geometry, such as C60 fullerene, always attract lots of interest because of their diverse nature. However, most of such interesting cluster were sporadically discovered, is there any systematic…

Inspired by Coxeter's notion of Petrie polygon for $d$-polytopes (see \cite{Cox73}), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigzag structure for several interesting families of…

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

Motivated by strong desire to understand the natural geometry of moduli spaces of hyperbolic monopoles, we introduce and study a new type of geometry: pluricomplex geometry. It is a generalisation of hypercomplex geometry: we still have a…

In this paper, we study arrangements of orthogonal circles, that is, arrangements of circles where every pair of circles must either be disjoint or intersect at a right angle. Using geometric arguments, we show that such arrangements have…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…

We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…

We give an explicit combinatorial description of the two-dimensional faces of both the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a partially ordered set $P$. Using these descriptions, we show that for any…

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

We prove that a face of a cube can be optimally partitioned into connected 193 sets on which the cut locus, or ridge tree, is constant up to isomorphism as a labeled graph. These are 60 connected open sets, curves bounding them, and…

The purpose of this paper is to introduce the notion of loop groupoid associated to a groupoid. After studying the general properties of the loop groupoid, we show how this notion provides a very natural geometric interpretation for the…

We show how to construct homology bases for certain CW complexes in terms of discrete Morse theory and cellular homology. We apply this technique to study certain subcomplexes of the half cube polytope studied in previous works. This…

A method to visualize polytopes in a four dimensional euclidian space $(x,y,z,w)$ is proposed. A polytope is sliced by multiple hyperplanes that are parallel each other and separated by uniform intervals. Since the hyperplanes are…

A solution to the problem of topological classification of real cubic fourfolds is presented. It is shown that the real locus of a real non-singular cubic fourfold is obtained from a projective 4-space either by adding several trivial one-…

In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…