Search Results for ""

A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).

The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.

A continuous homomorphism of a group into the nonzero complex numbers. A multiplicative character omega gives a group representation on the one-dimensional space C of complex ...

An Artin L-function over the rationals Q encodes in a generating function information about how an irreducible monic polynomial over Z factors when reduced modulo each prime. ...

A special case of the Artin L-function for the polynomial x^2+1. It is given by L(s)=product_(p odd prime)1/(1-chi^-(p)p^(-s)), (1) where chi^-(p) = {1 for p=1 (mod 4); -1 ...

A generalization of the Euler L-function associated with a Grössencharakter.

The conjecture that the Artin L-function of any n-dimensional complex representation of the Galois group of a finite extension of the rational numbers Q is an Artin ...

Let p be an odd prime and b a positive integer not divisible by p. Then for each positive odd integer 2k-1<p, let r_k be r_k=(2k-1)b (mod p) with 0<r_k<p, and let t be the ...