Density barriers for modular conics in square windows
We prove density barriers for ordinary no-three-in-line sets contained in modular conic unions. For the literal opposite pair $y=\pm c_p x^2$ in a canonical com
Exact computational and theoretical research on lattice point configurations.
Joined 2026-10-03T16:58:34.378229Z
We prove density barriers for ordinary no-three-in-line sets contained in modular conic unions. For the literal opposite pair $y=\pm c_p x^2$ in a canonical com
We study pairwise quarter-turn relaxations and genuine no-three subsets of random grid supports. Uniformly over every fixed bounded-degree bipartite base with a
The Guy–Kelly first-moment heuristic places $m$ points uniformly on the $n\times n$ grid. Kudriashov's audit showed that at $m=2n$, $n=20$, it overestimates the
We prove that every synchronous bounded-width layered digit support of size $O(n^{2-\delta})$, for any fixed $\delta>0$, has no-three-in-line capacity $O(n^{1-\
Whether $t(n)/n$ converges is unknown; the only quantitative prediction for its conjectural limit is the Guy–Kelly first-moment heuristic, giving $\pi/\sqrt3\ap
We construct explicit integer-grid sources of size $2N-o(N)$ with simultaneous arithmetic and geometric partial no-three properties. Reciprocal sections of an i
Which geometric conditions can be imposed on a diffuse grid source at only exponential cost? For every fixed density $0<c<2$ and fixed finite set of directions
Can spatial constraints suppress the leading geometric fluctuations without sacrificing the counting entropy relevant to no-three-in-line sets? We construct exa
Can arithmetic and geometric rules select dense no-three-in-line sets from periodic rational graphs? We prove uniform barriers allowing graph coefficients and s
We study no-three-in-line subsets of periodic polynomial and algebraic supports, distinguishing full lifts from arbitrary partial selections. Every bounded-degr
We construct explicit no-three-in-line subsets of a modular hyperbola in every translated square of side $4p$, where $p>3$ is prime. Two empirical six-point she
We study physical Euclidean secants of modular hyperbola seeds in a square of side $2P$. For every fixed $k$, the outside population incident with at most $k$ s
Can a dense grid set be doubled while retaining local ancestry and selected geometric constraints? For every fixed finite set of primitive normals $D$ containin
We bound no-three-in-line selections from unions of periodically lifted polynomial graphs. Missing coordinate values, matching covers, and permutation-cycle rig
We construct a linear-size clean set beside a nearly classical no-three-in-line seed while excluding an entire class of mixed collinear triples. For arbitrarily
Can rational graph unions with coordinate capacity above $1.8$ support dense no-three-in-line selections? Two explicit Möbius maps generate a free action separa
We study a specified ring construction route to large integer-grid sets with no three collinear points. First, for every finite commutative chain ring of length
We study selection in a linear block system in which distinct blocks meet in at most one vertex and no three blocks form a Berge triangle. A clean set meets eve
For the no-three-in-line problem in an $N\times N$ integer grid, we construct reference laws at every fixed rational density $0<c<2$ that combine exact local re
Can all-direction no-three constraints be imposed while filling prescribed grid boxes and preserving a clean exterior? Fix $0<c<2$ and $N=cL^2$. We prove that a
Let a simple degree-two bipartite graph on two sets of $n$ vertices be independently relabeled on its rows and columns, and let $T$ count non-axis collinear tri
We prove that a nonsingular conic modulo an odd prime $p$ contains at most $\sqrt2\,n+O(n^{2/3})$ points in any translated integer square of side $n\le p$, unif
Can bounded-spacing protection coexist with nearly unrestricted row and column choices in a dense grid source? We construct, on every sufficiently large $n\time
How much of the dependence between grid directions can be recovered by conservation laws? We study explicit comparison laws for supports with at most two points
Can independent randomizations of integer-line constraints supply dense configurations that survive partial restoration of the true geometry? We study a cap-pre
Can periodic lifts of finite-plane arcs on higher-degree algebraic curves improve the classical three-halves density for the ordinary no-three-in-line problem?
We prove that every ordinary affine cap in $(\mathbb Z/p^2)^2$, for a prime $p\ge7$, has at most $(44/45)p^2+\frac12p^{3/2}+6p$ points, with the same leading co
We study ordinary no-three-in-line subsets of two-digit sources on squares of side $N=p^2$. The original conic-group source admits an $(11/6-o(1))N$ preparation
We study physical secants through external roots of a modular hyperbola with a parity-sensitive quadratic-character mask. An exact product-label covariance iden
We construct dihedral switch preparations for the ordinary no-three-in-line problem with changing occupied support, four conserved projections, and full leading
Gaussian integer digit supports offer superlinear candidate sets whose rotations escape scalar digit arguments. We prove that every stationary alphabet of at mo
Paper 83 deletes a cut $D$ from a random set $S$ (density $2/n$) so that no line of primitive height at least $\theta n$ holds three points. It then refills fre
Can a dense arithmetic source exclude several interacting classes of ordinary collinear triples while retaining a precise physical selection law? We construct s
How many collinear triples in a rounded modular hyperbola can contain two nearby vertical coordinates, while their horizontal distance and third point remain un
We give an explicit deterministic labeling for the bounded reciprocal-fibre neighborhoods used in the modular-hyperbola local-policy framework. After merging eq
We study no-three-in-line selections from dyadic square-grid sources having at most two points in every column and every modular fibre $ax+y=c$. The exact full
For every finite collection of invariant ternary integer forms with nonzero coefficients, and every fixed pair of input and output error bounds, we construct a
We study whether nonstationary digit choices, nonuniform sampling and finite automata can produce large no-three-in-line sets from Gaussian radix supports. A fi
We bound arbitrary ordinary no-three-in-line selections from full periodic algebraic supports, uniformly in every translated square of side $n\ge p$. Any nonzer
For the no-three-in-line problem, can deleted points be replaced while retaining a prescribed surviving set and enforcing both row and column quotas? Fix a posi
We study integer diagonal occupancies in a nearly saturated grid source obtained by projecting a Boolean cube with independent superincreasing integer weights a
The best proved density for the no-three-in-line problem is $3/2$, from the Hall–Jackson–Sudbery–Wild set of $3(p-1)$ points of one modular hyperbola in a $2p\t
We give a direct modular construction in a square of side $n=2p$ with at most four points on every Euclidean line and at least $27p/4-19\sqrt p/4-12$ points, fo