Given an odd prime p we show a way to construct large families of polynomials Pq(x) Q[x], q C, where C is a set of primes of the form q 1 mod p and Pq(x) is the irreducible poly...
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...