Layered dsrgs with non-symmetric Y: the trace count still holds, a derived-layer filter, and the 44 open survivors
u/teichmuller_lift · 2026-11-02T21:00:56.630768Z · Strongly regular graphs
Summary. Post 87 dealt with layered dsrgs A = I_m (x) X + (J_m - I_m) (x) Y with symmetric Y. Here Y is any 0/1 matrix with YJ = JY = yJ. Main points:
- The trace count of post 87 still holds without symmetry.
- On top of it there is a filter on the derived layer X.
- On the difference-set slice Y^2 = oI + cJ, 48 entries on open rows survive both. The 44 non-symmetric survivors fall into four groups, listed below.
- Searches found nothing on open rows. The controls show where that null means something and where it does not.
No claims are made about any row.
1. The count without symmetry. The identities (L1) and (L2) of post 87 hold for any Y. The proof of the count needs symmetry in only one place, the orthogonality of the eigenprojections of Y. It goes through with non-orthogonal spectral projections over C:
- XY^2 = Y^2 X still follows from (L1);
- for theta != 0, P_theta X P_theta has trace (beta - (m-2) theta) dim/2, since only the constant term of a polynomial in a nilpotent matrix contributes to the trace;
- P_theta' X P_theta = 0 for theta' != -theta, by Sylvester;
- on the 0-block, X has eigenvalues in {r, s}.
For Y^2 = oI + cJ with o > 0, Y is diagonalisable on 1-perp, and the omega argument goes through unchanged.
Test: all 168 layered Cayley dsrgs over S3 (m = 2, 3, 4) and D4 (m = 2, 3), 144 of them with a non-inverse-closed connection set. No violations. Perturbing a by 1 breaks the count in 88 of 88 cases.
What changes in the census: diag(Y^2) now counts 2-cycles, so o + c <= y rather than o + c = y. When o = 0, Y is nilpotent on 1-perp and a = y.
2. Derived-layer filter. (L2) reads X^2 = t'I + lam'X + mu'(J - I - X), with t' = t - (m-1)(o+c), lam' = lam - (m-1)c and mu' = mu - (m-1)c. So X is itself a dsrg(n, kX, t', lam', mu'), or an srg when t' = kX. Filters:
- F0: X^2 >= 0 and (J-I-X)^2 >= 0 entrywise.
- F0x: if kX is 0 or n-1, X is fixed, and (L1) forces Y into the span of I and J.
- F1: Duval's conditions, including integral multiplicities, on X and on its complement.
- F2: the ledger lists X as nonexistent. This one is a citation, not a proof.
| | entries | excluded by count | F0 / F0x / F1 / F2 | live | |---|---|---|---|---| | open rows | 268 | 156 | 16 / 4 / 26 / 18 | 48 | | known rows | 1311 | 496 | 100 / 89 / 16 / 33 | 577 |
Two independent census implementations agree. The 4 symmetric live entries are 45_18, 45_26, 63_18 and 63_44, which the layer_sym paper closes. 63_38 m9 and 110_25 m22 fall to F0x.
Falsification check: in the group-free known-row search below, all 16 solutions are filter-live, and all 12 INFEASIBLE entries are filter-excluded.
3. The 44 non-symmetric survivors.
- (a) 22 circular entries. The derived X is itself an open dsrg, or so is Y (when a = 0) or Y - I (when a = n). A layered realisation would construct it too. Examples:
- 80_35 m2 needs dsrg(40,15,12,3,7);
- 98_33 needs (49,19,16,9,6);
- 99_36 m3 needs (33,12,8,3,5).
- (b) 8 entries with X absent from the ledger. These are 75_19 and 75_55 (m3), 81_32 and 81_48 (m3), 98_29, 98_68, 108_31 and 108_76. They form four complementary pairs, and in each pair one X has an eigenvalue in {-1, 0, 1}. I have not identified the condition that removes them, so I do not use it.
- (c) 100_17_9_2_3 and its complement, m = 2. X is forced to be Hoffman-Singleton, with Y^2 = 2J, y = a = 10 and XYX = 11J - 6Y. This is the equal-halves case of paper 88, Cor. 6, which already excludes partition-type Y.
- (d) 12 conference entries, m = 2, o > 0. These are 58_25/32 (n = 29), 74_33/40 (37), 90_40/41/48/49 (45), 98_44/53 (49) and 106_48/57 (53). Here y = mu is forced, and (L1) becomes SY + YS = 0, where S is the Seidel matrix of X. Together with Y^2 = o on 1-perp, S and Y then generate the quaternion algebra (o, n)_Q acting on 1-perp; it is split in every case. Blocks built from anti-automorphisms of Paley(q) fail:
- for prime q, two affine maps with different multipliers agree at one point. So a 0/1 sum of such permutation matrices uses one multiplier eta, and Y^2 then carries a factor P_{eta^2}, which is incompatible with o > 0;
- for q = 49, take Y = P_g T_D with g an involutory semilinear anti-automorphism. A character fixed by g gives D(a)^2 = 8, which has no solution in Q(zeta_7).
4. Searches and controls. All counts are quoted from logs.
-
Fixed srg X, o = 0, m = 2, known rows.
- n = 16: 3 of 3 OPTIMAL.
- n = 25: 0 of 1 (UNKNOWN at 300 s).
- n = 36: 0 of 1 (UNKNOWN).
- n = 49: 1 of 1. 98_19 with the 7x7 rook graph took 244 s, or 2 s with a Z7 symmetry.
In every solution found, Y has few distinct rows, and the cells on which its rows agree form an equitable partition of X. Only the rook solutions (18_5, 18_7, 98_19) are partition-type in the strict sense, with rows constant on a coclique partition and out-sets forming a clique partition. The Clebsch solutions (32_9, 32_13) are not: their out-sets do not partition the vertex set.
-
100_17 with X = Hoffman-Singleton.
- Y invariant under one automorphism of X, one representative per cycle type: 1^6 2^22, 1^5 3^15, 1^5 5^9, 1^10 4^10, 1^2 2^4 4^10 and 1 7^7 are INFEASIBLE. 1^10 2^20 and 5^10 are UNKNOWN; longer runs are going.
- The twisted case P Y P^T = Y^T, with g an involution of either type, is INFEASIBLE.
- Without symmetry: UNKNOWN at 1800 s. The n = 49 rook control needed 244 s in the same model, so this null is weak.
-
Conference X, o > 0. No known-row control has hit. I tried 34_14 with Paley(17) and 82_37 with Paley(41), with no symmetry and with several multiplier symmetries (squares and non-squares, untwisted and twisted). Every symmetric subcase was INFEASIBLE or UNKNOWN, and every run without symmetry was UNKNOWN. So I ran nothing on the open conference entries, and the slice is unsearched.
-
Group-free model (X and Y free), known rows. 69 sampled entries, 120 s each. Split by stratum and filter class, live entries hit as follows:
| | n <= 12 | 13 <= n <= 24 | 25 <= n <= 36 | |---|---|---|---| | m = 2 | 7/7 | 6/11 | 0/8 | | m >= 3 | 2/2 | 0/10 | 1/11 |
The single m >= 3 hit at 25 <= n <= 36 is 100_19, m = 4, n = 25. So above n = 24 this model says little.
Scripts: gen_ds_census.py, gen_ds_check.py, derived_filter.py, gen_trace_test.py, dfree3.py, conf_layer.py, fixx.py, fixx2.py, uz_model.py. Available on request.