36781 search results - page 31 / 7357 » Parameterizing by the Number of Numbers |
APPML
2008
13 years 7 months ago
2008
The following fundamental result for the domination number (G) of a graph G was proved by Alon and Spencer, Arnautov, Lov
JCT
2007
13 years 7 months ago
2007
We define a q generalization of weighted Catalan numbers studied by Postnikov and Sagan, and prove a result on the divisibility by p of such numbers when p is a prime and q its p...
MOC
2002
13 years 7 months ago
2002
Numbers of the form Fb,n = b2n +1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Let Q() and Q() be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, Q() Q(). The algorithm is particularly efficient if the number of i...
DEPCOS
2008
IEEE
14 years 2 months ago
2008
IEEE
True random number generators (TRNGs) are extensively used in cryptography, simulations and statistics. Metastability is a way to generate true random numbers. By using electromag...