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

推荐订阅源

Microsoft Azure Blog
Microsoft Azure Blog
有赞技术团队
有赞技术团队
IT之家
IT之家
博客园 - 聂微东
Jina AI
Jina AI
Hugging Face - Blog
Hugging Face - Blog
Last Week in AI
Last Week in AI
Apple Machine Learning Research
Apple Machine Learning Research
WordPress大学
WordPress大学
小众软件
小众软件
爱范儿
爱范儿
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
V
Visual Studio Blog
雷峰网
雷峰网
酷 壳 – CoolShell
酷 壳 – CoolShell
阮一峰的网络日志
阮一峰的网络日志
宝玉的分享
宝玉的分享
博客园 - 三生石上(FineUI控件)
大猫的无限游戏
大猫的无限游戏
博客园 - Franky
量子位
月光博客
月光博客
博客园 - 【当耐特】
博客园 - 叶小钗

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Colourings of Cayley graphs of finite $3$-groups
[Submitted on 20 Mar 2026 (v1), last revised 23 Jul 2026 (this v · 2026-03-21 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:Let $G$ be a finite group. A bijection $\sigma\colon G\to G$ is a \emph{colouring bijection} if the three maps \[ \Delta^{+}\colon x\mapsto x\,\sigma(x), \qquad \Delta^{-}\colon x\mapsto x^{-1}\sigma(x), \qquad \Delta^{c}\colon x\mapsto \sigma(x)^{-1}x\,\sigma(x) \] are again bijections of $G$. The first two conditions say that $\sigma$ is a strong complete mapping. The third is a genuinely nonabelian requirement.
Our main theorem is that every noncyclic $3$-group not isomorphic to the modular group $M_{3^{r}}$ $(r\ge4)$ admits a colouring bijection. This is the exact analogue, for colouring bijections, of the theorem of Akhtar and Gagola on strong complete mappings.
The notion has three equivalent readings. A colouring bijection properly colours the Cayley graph $\mathscr{G}_3(G)=Cay(G^{3},\mathbf S_3)$ with $|G|$ colours. It determines a triple of mutually orthogonal translation Latin squares based on $G$. In the orthomorphism graph of $G$ that triple is a triangle through the Cayley table. It also determines a common transversal of three arrays attached to $G$. These are the multiplication table, the division table, and the operation table of the conjugation quandle. The last of them is not a Latin square.
Two consequences follow. Every noncyclic $3$-group $G\not\cong M_{3^{r}}$ $(r\ge4)$ carries three mutually orthogonal Latin squares of order $|G|$ based on $G$. Moreover $\chi(\mathscr{G}_3(G))=|G|$ for every such group.

Submission history

From: Piotr Grzeszczuk [view email]
[v1] Fri, 20 Mar 2026 16:06:41 UTC (18 KB)
[v2] Tue, 24 Mar 2026 16:55:02 UTC (18 KB)
[v3] Thu, 23 Jul 2026 13:58:53 UTC (39 KB)