We define higher polyhedral K-groups for commutative rings, starting from the stable groups of elementary automorphisms of polyhedral algebras. Both Volodin’s theory and Quillen’s + construction are developed. In the special case of algebras associated with unit simplices one recovers the usual algebraic K-groups, while the general case of lattice polytopes reveals many new aspects, governed by...

We define higher polyhedral K-groups for commutative rings, starting from the stable groups of elementary automorphisms of polyhedral algebras. Both Volodin’s theory and Quillen’s + construction are developed. In the special case of algebras associated with unit simplices one recovers the usual algebraic K-groups, while the general case of lattice polytopes reveals many new aspects, governed by...

In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimization problem, our method solves an unconstrained optimization problem. Our method is based on a logistic function based model for the posterior probability function. We propose an alternating optimization algorithm, na...

We make a case for sub-polyhedral scheduling using (Unit-)TwoVariable-Per-Inequality or (U)TVPI Polyhedra. We empirically show that using general convex polyhedra leads to a scalability problem in a widely used polyhedral scheduler. We propose methods in which polyhedral schedulers can beat the scalability challenge by using sub-polyhedral under-aproximations of the polyhedra resulting from the...

A polyhedral map is called {p, q}-equivelar if each face has p edges and each vertex belongs to q faces. In [12], it was shown that there exist infinitely many geometrically realizable {p, q}-equivelar polyhedral maps if q > p = 4, p > q = 4 or q − 3 > p = 3. It was shown in [6] that there exist infinitely many {4, 4}and {3, 6}-equivelar polyhedral maps. In [1], it was shown that {5, 5}and {6, ...

In this thesis I study reconstruction of orthogonal polyhedral surfaces and orthogonal polyhedra from partial information about their boundaries. There are three main questions for which I provide novel results. The first question is “Given the dual graph, facial angles and edge lengths of an orthogonal polyhedral surface or polyhedron, is it possible to reconstruct the dihedral angles?” The se...

We characterise finite and infinitesimal rigidity for bar-joint frameworks in R with respect to polyhedral norms (i.e. norms with closed unit ball P a convex d-dimensional polytope). Infinitesimal and continuous rigidity are shown to be equivalent for finite frameworks in R which are well-positioned with respect to P. An edge-labelling determined by the facets of the unit ball and placement of ...

Let   G Aut and  E G   denote the automorphism group and the edge set of a graph  G, respectively. Weinberg’s Theorem states that 4 is a constant sharp upper bound on the ratio     G E G Aut over planar (or spherical) 3-connected graphs  G. We have obtained various analogues of this theorem for nonspherical graphs, introducing two Weinberg-type bounds for an arbitrary closed surfa...

We prove that two polygons A and B have a reversible hinged dissection (a chain hinged dissection that reverses inside and outside boundaries when folding between A and B) if and only if A and B are two non-crossing nets of a common polyhedron. Furthermore, monotone hinged dissections (where all hinges rotate in the same direction when changing from A to B) correspond exactly to non-crossing ne...