A Simple Computer-Assisted Proof of the 5/6-Bound for Real-Period Pinwheel Scheduling
cs.DM, cs.DS, math.CO
Submitted: 2026-11-07
Updated: 2026-11-07
Code: https://github.com/grzegorz-gutowski/pinwheel_scheduling
Terminology
Sources
- Towards the 5/6-Density Conjecture of Pinwheel Scheduling
- Proof of the Density Threshold Conjecture for Pinwheel Scheduling
- NP-Hardness and a PTAS for the Pinwheel Problem
- An Optimal Density Bound for Discretized Point Patrolling
- Improving Pinwheel Density Bounds for Small Minimums
Related papers
- Low-Temperature Sampling via Equilibrium Disagreements
- An Improved Bound for Testing k-Colorability
- Temporal Cliques Admit Linear Spanners
- Multiway Partition is FPT for Connectivity Functions
- Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
- Constrained intersection representations and forbidden patterns