相关论文: A criterion of reducibility for a parallelohedron

An Independent Parallelism Theorem is proven in the theory of adhesive HLR categories. It shows the bijective correspondence between sequential independent and parallel independent direct derivations in the Weak Double-Pushout framework,…

In a recent paper Garber, Gavrilyuk and Magazinov proposed a sufficient combinatorial condition for a parallelohedron to be affinely Voronoi. We show that this condition holds for all five-dimensional Voronoi parallelohedra. Consequently,…

Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a…

Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…

A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…

In this paper we investigate the relationship between the existence of parallel semi-Riemannian metrics of a connection and the reducibility of the associated holonomy group. The question as to whether the holonomy group necessarily reduces…

We show that the Voronoi conjecture is true for parallelohedra with simply connected $\delta$-surface. Namely, we show that if the boundary of parallelohedron $P$ remains simply connected after removing closed non-primitive faces of…

This article proves the Voronoi conjecture on parallelotopes in the special case of 3-irreducible tilings. Parallelotopes are convex polytopes which tile the Euclidean space by their translated copies, like in the honeycomb arrangement of…

Twin reduction defines an equivalence relation on the vertex set of a graph. I give a characterisation of this equivalence relation. A consequence is a structure theorem for the automorphism group of the graph.

We provide two different proofs of an irreducibility criterion for the preimages of a transverse subvariety of a product of elliptic curves under a diagonal endomorphism of sufficiently large degree.For curves, we present an arithmetic…

There is the classical Radon theorem. Given integer $d \geq 1$ and $d+2$ points in d-dimensional space $R^d$. Then these points can be divided into two disjoint subsets whose convex hulls have a non-empty intersection. The original proof of…

A convex polyhedron $P$ is $k$-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of $P$ are $k$-gon for some fixed value of $k$. Since 1968, it is an open problem to construct all…

We give a novel and effective criterion for algebraicity of rational normal analytic surfaces constructed from resolving the singularity of an irreducible curve-germ on $CP^2$ and contracting the strict transform of a given line and all but…

The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by…

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into…

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

The parallel product of two rooted maps was introduced by S. E. Wilson in 1994. The main question of this paper is whether for a given reflexible map $M$ one can decompose the map into a parallel product of two reflexible maps. This can be…

A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…

This is an old paper put here for archeological purposes. It is proved that a finite-dimensional Lie algebra over a field of characteristic p>5, that can be written as a vector space (not necessarily direct) sum of two nilpotent…