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

推荐订阅源

The Cloudflare Blog
U
Unit 42
F
Fortinet All Blogs
雷峰网
雷峰网
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
月光博客
月光博客
Y
Y Combinator Blog
罗磊的独立博客
V
Visual Studio Blog
大猫的无限游戏
大猫的无限游戏
J
Java Code Geeks
量子位
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
爱范儿
爱范儿
B
Blog RSS Feed
aimingoo的专栏
aimingoo的专栏
有赞技术团队
有赞技术团队
T
Tailwind CSS Blog
Microsoft Security Blog
Microsoft Security Blog
L
LangChain Blog
I
InfoQ
博客园 - 叶小钗
博客园 - 聂微东
Last Week in AI
Last Week in AI

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}}$
Hamilton decompositions of equal-side directed tori
[Submitted on 6 May 2026 (v1), last revised 17 Sep 2026 (this ve · 2026-05-06 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:Let $D_d(m)$ be the Cartesian product of $d$ positively oriented directed cycles of length $m$. We prove that $D_d(m)$ decomposes into $d$ directed Hamilton cycles for every $m\ge3$ and $d\ge2$. The construction proceeds by splitting coordinate directions in directed multitori. An integer selection theorem supplies unit voltages compatible with the prescribed arc multiplicities; at even modulus, the decisive condition is the parity of each incidence component. For even $m$ and odd $d\ge7$, we satisfy this condition with a factorization having one additional cycle. A relative lifting theorem preserves the first-return data of a three-colour recolouring through successive coordinate splits, after which the recolouring removes the additional cycle on a set whose size is independent of the dimension. Explicit constructions complete the low-dimensional cases. The theorem yields Hamilton decompositions of Cartesian products of equal-order, equal-degree Hamilton-decomposable digraphs, of abelian Cayley digraphs whose generators partition into module bases, and of a family of height-stretched directed tori.

Submission history

From: SangHyun Park [view email]
[v1] Wed, 6 May 2026 10:32:39 UTC (32 KB)
[v2] Sun, 10 May 2026 06:51:16 UTC (58 KB)
[v3] Thu, 17 Sep 2026 05:54:51 UTC (60 KB)