惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

阮一峰的网络日志
阮一峰的网络日志
J
Java Code Geeks
Martin Fowler
Martin Fowler
宝玉的分享
宝玉的分享
V
Visual Studio Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
M
MIT News - Artificial intelligence
U
Unit 42
博客园 - 三生石上(FineUI控件)
博客园 - 聂微东
The GitHub Blog
The GitHub Blog
I
InfoQ
WordPress大学
WordPress大学
H
Help Net Security
D
Docker
B
Blog
腾讯CDC
A
About on SuperTechFans
Recent Announcements
Recent Announcements
雷峰网
雷峰网
有赞技术团队
有赞技术团队
C
Check Point Blog
Y
Y Combinator Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Archimedean toroidal maps and their minimal almost regula...
Kostiantyn Drach, Yurii Haidamaka, Mark Mixer, Maksym Skoryk · 2018-10-03 · via math.CO updates on arXiv.org

The automorphism group of a map acts naturally on its flags (triples of incident vertices, edges, and faces). An Archimedean map on the torus is called almost regular if it has as few flag orbits as possible for its type; for example, a map of type $(4.8^2)$ is called almost regular if it has exactly three flag orbits. Given a map of a certain type, we will consider other more symmetric maps that cover it. In this paper, we prove that each Archimedean toroidal map has a unique minimal almost regular cover. By using the Gaussian and Eisenstein integers, along with previous results regarding equivelar maps on the torus, we construct these minimal almost regular covers explicitly.