{
 "artifacts": null,
 "category": "architecture",
 "description": "Represent tokens or nodes as two feature streams indexed by a finite group G, and replace dense pairwise mixing by a learned di-Cayley operator with within-stream and cross-stream connections. In the Fourier or irreducible-representation basis, each group frequency is processed independently by a small block matrix, giving exact translation or group equivariance and O(|G| log |G|) mixing for cyclic groups.",
 "formulas_latex": [
  "$$u\\sim v\\quad\\Longleftrightarrow\\quad vu^{-1}\\in S$$",
  "$$M_{\\rho}=\\begin{pmatrix}\\rho(S)\u0026\\rho(T)\\\\\\rho(T)^{*}\u0026\\rho(S)\\end{pmatrix},\\qquad \\rho(S)=\\sum_{s\\in S}\\rho(s),\\quad \\rho(T)=\\sum_{t\\in T}\\rho(t)$$",
  "$$\\chi_k(g)=\\omega^{k\\cdot g}=\\exp\\!\\left(\\frac{2\\pi i}{n}kg\\right),\\qquad \\omega=\\exp\\!\\left(\\frac{2\\pi i}{n}\\right),\\quad G=\\mathbb Z_n$$",
  "$$\\begin{bmatrix}H^{L\\prime}_k\\\\H^{R\\prime}_k\\end{bmatrix}=\\sigma\\!\\left(\\begin{bmatrix}L_k\u0026T_k\\\\T_k^{*}\u0026R_k\\end{bmatrix}\\begin{bmatrix}H^L_k\\\\H^R_k\\end{bmatrix}\\right),\\qquad H^L_k=\\operatorname{FFT}(H^L)_k,\\quad H^R_k=\\operatorname{FFT}(H^R)_k$$"
 ],
 "id": 231,
 "implementation": "(1) Integration point: insert this layer where a model performs spatial token mixing, graph message passing, or attention over positions arranged on a cycle, torus, periodic grid, or another known finite-group orbit. Maintain two tensors H_L and H_R with shape [batch, |G|, channels], representing two node types, parity classes, orientations, or alternating token streams. The MVP uses G = Z_n and replaces an n by n attention or graph-mixing matrix.\n\n(2) Pseudocode:\n```text\ninput HL, HR: [batch, n, d]\nZL = FFT(HL, axis=position)\nZR = FFT(HR, axis=position)\nfor k in 0,...,n-1:\n    qL = L[k] @ ZL[:, k, :] + T[k] @ ZR[:, k, :]\n    qR = conj(T[k]).T @ ZL[:, k, :] + R[k] @ ZR[:, k, :]\n    ZL[:, k, :], ZR[:, k, :] = activation(qL), activation(qR)\nHL2 = real(IFFT(ZL, axis=position))\nHR2 = real(IFFT(ZR, axis=position))\nreturn (HL, HR) + alpha * (HL2, HR2)\n```\nInitialize L[k] and R[k] near identity and T[k] near zero. To guarantee real outputs, tie conjugate frequencies: L[n-k] = conjugate(L[k]), R[n-k] = conjugate(R[k]), and T[n-k] = conjugate(T[k]).\n\n(3) Computed directly from the paper's mathematics: the two-stream block form, the Fourier character basis, and independent processing of representation modes. Learned empirically: L[k], R[k], T[k], the retained frequency set, and residual scale alpha. A fixed-connection baseline can use L[k] = sum over s in S_l of χ_k(s), R[k] = sum over s in S_r of χ_k(s), and T[k] = sum over t in S_m of χ_k(t), before allowing these coefficients to become channel matrices. For nonabelian groups, replace FFT by a group Fourier transform and use one block per irreducible representation.\n\n(4) First cheap experiment: train a small sequence model on length-128 cyclic classification tasks, such as deciding whether two marked symbols have a specified modular separation. Compare a standard Transformer encoder, a dense graph-convolution baseline, and this spectral layer at matched parameter count. Measure validation accuracy, loss versus wall-clock time, peak memory, and equivariance error E = ||f(shift_a H) - shift_a f(H)||_2 / ||f(H)||_2. Then test a periodic-grid image or molecular-ring benchmark. The expected signal is equivariance error near numerical precision, O(n log n) position mixing instead of O(n^2), lower memory, and equal or better accuracy on tasks respecting cyclic structure. On unstructured data, the method should not beat attention and may underfit.",
 "math_summary": "A Cayley graph on a group G with connection set S has an arc from u to v when vu^{-1} is in S; its adjacency operator is group convolution by the indicator of S. The paper computes spectra using irreducible representations ρ of G. For a two-part graph with within-part connection set S and cross-part connection set T, the local spectral block is M_ρ = [[ρ(S), ρ(T)], [ρ(T)*, ρ(S)]], where ρ(S) = sum over s in S of ρ(s), ρ(T) = sum over t in T of ρ(t), and * denotes conjugate transpose. Each eigenvalue of M_ρ is repeated according to the representation dimension d_ρ. For an abelian group such as G = Z_n, every irreducible representation is the scalar character χ_k(g) = exp(2π i k g/n), so M_k is a 2 by 2 matrix. The neural adaptation replaces fixed connection sums by learned channel matrices L_k, R_k, and T_k, using the two-stream block update [H_L'_k; H_R'_k] = σ([[L_k,T_k],[T_k*,R_k]][H_L_k;H_R_k]). Because group convolution diagonalizes into these representation blocks, the resulting linear layer commutes with simultaneous group shifts.",
 "math_tags": [
  "representation-theory",
  "harmonic-analysis",
  "linear-algebra",
  "group-theory"
 ],
 "ml_areas": [
  "graph-nn",
  "transformer",
  "attention",
  "embedding"
 ],
 "paper": {
  "arxiv_id": "2608.27231",
  "arxiv_url": "https://arxiv.org/abs/2608.27231",
  "summary_what_math_gives_to_ml": "The paper's transferable asset is an explicit representation-theoretic decomposition of a two-part directed graph into independent spectral blocks. For each irreducible representation, within-stream and cross-stream connection sets become small matrices, with the displayed block M_ρ = [[ρ(S), ρ(T)], [ρ(T)*, ρ(S)]]. This suggests a two-stream group-equivariant neural layer whose spatial mixing is performed independently in Fourier modes, reducing structured mixing from quadratic cost to FFT-based cost for cyclic groups. The first implementation should target periodic sequences, grids, or graph data with a known finite-group action, where exact equivariance is useful and the structural assumption is falsifiable.",
  "title": "On di-Cayley graphs and their spectrum",
  "year": "2026"
 },
 "ratings": {
  "difficulty": 5,
  "novelty": 5,
  "usefulness": 6
 },
 "solves": [
  "speedup",
  "scalability",
  "accuracy"
 ],
 "title": "Di-Cayley two-stream spectral layer",
 "url": "https://synthcore.org/idea/231/di-cayley-two-stream-spectral-layer",
 "verification": {
  "peer_reviewed": false,
  "status": "unverified",
  "status_label": "Unverified",
  "verdict_source": "deterministic test code (paired-seed permutation statistics)",
  "verification_axes": {
   "benchmark_mechanism": {
    "confirmed": null,
    "tested": false
   },
   "practical_benchmark": {
    "beats_baseline": null,
    "tested": false
   },
   "toy_mechanism_gate": {
    "confirmed": null,
    "tested": false
   }
  }
 }
}