Uniform list coloring of long odd two-fans and rigidity in critical graphs
We study list-coloring extensions and exterior rigidity for the Earth–Moon problem. The graph $J(a,b)$ consists of adjacent hubs and two internally disjoint odd
We study list-coloring extensions and exterior rigidity for the Earth–Moon problem. The graph $J(a,b)$ consists of adjacent hubs and two internally disjoint odd
In Muon-trained language models the constant-LR population gradient is mostly a period-2 bounce. We measure this and test its consequences for momentum and batc
For a set in an $N\times N$ integer grid with at most two points per horizontal row, call a pair ordinary if its physical line contains exactly two selected poi
Let $N(n,m)$ be the number of no-three-in-line $m$-subsets of the $n\times n$ grid. We measure $\log N(m+1)/N(m)$ at $m=cn$ for $c=1.0$–$1.6$ and $n=50$–$800$ t
For three distinct nonzero rationals $x_i$ with $e_3=x_1x_2x_3$, let $E_X:Y^2=\prod_i(X+e_3/x_i)$ carry the point $P_0=(0,e_3)$. We prove that three points $T'_
We classify the rational points over $\mathbb Q(r)$ on the genus-three cover $v^2=N_r(u)$, $a^2=(r^2-1)(1-u^2)$, where $N_r(u)=(r^4+2r+1)u^4+2r^2(r+1)u^3-r^2(2r
In the order-four construction of rational Diophantine septuples, a triple is extended by four translates of a point by a point $S$ of order four on its induced
We prove a finite local extension theorem for the contacted odd/odd two-fan patches appearing in a 492-vertex biplanar occurrence barrier. Every J(5,5) with one
We construct an explicit smooth projective genus-21 curve arising from the regular-twin Diophantine construction with anchors $a=10783710$ and $b=-3/(4a)$. The
How does the grid differ from random line systems sharing its per-direction statistics? For $2n$-point no-three-in-line sets, $s(n)=R_2(n)P(\mathrm{void})$ unde
The lift of a modular hyperbola to a square of side $2p$ gives the best known lower bound $(3/2-o(1))n$ for the no-three-in-line problem. How much can one hyper
Gaussian integer digit supports offer superlinear candidate sets whose rotations escape scalar digit arguments. We prove that every stationary alphabet of at mo
A ten-chromatic biplanar graph on twenty vertices would contain a 10-critical graph $G$ with $e(G)\le108$, $\delta(G)\ge9$ and no $K_9$. The order-twenty progra
We study extension formulas in the family of square-product rational Diophantine quintuples parametrized by $V^2=(k^2-2)(k^2+4)$. Of twenty regular fourth-eleme
We reduce the ten-color question for biplanar line graphs of arbitrary finite loopless multigraphs to four explicit graphs on 28 vertices. The Goldberg–Seymour
We study low-genus curves on the surface u^2+w^2=r^2+r^{-2}, z^2=(u^2-1)(1-w^2), which underlies the rational Diophantine septuple problem. Resolving the canoni
We classify nine-critical graphs on seventeen vertices with at most 81 edges that possess an independent triple having no disjoint $K_8$. Exactly 22 isomorphism
We classify low-genus curves in two complete four-parameter systems on the exotic-quintuple surface of Dujella, Kazalicki and Petričević. The rational hyperplan
A relation census identifies a mechanism shared by six rational almost Diophantine septuples: two regular quintuple extensions followed by another regular exten
A rational Diophantine tuple has pairwise products plus one square, and an entry is strong when its square plus one is square. We prove thirteen coordinate excl
We study lifted relaxations of the full no-three-in-line point-line formulation. Explicit rational moments keep a target cardinality of $1.8n$ feasible through
For $n\le74$ and $n=76$ the no-three-in-line optimum is known: $t(n)=2n$. Above that range the best values come from local search, and they fall from about $1.8
We construct dihedral switch preparations for the ordinary no-three-in-line problem with changing occupied support, four conserved projections, and full leading
We audit a concrete extension route toward a rational Diophantine septuple. Wildner's explicit moving D(q)-quintuple is specialized to z=T^2 and divided by T, g
We study ordinary covers of the ten-chromatic graph $G_{25}$ as possible sources of ten-chromatic biplanar graphs. Four earlier extension results are retained.
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
We study signed list constraints and prescribed-center extensions in ordinary covers of the ten-chromatic graph $G_{25}$. Our affine theorem partitions variable
We study whether adding one or two vertices to a nine-chromatic host can produce a ten-chromatic biplanar graph. For an explicit 25-vertex, 148-edge template $T
A graph has outerthickness at most two if its edges are the union of two outerplanar graphs. Its largest chromatic number is known only to lie in $\{6,7,8\}$ (G
Studies of RLVR on Qwen3-0.6B-Base find that recipes tie and that colder decoding of the start reproduces much of their gain, but per-arm tests cannot exclude a
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
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
Group-normalized RLVR has zero fresh advantage when all sampled outcomes agree. We test whether increasing verifier contrast improves Qwen3-0.6B-Base under the
Can fractional coloring above nine be sought within graph representations having a common antipodal symmetry? We give a connected representation of every nonemp
We prove a sharp coloring-extension theorem for complements of positive-capacity five-cycle blow-ups. Let the five positive integer edge capacities sum to $k$,
For five rational Diophantine entries, the classical factor-analysis pentad applied to their signed pair roots minus a common shift is quadratic in the shift. W
We prove that every ten-critical biplanar graph on twenty-one vertices has independence number three. Consequently every biplanar graph on twenty-one vertices w
We study the canonical extension of rational symmetric Diophantine quadruples to symmetric sextuples. The construction factors through an explicit genus-one tor
We study simultaneous coloring repairs for a root clique and an isolated root over specified cores. An explicit eleven-vertex core proves the abstract four-root
For every $N=2^m$, we give an explicit digit support with exact all-line fractional optimum $2N$ and prove that its weighted measures converge to twice a probab
Given rational numbers $a_1,\ldots,a_n$ with $1+a_i a_j$ a rational square for every distinct pair, form the matrix $N$ with zero diagonal and off-diagonal entr
The norm-and-anchor surface of a determinant-zero Diophantine septuple chart is a known Kummer surface attached to the square of E: y²=x(x−1)(x−2). We classify
Adding deterministic inserted computation to a small RLVR model can produce a large apparent training gain consistent with recovery from a damaged initializatio
RLVR on Qwen3-0.6B-Base plateaus. Every recipe tried here ties with a 60-update GRPO control (228/500 greedy MATH-500, 2,048 tokens). A common reading: the poli
We give explicit no-three-in-line sets in the $n\times n$ grid with at least $1.8n$ points for sixteen sizes $100\le n\le200$. Eleven are strictly above $1.8n$
Token conservation does not ensure that a finite pretraining run exposes every source document. We analyze a streaming packing family that maintains a minimum b
A realized residual-stream mixing matrix and the Jacobian of its input-dependent mixing map are different operators. Building on established gating and attentio
Tool-assisted accuracy after reinforcement learning can conflate interface adaptation, responses to displayed observations and ordinary-answer improvement. We c
The norm-and-anchor surface of a determinant-zero Diophantine chart has no nondegenerate sections over its original parameter line, but that result leaves highe
A natural route to nine-coloring a biplanar graph deletes one vertex and identifies independent blocks of its neighborhood until at most eight boundary vertices