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

推荐订阅源

有赞技术团队
有赞技术团队
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
IT之家
IT之家
博客园 - 【当耐特】
罗磊的独立博客
Stack Overflow Blog
Stack Overflow Blog
MyScale Blog
MyScale Blog
WordPress大学
WordPress大学
The GitHub Blog
The GitHub Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Hugging Face - Blog
Hugging Face - Blog
I
InfoQ
B
Blog RSS Feed
腾讯CDC
云风的 BLOG
云风的 BLOG
N
Netflix TechBlog - Medium
Apple Machine Learning Research
Apple Machine Learning Research
GbyAI
GbyAI
雷峰网
雷峰网
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
D
DataBreaches.Net
The Cloudflare Blog
V
V2EX
S
SegmentFault 最新的问题

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}}$
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.CO 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)