Algebras of Interaction and Cooperation

• URL: http://arxiv.org/abs/2404.15361v1
• Date: Thu, 18 Apr 2024 08:01:43 GMT
• Title: Algebras of Interaction and Cooperation
• Authors: Ulrich Faigle,
• Abstract summary: Systems of cooperation and interaction are represented in vector spaces with multiplicative structures in algebras. Basic interpretations of natural numbers yield natural algebras and offer a unifying view on cooperation and interaction.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Systems of cooperation and interaction are usually studied in the context of real or complex vector spaces. Additional insight, however, is gained when such systems are represented in vector spaces with multiplicative structures, i.e., in algebras. Algebras, on the other hand, are conveniently viewed as polynomial algebras. In particular, basic interpretations of natural numbers yield natural polynomial algebras and offer a new unifying view on cooperation and interaction. For example, the concept of Galois transforms and zero-dividends of cooperative games is introduced as a nonlinear analogue of the classical Harsanyi dividends. Moreover, the polynomial model unifies various versions of Fourier transforms. Tensor products of polynomial spaces establish a unifying model with quantum theory and allow to study classical cooperative games as interaction activities in a quantum-theoretic context.

Related papers

• CoLA: Exploiting Compositional Structure for Automatic and Efficient Numerical Linear Algebra [62.37017125812101]
  We propose a simple but general framework for large-scale linear algebra problems in machine learning, named CoLA. By combining a linear operator abstraction with compositional dispatch rules, CoLA automatically constructs memory and runtime efficient numerical algorithms. We showcase its efficacy across a broad range of applications, including partial differential equations, Gaussian processes, equivariant model construction, and unsupervised learning.
  arXiv  Detail & Related papers  (2023-09-06T14:59:38Z)
• An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree [79.43134049617873]
  In this paper, we demonstrate an exponential separation between exact degree and approximate quantum query for a partial function. For an alphabet size, we have a constant versus separation complexity.
  arXiv  Detail & Related papers  (2023-01-22T22:08:28Z)
• Multiparameter Persistent Homology-Generic Structures and Quantum Computing [0.0]
  This article is an application of commutative algebra to the study of persistent homology in topological data analysis. The generic structure of such resolutions and the classifying spaces are studied using results spanning several decades of research.
  arXiv  Detail & Related papers  (2022-10-20T17:30:20Z)
• Polynomial algebras of superintegrable systems separating in Cartesian coordinates from higher order ladder operators [0.618778092044887]
  We introduce the general algebras characterizing a class of higher order superintegrable systems that separate in coordinates. The construction relies on underlying Heisenberg algebras and their defining higher order ladder operators.
  arXiv  Detail & Related papers  (2022-02-27T03:33:26Z)
• Learning Algebraic Representation for Systematic Generalization in Abstract Reasoning [109.21780441933164]
  We propose a hybrid approach to improve systematic generalization in reasoning. We showcase a prototype with algebraic representation for the abstract spatial-temporal task of Raven's Progressive Matrices (RPM) We show that the algebraic representation learned can be decoded by isomorphism to generate an answer.
  arXiv  Detail & Related papers  (2021-11-25T09:56:30Z)
• Hilbert Space Fragmentation and Commutant Algebras [0.0]
  We study the phenomenon of Hilbert space fragmentation in isolated Hamiltonian and Floquet quantum systems. We use the language of commutant algebras, the algebra of all operators that commute with each term of the Hamiltonian or each gate of the circuit.
  arXiv  Detail & Related papers  (2021-08-23T18:00:01Z)
• Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
  We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization. Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra. Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
  arXiv  Detail & Related papers  (2021-07-14T07:23:46Z)
• Hilbert Spaces of Entire Functions and Toeplitz Quantization of Euclidean Planes [0.0]
  We extend the theory of Toeplitz quantization to include diverse and interesting non-commutative realizations of the classical Euclidean plane. The Toeplitz operators are geometrically constructed as special elements from this algebra. Various illustrative examples are computed.
  arXiv  Detail & Related papers  (2021-05-18T09:52:48Z)
• Resource theory of imaginarity: Quantification and state conversion [48.7576911714538]
  Resource theory of imaginarity has been introduced, allowing for a systematic study of complex numbers in quantum mechanics and quantum information theory. We investigate imaginarity quantification, focusing on the geometric imaginarity and the robustness of imaginarity, and apply these tools to the state conversion problem in imaginarity theory. Our study reveals the significance of complex numbers in quantum physics, and proves that imaginarity is a resource in optical experiments.
  arXiv  Detail & Related papers  (2021-03-02T15:30:27Z)
• Algebraic Neural Networks: Stability to Deformations [179.55535781816343]
  We study algebraic neural networks (AlgNNs) with commutative algebras. AlgNNs unify diverse architectures such as Euclidean convolutional neural networks, graph neural networks, and group neural networks.
  arXiv  Detail & Related papers  (2020-09-03T03:41:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.