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

推荐订阅源

V
V2EX
博客园 - 叶小钗
WordPress大学
WordPress大学
N
Netflix TechBlog - Medium
M
MIT News - Artificial intelligence
美团技术团队
aimingoo的专栏
aimingoo的专栏
博客园_首页
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Microsoft Security Blog
Microsoft Security Blog
Last Week in AI
Last Week in AI
The GitHub Blog
The GitHub Blog
小众软件
小众软件
T
Tailwind CSS Blog
Martin Fowler
Martin Fowler
B
Blog RSS Feed
月光博客
月光博客
量子位
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Hugging Face - Blog
Hugging Face - Blog
IT之家
IT之家
Y
Y Combinator Blog
B
Blog
MyScale Blog
MyScale Blog

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}}$
On Graphs, Groups and Geometry
[Submitted on 27 May 2022 (v1), last revised 24 Aug 2026 (this v · 2022-05-28 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:An abstract group (G,*) is natural if there exists a metric structure (G,d) on G such that (G,*) is up to abstract group isomorphisms the only group structure on G for which all right translations are isometries of (G,d). Every connected Lie group G is natural. Disconnected Lie groups can be non-natural, like R \times C_2 or Pin^-(2)=Dic(S^1,-1). There are also natural disconnected groups like O(n). Every reflection group of cardinality at most the continuum is natural. Both the infinite dihedral group D = C_2 * C_2 and modular group PSL(2,Z) = C_2 * C_3 are natural. The rational numbers Q are natural. The p-adic integers for prime p are natural if and only if p is odd. The p-adic additive groups (Q_p,+) of the fields Q_p are all natural. An arbitrary non-abelian, finitely generated group G is natural if and only if G is not generalized dicyclic. A finitely generated abelian group is natural if and only if it is finite and its Sylow 2-subgroup is elementary abelian. Examples of non-natural groups are the cyclic groups C_4m for m > 0, the quaternion group Q_8, the integers Z, or the doubled line R \times C_2. Examples of natural groups are the dihedral groups, the additive group (R^n,+), the Rubik cube, connected Lie groups and all free groups F_n for n > 1 or all Pin^(n) for n > 2, the Lorentz or Poincare group. A principal ingredient is the rigidity theory of Cayley graphs developed by Leemann and de la Salle.

Submission history

From: Oliver Knill [view email]
[v1] Fri, 27 May 2022 16:56:32 UTC (10,387 KB)
[v2] Mon, 24 Aug 2026 04:14:39 UTC (10,413 KB)