Papers › Configurations of higher orders
Configurations of higher orders
Benjamin Peet
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further extension to the notion of points and k-planes (k-dimensional hyperplanes) which we refer to as configurations of order k. We present a number of general examples such as stacked configurations of order k - intuitively layering lower order configurations - and product configurations of order k. We discuss many analogues of standard configurations such as dual configurations, isomorphisms, graphical representations, and when a configuration is geometric. We focus mostly on configurations of order $2$ and specifically compute the number of possible symmetric configurations of order $2$ when each plane contains $3$ points for small values on n - the total number of points in the configuration.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections