English
Related papers

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

200 papers

Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…

Computational Geometry · Computer Science 2025-12-09 Michael Hoffmann , Tillmann Miltzow , Simon Weber , Lasse Wulf

We introduce the natural notion of (p,q)-harmonic morphisms between Riemannian manifolds. This unifies several theories that have been studied during the last decades. We then study the special case when the maps involved are…

Differential Geometry · Mathematics 2021-04-05 Elsa Ghandour , Sigmundur Gudmundsson

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…

Combinatorics · Mathematics 2007-05-23 Michael Joswig , G"unter M. Ziegler

We make two observations regarding the invertibility of Keller maps. i.e., polynomial maps for which the determinant of their Jacobian matrix is identically equal to 1. In our first result, we show that if P is a n-dimensional Keller map,…

Algebraic Geometry · Mathematics 2007-05-23 Richard J. Lipton , Evangelos Markakis

Let $2\le k\le d-1$ and let $P$ and $Q$ be two convex polytopes in ${\mathbb E^d}$. Assume that their projections, $P|H$, $Q|H$, onto every $k$-dimensional subspace $H$, are congruent. In this paper we show that $P$ and $Q$ or $P$ and $-Q$…

Metric Geometry · Mathematics 2017-09-22 Sergii Myroshnychenko , Dmitry Ryabogin

Let $Q(x,y)$ be a quadratic form with discriminant $D\neq 0$. We obtain non trivial upper bound estimates for the number of solutions of the congruence $Q(x,y)\equiv\lambda \pmod{p}$, where $p$ is a prime and $x,y$ lie in certain intervals…

Number Theory · Mathematics 2011-02-08 Ana Zumalacárregui

A topological graph is \emph{$k$-quasi-planar} if it does not contain $k$ pairwise crossing edges. A topological graph is \emph{simple} if every pair of its edges intersect at most once (either at a vertex or at their intersection). In…

Combinatorics · Mathematics 2015-03-19 Andrew Suk

We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…

Combinatorics · Mathematics 2025-08-05 Riccardo W. Maffucci

Let $S$ be a set of $2n$ points on a circle such that for each point $p \in S$ also its antipodal (mirrored with respect to the circle center) point $p'$ belongs to $S$. A polygon $P$ of size $n$ is called \emph{antipodal} if it consists of…

Metric Geometry · Mathematics 2013-01-29 O. Aichholzer , L. E. Caraballo , J. M. Díaz-Báñez , R. Fabila-Monroy , C. Ochoa , P. Nigsch

Let $P$ and $Q$ be simple polygons with $n$ vertices each. We wish to compute triangulations of $P$ and $Q$ that are combinatorially equivalent, if they exist. We consider two versions of the problem: if a triangulation of $P$ is given, we…

Computational Geometry · Computer Science 2026-03-03 Peyman Afshani , Boris Aronov , Kevin Buchin , Maike Buchin , Otfried Cheong , Katharina Klost , Carolin Rehs , Günter Rote

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…

Computational Geometry · Computer Science 2025-08-22 Supanut Chaidee , Kokichi Sugihara

We prove that there exist infinitely many elliptic curves over \Q with given modular invariant, and rank >=2. Furthermore, there exist infinitely many elliptic curves over $\Q$ with invariant equal at 0 (resp. 1728) and rank >=6 (resp.…

alg-geom · Mathematics 2008-02-03 Jean-Francois Mestre

Theoretical results are known about the completeness of a planar algebraic cubic curve as a (n,3)-arc in PG(2,q). They hold for q big enough and sometimes have restriction on the characteristic and on the value of the j-invariant. We…

Combinatorics · Mathematics 2015-10-29 Daniele Bartoli , Stefano Marcugini , Fernanda Pambianco

A $(3, 6)$-fullerene is a cubic planar graph whose faces all have 3 or 6 sides. We give an exact enumeration of $(3, 6)$-fullerenes with $V$ vertices. We also enumerate $(3, 6)$-fullerenes with mirror symmetry, with 3-fold rotational…

Combinatorics · Mathematics 2026-05-26 Linda Green , Yadunand Sreelesh , Saanvi Arora

Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…

Combinatorics · Mathematics 2016-09-05 Tilen Marc

In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…

Metric Geometry · Mathematics 2013-12-12 Yohji Akama , Yudai Sakano

The notion of quadratic maps between arbitrary groups appeared at several places in the literature on quadratic algebra. Here a unified extensive treatment of their properties is given; the relation with a relative version of Passi's…

Group Theory · Mathematics 2011-07-12 Manfred Hartl

Let $p, k, q$ be positive integers with $p-2 \geqslant k$ and let $K_{p,k}^{q}$ be the generalized pineapple graph which is obtained by joining independent set of $q$ vertices with $k$ vertices of a complete graph $K_{p}.$ In \cite{TSH2},…

Combinatorics · Mathematics 2024-06-11 Borchen Li , Qingzhong Ji

Let $ R$ be a compact Riemann surface, and let $ P: R \to \mathbb P^1(\mathbb C) $ and $ Q: R \to \mathbb P^1(\mathbb C) $ be holomorphic maps. In this paper, we investigate the following problem: under what conditions do the preimages $…

Number Theory · Mathematics 2025-11-12 Fedor Pakovich

Fix positive integers $p$ and $q$ with $2 \leq q \leq {p \choose 2}$. An edge-coloring of the complete graph $K_n$ is said to be a $(p, q)$-coloring if every $K_p$ receives at least $q$ different colors. The function $f(n, p, q)$ is the…

Combinatorics · Mathematics 2017-05-17 David Conlon , Jacob Fox , Choongbum Lee , Benny Sudakov