Remarks about the Arithmetic of Graphs

06/18/2021
by   Oliver Knill, et al.
0

The arithmetic of N, Z, Q, R can be extended to a graph arithmetic where N is the semiring of finite simple graphs and where Z and Q are integral domains, culminating in a Banach algebra R. A single network completes to the Wiener algebra. We illustrate the compatibility with topology and spectral theory. Multiplicative linear functionals like Euler characteristic, the Poincare polynomial or the zeta functions can be extended naturally. These functionals can also help with number theoretical questions. The story of primes is a bit different as the integers are not a unique factorization domain, because there are many additive primes. Most graphs are multiplicative primes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/26/2019

Arithmetic Progressions of Length Three in Multiplicative Subgroups of F_p

In this paper, we give an algorithm for detecting non-trivial 3-APs in m...
research
03/31/2022

Decidability bounds for Presburger arithmetic extended by sine

We consider Presburger arithmetic extended by the sine function, call th...
research
12/14/2016

Reverse Engineering of Irreducible Polynomials in GF(2^m) Arithmetic

Current techniques for formally verifying circuits implemented in Galois...
research
03/16/2022

Sparsification Lower Bound for Linear Spanners in Directed Graphs

For α≥ 1, β≥ 0, and a graph G, a spanning subgraph H of G is said to be ...
research
04/24/2020

High performance SIMD modular arithmetic for polynomial evaluation

Two essential problems in Computer Algebra, namely polynomial factorizat...
research
04/07/2020

Resultants over principal Artinian rings

The resultant of two univariate polynomials is an invariant of great imp...
research
11/16/2016

Efficient Parallel Verification of Galois Field Multipliers

Galois field (GF) arithmetic is used to implement critical arithmetic co...

Please sign up or login with your details

Forgot password? Click here to reset