This code finds strong crescent configurations in various norms by searching a square lattice using a backtracking algorithm. It is written in Python. I used this to provide constructions of strong crescent configurations for my group's paper (see https://arxiv.org/pdf/1909.08769.pdf).
the-set-of-sets/l1_linfty
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
SMALL
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published