Cayley
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Remarks about the Moebius-Kantor graph
Announce Type: cross Abstract: The Moebius-Kantor graph MK=G(8,3) is a Cayley graph of three non-abelian groups, the Pauli group P(1), the semi-dihedral group SD(16), as well as the dihedral group D(16) of order 16. In topological graph theory, it illustrates the Heawood number 7 of the torus and leads to the Tucker group Aut(MK), the unique group of genus 2. We compute the Lefschetz numbers to illustrate the Brouwer-Lefschetz fixed point theorem.
Kronecker products and iterated matrix multiplication
arXiv:2606.08363v1 Announce Type: new Abstract: We observe that the Kronecker product of tensors is the operation that converts the determinant polynomial into Cayley's first hyperdeterminant. We apply the Kronecker product to iterated matrix multiplication, which results in the hypercomputant, a VNP-complete and VW[1]-complete polynomial whose hardness we prove via the equivariance of the Kronecker product. The construction works over arbitrary commutative semirings and also for the tensor...
Virtual-point-based Solutions to Handle Generalized Absolute Pose Problem
arXiv:2606.09294v1 Announce Type: new Abstract: Multi-camera systems are increasingly adopted in robotics and autonomous navigation for their wide field of view, flexibility, and fault tolerance. Nevertheless, existing PnP solvers fail to handle multiple projection centers. This paper introduces a virtual point formulation that bridges the standard PnP and generalized pose problems, enabling a unified pipeline that transforms existing PnP solvers into generalized pose solvers.
LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks
arXiv:2606.03303v1 Announce Type: new Abstract: Large Language Models (LLMs) exhibit strong informal mathematical reasoning but struggle to generate mechanically verifiable proofs in formal languages like Lean. We present LEAP, an agentic framework that enables general-purpose foundation models to achieve state-of-the-art performance on automated formal theorem proving. LEAP leverages foundation model capabilities, such as informal reasoning, instruction following, and iterative self-refinement.
Quantum circuits help AI overcome memory limitations with minimal new parameters
June 7, 2026 report Quantum circuits help AI overcome memory limitations with minimal new parameters Sam Jarman Author Gaby Clark Scientific Editor Robert Egan Associate Editor For millions of people, chatbots powered by large language models (LLMs) are now a key feature of everyday life. These AI systems are growing at a rapid pace, but scaling them up is becoming increasingly costly and resource-intensive. Through a new preprint on the arXiv server, a team led by Borja Aizpurua at...
LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks
Announce Type: replace Abstract: Large Language Models (LLMs) exhibit strong informal mathematical reasoning but struggle to generate mechanically verifiable proofs in formal languages like Lean. We present LEAP, an agentic framework that enables general-purpose foundation models to achieve state-of-the-art performance on automated formal theorem proving. LEAP leverages foundation model capabilities, such as informal reasoning, instruction following, and iterative self-refinement.