(1) (c, χ) = (7n, n), (2) (c, χ) = (5n, n), (3) (c, χ) = (4n, n), (4) (c, χ) = (2n, n), (5) (c, χ) = ((6 + 8g)n, (1 + g)n (for g ≥ 0), (6) (c, χ) = (7n+ (6 + 8g)m,n+ (1 + g)m), (7) (c, χ) = (7n+ 5m,n+m), (8) (c, χ) = (7n+ 4m,n+m), (9) (c, χ) = (7n+ 2m,n+m), (10) (c, χ) = ((6 + 8g)n+ 5m, (1 + g)n+m) (for g ≥ 0), (11) (c, χ) = ((6 + 8g)n+ 4m, (1 + g)n+m) (for g ≥ 0), (12) (c, χ) = ((6 + 8g)n+ 2m,...

Geostatistical simulations often require the generation of numerous realizations of a stationary Gaussian process over a regularly meshed sample grid Ω. This paper shows that for many important correlation functions in geostatistics, realizations of the associated process over m + 1 equispaced points on a line can be produced at the cost of an initial FFT of length 2m with each new realization ...

This article covers the geometric study of pointwise slant and semi-slant submanifolds a para-Cosymplectic manifold M? 2m+1 with semi-Riemannian metric. We give an advanced definition these type for spacelike timelike vector fields. obtain characterization results involutive totally geodesic foliation such 2m+1.

For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2)-((2m+n+2) 2-16n 2) ½)/8. Intoduction Let G=(V,E) be a connected graph G on n=│V│ vertices and m=│E│ edges. For a subgraph H of G and for a vertex i∈V(H), let d H (i) be the degree of i in H and let N H (i) be its neighbourhood in H. Let δ(H) and ∆(H) be the minimum degree an...

Montgomery multiplication in GF(2m) is defined by a(x)b(x)r 1(x) mod f(x), where the field is generated by irreducible polynomial f(x), a(x) and b(x) are two field elements in GF(2m), and r(x) is a fixed field element in GF(2m). In this paper, first we present a generalized Montgomery multiplication algorithm in GF(2m). Then by choosing r(X) according to f(x), we show that efficient architectur...

The root discriminant of a number field of degree n is the nth root of the absolute value of its discriminant. Let R0(2m) be the minimal root discriminant for totally complex number fields of degree 2m, and put α0 = lim infmR0(2m). Define R1(m) to be the minimal root discriminant of totally real number fields of degree m and put α1 = lim infmR1(m). Assuming the Generalized Riemann Hypothesis, α...