Results 141 to 150 of about 22,931 (240)
Seeing Is Believing: Brain-Inspired Modular Training for Mechanistic Interpretability. [PDF]
Liu Z, Gan E, Tegmark M.
europepmc +1 more source
Average distance between the processors of biswapped networks. [PDF]
Prabhu S +3 more
europepmc +1 more source
Hypercomplex neural networks: Exploring quaternion, octonion, and beyond in deep learning. [PDF]
Devadas RM +5 more
europepmc +1 more source
Three-qubit-embedded split Cayley hexagon is contextuality sensitive. [PDF]
Holweck F, de Boutray H, Saniga M.
europepmc +1 more source
A graph X is said to be integral if all eigenvalues of the adjacency matrix of X are integers. This property was first defined by Harary and Schwenk who suggested the problem of classifying integral graphs. Since the general problem of classifying integral graphs seemed too difficult, graph theorists started to investigate special classes of graphs ...
openaire +1 more source
2010 Mathematics Subject Classification: Primary 05C25. Secondary 20K01, 05C45. Let Cay(G;S) denote the Cayley graph on a finite group G with connection set S. We extend two results about the existence of cycles in Cay(G;S) from cyclic groups to arbitrary finite Abelian groups when S is a “natural” set of generators for G.
openaire +1 more source
On 2-extendable abelian Cayley graphs
Onn Chan, C. C. Chen, Qinglin Yu
openalex +1 more source
Permutation-Based Distances for Groups and Group-Valued Time Series. [PDF]
Amigó JM, Dale R.
europepmc +1 more source
Exploring scalar quantum walks on Cayley graphs [PDF]
Olga Lopez Acevedo +2 more
openalex +1 more source
Critical points and syzygies for Feynman integrals. [PDF]
Page B, Song Q.
europepmc +1 more source

