q-Leibniz Algebras

2000 Mathematics Subject Classification: Primary 17A32, Secondary 17D25.

Polynomial Automorphisms Over Finite Fields

It is shown that the invertible polynomial maps over a finite field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1 it is shown that the tame subgroup of the invertible polynomial maps gives only the even bijections, i.e. only half the bijections. As a consequence it is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if #S = q^(n−1).

Supersymmetry and Ghosts in Quantum Mechanics

2000 Mathematics Subject Classification: 81Q60, 35Q40.

On strongly regular graphs with m2 = qm3 and m3 = qm2

2010 Mathematics Subject Classification: 05C50.

A Necessary and Sufficient Condition for the Existence of an (n,r)-arc in PG(2,q) and Its Applications

ACM Computing Classification System (1998): E.4.

On the Vertex Folkman Numbers Fv(2,...,2;q)

2000 Mathematics Subject Classification: 05C55.

(2,3)-generation of the groups PSL6(q)

2010 Mathematics Subject Classification: 20F05, 20D06.