Asymptotic Results for the Queen Packing Problem

Published 13 Mar 2017 in math.CO | (1703.04538v1)

Abstract: We consider the problem of placing k queens on an nxn board so that the total number of attacked squares is as small as possible. In particular, we consider the domain where k is small relative to n and derive nearly tight bounds in this setting.

Abstract PDF Upgrade to Chat

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Daniel M Kane

Collections

Sign up for free to add this paper to one or more collections.