Cover Image

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kawamura, Akitoshi, Kobayashi, Yusuke
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Pinwheel Scheduling with Real Periods
by: Fujiwara, Hiroshi, et al.
Published: (2025)

Conditional Separation as a Binary Relation. A Coq Assisted Proof
by: Chancelier, Jean-Philippe, et al.
Published: (2021)

The Ultimate Signs of Second-Order Holonomic Sequences
by: Hagihara, Fugen, et al.
Published: (2025)

A Simplified Proof for the Edge-Density of 4-Planar Graphs
by: Büngener, Aaron
Published: (2025)

Computing Height-Optimal Tangles Faster
by: Firman, Oksana, et al.
Published: (2019)

Optimal Tree-Decompositions with Bags of Bounded Treewidth
by: Hendrey, Kevin, et al.
Published: (2025)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
by: Bentert, Matthias, et al.
Published: (2026)

Short Proof: Exact Solution to the Finite Frobenius Coin Problem
by: De Gaspari, Lorenzo, et al.
Published: (2025)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
by: Bok, Jan, et al.
Published: (2025)

An Alternate Proof of Near-Optimal Light Spanners
by: Bodwin, Greg
Published: (2023)

Two Proofs of the Hamiltonian Cycle Identity
by: Sawczuk, Hamilton, et al.
Published: (2025)

Hierarchy of Hub Covering Problems
by: Jost, Niklas
Published: (2025)

Optimal Padded Decomposition For Bounded Treewidth Graphs
by: Filtser, Arnold, et al.
Published: (2024)

Improved Lower Bounds on Multiflow-Multicut Gaps
by: Kalantarzadeh, Sina, et al.
Published: (2025)

Another Way to Lower the Bound for Distinct Squares
by: Tomita, Eitatsu, et al.
Published: (2026)

Weighted Treedepth is NP-complete on Graphs of Bounded Degree
by: Dirks, Jona, et al.
Published: (2025)

Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem
by: Dubinsky, Manuel, et al.
Published: (2024)

A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber
by: Chen, Xinyue, et al.
Published: (2025)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
by: Baeckelant, Timothy, et al.
Published: (2026)

Weighted Group Search on the Disk & Improved Lower Bounds for Priority Evacuation
by: Georgiou, Konstantinos, et al.
Published: (2024)

Optimal Delivery with a Faulty Drone
by: Coleman, Jared, et al.
Published: (2024)

Density Decomposition in Dual-Modular Optimization: Markets, Fairness, and Contracts
by: Chan, T-H. Hubert, et al.
Published: (2025)

A Proof of Talagrand's Creating Large Sets Conjecture
by: Fang, Xuan, et al.
Published: (2025)

Symbolic Listings as Computation
by: Sawczuk, Hamilton, et al.
Published: (2024)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities
by: Elbassioni, Khaled
Published: (2024)

Optimal Average Disk-Inspection via Fermat's Principle
by: Georgiou, Konstantinos
Published: (2025)

Bounds on Path Energy of Graphs
by: Narke, Amol P., et al.
Published: (2022)

Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication
by: Phalakarn, Kittiphon, et al.
Published: (2025)

Optimal placement of mobile distance-limited devices for line routing\
by: Erzin, Adil, et al.
Published: (2025)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
by: German, Samuel
Published: (2026)

Lower Bounds for Induced-Universal Graphs
by: Gavoille, Cyril, et al.
Published: (2025)

Polynomial Bounds in the Apex Minor Theorem
by: Hendrey, Kevin, et al.
Published: (2025)

Supports for Outerplanar and Bounded Treewidth Graphs
by: Raman, Rajiv, et al.
Published: (2025)

Bounds on Linear Turán Number for Trees
by: Adak, Rajat, et al.
Published: (2026)

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

Lower Bounds for Maximum Weighted Cut
by: Gutin, Gregory, et al.
Published: (2021)

Optimal Trading of a Charging-Station Company in Auction Markets for Electricity
by: Sohrabi, Farnaz, et al.
Published: (2025)

Symmetric Splendor: Unraveling Universally Closest Refinements and Fisher Market Equilibrium through Density-Friendly Decomposition
by: Chan, T-H. Hubert, et al.
Published: (2024)