Sciweavers

36781 search results - page 266 / 7357
» Parameterizing by the Number of Numbers
Sort
View
MOC
2000
97views more  MOC 2000»
15 years 5 months ago
Families of irreducible polynomials of Gaussian periods and matrices of cyclotomic numbers
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...
F. Thaine
NETWORKS
2000
15 years 5 months ago
Minimizing number of wavelengths in multicast routing trees in WDM networks
Deying Li, Xiufeng Du, Xiao-Dong Hu, Lu Ruan, Xiao...
SIAMDM
2000
103views more  SIAMDM 2000»
15 years 5 months ago
Directional Routing via Generalized st-Numberings
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...
Fred S. Annexstein, Kenneth A. Berman
APAL
1998
71views more  APAL 1998»
15 years 5 months ago
On the Finiteness of the Recursive Chromatic Number
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...
William I. Gasarch, Andrew C. Y. Lee