a modular $k$-coloring, $kge 2,$ of a graph $g$ without isolated vertices is a coloring of the vertices of $g$ with the elements in $mathbb{z}_k$ having the property that for every two adjacent vertices of $g,$ the sums of the colors of the neighbors are different in $mathbb{z}_k.$ the minimum $k$ for which $g$ has a modular $k-$coloring is the modular chromatic number of $g.$ except for some s...

For a prime p let G be a finite p-group and K a field of characteristic p. The Modular Isomorphism Problem (MIP) asks whether the modular group algebra KG determines the isomorphism type of G. We briefly survey the history of this problem and report on our computer-aided verification of the Modular Isomorphism Problem for the groups of order 512 and the field K with 2 elements.

We join Hurwitz space constructions and the universal Frattini cover of a nite group The goal is to form and apply generalizations of the towers X p X p X p of modular curves This generalization relies on the appearance of the dihedral group Dp and its companion group Zp f g in the theory of modular curves We replace Dp by any nite group G and p by any prime dividing the order of G The replacem...