English
Related papers

Related papers: Regular maps of high density

200 papers

A harmonic mapping is a univalent harmonic function of one complex variable. We define a family of harmonic mappings on the unit disk whose images are rotationally symmetric rosettes with $n$ cusps or n nodes, where $n \ge 3$. These…

Complex Variables · Mathematics 2021-06-08 Jane McDougall , Lauren Stierman

We prove that the set of orders of finite quotients of a finitely generated group has natural density 0, 1/2 or 1, and characterise when each of these cases occurs. We apply this to show that the sets of orders of various families of…

Group Theory · Mathematics 2024-10-24 Marston Conder , Gabriel Verret , Darius Young

A tiling (edge-to-edge) of the plane is a family of tiles that cover the plane without gaps or overlaps. Vertex figure of a vertex in a tiling to be the union of all edges incident to that vertex. A tiling is $k$-vertex-homogeneous if any…

Combinatorics · Mathematics 2022-01-21 Marbarisha M. Kharkongor , Dipendu Maity

The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…

Number Theory · Mathematics 2021-03-18 Wolfgang M. Schmidt , Leonhard Summerer

A half-square of a bipartite graph $B=(X,Y,E_B)$ has one color class of $B$ as vertex set, say $X$; two vertices are adjacent whenever they have a common neighbor in $Y$. If $G=(V,E_G)$ is the half-square of a planar bipartite graph…

Discrete Mathematics · Computer Science 2018-12-12 Hoang-Oanh Le , Van Bang Le

In this paper we analyze the practical implications of Szemer\'edi's regularity lemma in the preservation of metric information contained in large graphs. To this end, we present a heuristic algorithm to find regular partitions. Our…

Data Structures and Algorithms · Computer Science 2017-03-22 Marco Fiorucci , Alessandro Torcinovich , Manuel Curado , Francisco Escolano , Marcello Pelillo

Given a ring $R$ with center $Z(R)$, we say a linear map $f:R\rightarrow R$ is commuting if $[f(x),x]=0$ for all $x\in R$. Such a map has a standard form if there exists $\lambda\in R$ and additive $\mu:R\rightarrow Z(R)$ such that…

Rings and Algebras · Mathematics 2025-11-21 Jordan Bounds , Ellis Edinkrah

Ortho-Radial drawings are a generalization of orthogonal drawings to grids that are formed by concentric circles and straight-line spokes emanating from the circles' center. Such drawings have applications in schematic graph layouts, e.g.,…

Discrete Mathematics · Computer Science 2017-03-20 Lukas Barth , Benjamin Niedermann , Ignaz Rutter , Matthias Wolf

We show that the polynomial entropy of homeomorphisms on regular curves is bounded above by one. Moreover, the polynomial entropy equals one under the fairly mild condition that the homeomorphism possesses a wandering point. We obtain a…

Dynamical Systems · Mathematics 2026-02-24 Maša Đorić , Jelena Katić

Given a map with underlying graph $\mathcal{G}$, if the set of prime divisors of $|V(\mathcal{G}|$ is denoted by $\pi$, then we call the map a {\it $\pi$-map}. An orientably-regular (resp. A regular ) $\pi$-map is called {\it solvable} if…

Combinatorics · Mathematics 2022-09-19 Xiaogang Li , Yao Tian

Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…

Quantum Physics · Physics 2017-02-28 Chai Wah Wu

Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…

Combinatorics · Mathematics 2017-10-06 Taichi Kousaka

We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give…

Discrete Mathematics · Computer Science 2007-05-23 Zhi-Zhong Chen , Michelangelo Grigni , Christos Papadimitriou

Cayley maps are combinatorial structures built upon Cayley graphs on a group. As such the original group embeds in their group of automorphisms, and one can ask in which situation the two coincide (one then calls the Cayley map a mapical…

Combinatorics · Mathematics 2023-01-20 Dario Sterzi , Pablo Spiga

Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…

Combinatorics · Mathematics 2011-04-06 Gareth A. Jones

The Chirikov standard map family is a one-parameter family of volume-preserving maps exhibiting hyperbolicity on a `large' but noninvariant subset of phase space. Based on this predominant hyperbolicity and numerical experiments, it is…

Dynamical Systems · Mathematics 2017-10-26 Alex Blumenthal

The Macbeath-Hurwitz maps $M$ of type $\{3,7\}$, obtained from the Hurwitz groups $G={\rm PSL}_2(q)$ found by Macbeath, are fully regular by a result of Singerman, with automorphism group $G\times{\rm C}_2$ or ${\rm PGL}_2(q)$. Hall's…

Combinatorics · Mathematics 2025-11-11 Gareth A. Jones

The phenomenom of emerging regular spectral features from random interactions is addressed in the context of the vibron model. A mean-field analysis links different regions of the parameter space with definite geometric shapes. The results…

Nuclear Theory · Physics 2009-11-07 R. Bijker , A. Frank

We introduce the notion of radical parametrization of a surface, and we provide algorithms to compute such type of parametrizations for families of surfaces, like: Fermat surfaces, surfaces with a high multiplicity (at least the degree…

Symbolic Computation · Computer Science 2013-02-21 J. Rafael Sendra , David Sevilla

Partial cubes are graphs that can be isometrically embedded into hypercubes. Convex cycles play an important role in the study of partial cubes. In this paper, we prove that a regular partial cube is a hypercube (resp., a Doubled Odd graph,…

Combinatorics · Mathematics 2024-10-15 Yan-Ting Xie , Yong-De Feng , Shou-Jun Xu