Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Represent each feature as belonging to one of three \(\mathbb{Z}_3\) charge sectors and constrain every linear and multiplicative operation to obey charge addition modulo 3. Add invariant cubic gates such as \(x_1x_2x_3\) or \(x_q^3\), which can express the same phase-insensitive interaction selected by the paper's three-photon drive. This should improve data efficiency and exact cyclic-augmentation consistency when the task has a genuine ternary symmetry.
Replace fixed graph-convolution weights with edge couplings that depend on learned node amplitudes and relative phases, following the power-grid stability construction. Add trainable positive diagonal margins that dominate aggregate phase-weighted incident coupling, then use the resulting operator in a residual or recurrent GNN layer. This creates an operating-point-aware propagation rule intended to reduce oversmoothing, exploding iterates, and sensitivity to graph degree or edge loading.
Replace a dense token or channel mixing matrix by a fixed sparse directed graph whose states are ordered pairs of symbols and whose transitions advance through a cyclic phase. Each state has exactly two allowed successors, obtained by appending a symbol different from the previous two, producing a strongly connected, vertex-transitive sparse mixer with shared local dynamics. The prescribed phase structure prevents arbitrary short-cycle routing and can act as an anti-collapse inductive bias in…
Use the paper's topology-dependent Laplacian spectral bound to set the diffusion horizon of a graph neural network instead of using a fixed number of message-passing steps for every graph. For genus-g graphs, choose the horizon from the conservative slow-mode timescale n/(Delta g), while separately capping the step size to keep high-frequency modes stable.
Represent a population of N circular latent states using a three-parameter Möbius transformation applied to fixed uniform reference phases, rather than learning N unrelated angles. The resulting states remain on the circle by construction and can model concentrated or nearly uniform phase populations through a single concentration parameter.
Replace independently sampled random-walk paths used for GNN neighbor or subgraph sampling by persistent rotor walks on the training graph. Each node stores a pointer into a fixed cyclic ordering of its outgoing neighbors; every visit advances the pointer and selects the next neighbor, producing deterministic coverage with no repeated random choices. Use several short rotor trajectories per seed and periodically reinitialize only the rotors in an encountered subgraph.
Use the graph Laplacian spectrum to set the mixing and correction coefficients of a two-state graph-propagation block. Balancing the contraction of low-frequency consensus modes against high-frequency disagreement modes may reduce oversmoothing and make deep graph-neural networks less sensitive to manually selected residual coefficients.
Augment spatial training examples by replacing a compact active region with several separated components while preserving its exact value histogram, total active area, and amplitude. The augmentation probes the nonlinear interaction between diffusion-like receptive fields and threshold activations, which the paper shows can make fragmented and compact inputs evolve in opposite directions despite identical distributions.