English
Related papers

Related papers: A note on the existence of {k, k}-equivelar polyhe…

200 papers

If every vertex in a map has one out of two face-cycle types, then the map is said to be $2$-semiequivelar. A 2-uniform tiling is an edge-to-edge tiling of regular polygons having $2$ distinct transitivity classes of vertices. Clearly, a…

Combinatorics · Mathematics 2021-05-05 Dipendu Maity

Suppose $G$ is a undirected simple graph. A $k-$subset of edges in $G$ without common vertices is called a $k-$matching and the number of such subsets is denoted by $p(G,k)$. The aim of this paper is to present exact formulas for $p(G,3)$,…

Combinatorics · Mathematics 2021-07-12 Kinkar Ch. Das , Ali Ghalavand , Ali Reza Ashrafi

We present new examples of topologically convex edge-ununfoldable polyhedra, i.e., polyhedra that are combinatorially equivalent to convex polyhedra, yet cannot be cut along their edges and unfolded into one planar piece without overlap.…

Computational Geometry · Computer Science 2020-07-30 Erik D. Demaine , Martin L. Demaine , David Eppstein

We present enumerations of a class of maps on Klein bottle which give rise to semi-equivelar maps. Semi-equivelar maps are generalizations of equivelar maps. There are eleven types of semi-equivelar maps on the Klein bottle. These are of…

Combinatorics · Mathematics 2017-02-03 Dipendu Maity , Ashish Kumar Upadhyay

A polyhedron is box-integer if its intersection with any integer box $\{\ell\leq x \leq u\}$ is integer. We define principally box-integer polyhedra to be the polyhedra $P$ such that $kP$ is box-integer whenever $kP$ is integer. We…

Discrete Mathematics · Computer Science 2018-04-25 Patrick Chervet , Roland Grappe , Louis-Hadrien Robert

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…

Computational Geometry · Computer Science 2008-11-04 Muhammad Abdullah Adnan , Masud Hasan

In this paper we define a topological class of branched covering maps of the plane called {\em topological exponential maps of type $(p,q)$} and denoted by $\TE_{p,q}$, where $p\geq 0$ and $q\geq 1$. We follow the framework given in…

Dynamical Systems · Mathematics 2020-06-02 Tao Chen , Yunping Jiang , Linda Keen

A linear map between matrix spaces is positive if it maps positive semidefinite matrices to positive semidefinite ones, and is called completely positive if all its ampliations are positive. In this article quantitative bounds on the…

Functional Analysis · Mathematics 2019-07-10 Igor Klep , Scott McCullough , Klemen Šivic , Aljaž Zalar

Every regular map on a closed surface gives rise to generally six regular maps, its "Petrie relatives", that are obtained through iteration of the duality and Petrie operations (taking duals and Petrie-duals). It is shown that the skeletal…

Combinatorics · Mathematics 2012-10-09 Anthony M. Cutler , Egon Schulte , Jorg M. Wills

For any $n \geq 3$ and any closed manifold $\mathcal{N}$ with $\pi_{n+k}(\mathcal{N}) \neq \{0\}$ for some $k \geq 0$, we establish the existence of nontrivial $n$-harmonic maps from $\mathbb{S}^n$ into $\mathcal{N}$. When $k\geq 1$, these…

Analysis of PDEs · Mathematics 2026-01-12 Dorian Martino , Katarzyna Mazowiecka , Armin Schikorra

Semi-Equivelar maps are generalizations of Archimedean Solids (as are equivelar maps of the Platonic solids) to the surfaces other than $2-$Sphere. We classify some semi equivelar maps on surface of Euler characteristic -1 and show that…

Geometric Topology · Mathematics 2011-01-18 Ashish K. Upadhyay , Anand K. Tiwari , Dipendu Maity

We prove an infinite $(p,q)$-theorem for piercing fat compact convex sets in $\RR^d$ with $k$-flats. Additionally, we develop a new framework through which infinite $(p,q)$-theorems concerning compact sets and $k$-flats can be extended to…

Combinatorics · Mathematics 2025-07-01 Sutanoya Chakraborty , Arijit Ghosh , Soumi Nandi

Schnyder characterized planar graphs in terms of order dimension. Brightwell and Trotter proved that the dimension of the vertex-edge-face poset $\Pvef{M}$ of a planar map $M$ is at most four. In this paper we investigate cases where…

Combinatorics · Mathematics 2009-06-03 Stefan Felsner , Johan Nilsson

Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle and any…

Computational Geometry · Computer Science 2013-12-25 Therese Biedl , Martin Derka , Stephen Kiazyk , Anna Lubiw , Hamide Vosoughpour

Bosse et al. conjectured that for every natural number $d \ge 2$ and every $d$-dimensional polytope $P$ in $\real^d$ there exist $d$ polynomials $p_0(x),...,p_{d-1}(x)$ satisfying $P=\{x \in \mathbb{R}^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge…

Metric Geometry · Mathematics 2008-07-15 Gennadiy Averkov , Martin Henk

A polyhedron is pointed if it contains at least one vertex. Every pointed polyhedron P in R^n can be described by an H-representation consisting of half spaces or equivalently by a V-representation consisting of the convex hull of a set of…

Optimization and Control · Mathematics 2025-10-10 David Avis

A chiral polyhedron has a geometric symmetry group with two orbits on the flags, such that adjacent flags are in distinct orbits. Part I of the paper described the discrete chiral polyhedra in ordinary Euclidean 3-space with finite skew…

Metric Geometry · Mathematics 2007-05-23 Egon Schulte

Using a quartic surface and its rational curves we can give an infinite number of integer hexahedra; these are 6 sided 3d solids, each face a trapezoid, with all sides and diagonals having intger lengths.

History and Overview · Mathematics 2009-09-25 Roger Alperin

When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…

Metric Geometry · Mathematics 2017-03-16 Seonhwa Kim , Yunhi Cho

An abstract $n$-polytope $\mathcal{P}$ is a partially-ordered set which captures important properties of a geometric polytope, for any dimension $n$. For even $n \ge 2$, the incidences between elements in the middle two layers of the Hasse…

Combinatorics · Mathematics 2024-06-21 Marston Conder , Isabelle Steinmann