نتایج جستجو برای: n exponent
تعداد نتایج: 991567 فیلتر نتایج به سال:
The Fibonacci lengths of the finite p-groups have been studied by R. Dikici and co-authors since 1992. All of the considered groups are of exponent p, and the lengths depend on the celebrated Wall number k(p). The study of p-groups of nilpotency class 3 and exponent p has been done in 2004 by R. Dikici as well. In this paper we study all of the p-groups of nilpotency class 3 and exponent p2. Th...
Energy development of decaying isotropic turbulence in a 3-D periodic cube with non-rotating or rotating frames of reference is studied through direct numerical simulation using GPU accelerated lattice Boltzmann method. The initial turbulence is isotropic, generated in spectral space with prescribed energy spectrum E(κ)~κm in a range between κmin and ...
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pseudo-random bit generator. This new generator outputs n− c− 1 bits per exponentiation with a c-bit exponent. Using typical parameters, n = 1024 and c = 160, this yields roughly 860 pseudo-random bits per small exponent...
We show that the minimal proportion of one letter in an n-th power-free binary word is asymptotically 1=n. We also consider a generalization of n-th power-free words deened through the notion of exponent: a word is x-th power-free for a real x, if it does not contain subwords of exponent x or more. We study the minimal proportion of one letter in an x-th power-free binary word as a function of ...
We study the Lyaponov exponent y A (E) of (h u) (n) = u(n + 1) + u(n-l) + A V (n) u (n) in the limit as A +a where V is a suitable random potential. We prove that yA(E)-ln A as A +CO uniformly as E/A runs through compact sets. We also describe a formal expansion (to order A-*) for random and almost periodic potentials. In this note, we study one-dimensional tight binding Hamiltonians h = ho + A...
We prove that every noncyclic subgroup of a free m-generator Burnside group B(m, n) of odd exponent n ≫ 1 contains a subgroup H isomorphic to a free Burnside group B(∞, n) of exponent n and countably infinite rank such that for every normal subgroup K of H the normal closure 〈K〉B(m,n) of K in B(m, n) meets H in K. This implies that every noncyclic subgroup of B(m, n) is SQ-universal in the clas...
Abstract We prove that for positive integers $m \geq 1, n 1$ and a prime number $p \neq 2,3$ there are finitely many finite m -generated Moufang loops of exponent $p^n$ .
In this paper, we find the maximum exponent of D × E, the cartesian product of two digraphs D and E on n, n + 2 vertices, respectively for an even integer n ≥ 4. We also characterize the extremal cases.
A set of positive integers is primitive (or 1-primitive) if no member divides another. Erd\H{o}s proved in 1935 that the weighted sum $\sum1/(n \log n)$ for $n$ ranging over a $A$ universally bounded all choices $A$. In 1988 he asked this universal bound attained by prime numbers. One source difficulty conjecture $\sum n^{-\lambda}$ maximized primes and only $\lambda$ at least critical exponent...
We investigate the scattering process of impulse in vertical granular chain with light impurities. When the perturbation is weak, the quantities describing the reflection rate exhibit power law behavior with the impuity depth. The exponent is nearly independent of vi. When the perturbation is very strong, the vertical chain shows similar behavior to that of the horizontal chain, so the exponent...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید