The number of \(n\)-queens configurations
From MaRDI portal
Publication:6098437
DOI10.1016/j.aim.2023.109127zbMath1516.05018arXiv2107.13460OpenAlexW3185963146MaRDI QIDQ6098437
Publication date: 13 June 2023
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.13460
Permutations, words, matrices (05A05) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Asymptotic enumeration (05A16)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finitely forcible graphons and permutons
- An upper bound on the number of high-dimensional permutations
- A survey of known results and research areas for \(n\)-queens
- On a packing and covering problem
- Additive triples of bijections, or the toroidal semiqueens problem
- Counting designs
- Differential equations for random processes and random graphs
- Limits of permutation sequences
- Quasirandom permutations are characterized by 4-point densities
- An upper bound on the number of Steiner triple systems
- The n-Queens Problem
- Asymptotic packing via a branching process
- Permutations with fixed pattern densities
- On the Method of Typical Bounded Differences
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
- An entropy proof of Bregman's theorem
- Quasirandom Latin squares
This page was built for publication: The number of \(n\)-queens configurations