相关论文: A system for constructing relatively small polyhed…

We start from any small strict monoidal braided Ab-category and extend it to a monoidal nonstrict braided Ab-category which contains braided bialgebras. The objects of the original category turn out to be modules for these bialgebras

Motivated by applications in geomorphology, the aim of this paper is to extend Morse-Smale theory from smooth functions to the radial distance function (measured from an internal point), defining a convex polyhedron in 3-dimensional…

An origami extrusion is a folding of a 3D object in the middle of a flat piece of paper, using 3D gadgets which create faces with solid angles. Our main concern is to make origami extrusions of polyhedrons using 3D gadgets with simple…

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

This note is dedicated to the study of a Hopf module structures on the space of framed chord diagrams and framed graphs. We also introduce a framed version of the chromatic polynomial and propose two methods to construct framed weight…

This paper presents some algorithmic techniques to compute explicitly the noetherian operators associated to a class of ideals and modules over a polynomial ring. The procedures we include in this work can be easily encoded in computer…

The construction of atomically-precise carbon nanostructures holds promise for developing novel materials for scientific study and nanotechnology applications. Here we show that graphene origami is an efficient way to convert graphene into…

First we introduce a generalization of symmetric spaces to parabolic geometries. We provide construction of such parabolic geometries starting with classical symmetric spaces and we show that all regular parabolic geometries with smooth…

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…

We explore the surprisingly rich energy landscape of origami-like folding planar structures. We show that the configuration space of rigid-paneled degree-4 vertices, the simplest building blocks of such systems, consists of at least two…

In this article we study the following question: What can be the measure of the minimal solid angle of a simplex in $\mathbb{R}^d$? We show that in dimensions three it is not greater than the solid angle of the regular simplex. And in…

Abstract polytopes generalize the face lattice of convex polytopes. A polytope is semiregular if its facets are regular and its automorphism group acts transitively on its vertices. In this paper we construct semiregular, facet-transitive…

The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes…

Origami structures have been widely explored in robotics due to their many potential advantages. Origami robots can be very compact, as well as cheap and efficient to produce. In particular, they can be constructed in a flat format using…

In the present paper we construct plans orthogonal through the block factor (POTBs). We describe procedures for adding blocks as well as factors to an initial plan and thus generate a bigger plan. Using these procedures we construct POTBs…

This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…

The Reeb space of a smooth map whose codimension is minus is the space defined as the space of all connected components of inverse images. For generic maps such as Morse functions and their higher dimensional versions, they are polyhedra…

The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…

High dimensional expanders simultaneously satisfying spectral and combinatorial (coboundary) expansion have recently played a major role in breakthroughs in PCP and coding theory, but the only known construction of such complexes is…