Results 321 to 330 of about 10,903,755 (367)
Some of the next articles are maybe not open access.
Large supersaturated designs over prime fields
Journal of Statistics and Management Systems, 2005Abstract In the recent literature, multi-level supersaturated designs (SSDs) have been extensively developed and studied. Two construction methods for optimal multi-level SSDs are used and the new 5-level and 7-level designs arising from these methods are compared using several criteria.
C. Koukouvinos, S. Stylianou
openaire +1 more source
A New Characterization of Finite Prime Fields
Canadian Mathematical Bulletin, 1968Let N ≡ <N, +,.> be a (right) near-ring with 1 (we say N is a unitary near-ring)[1] and recall that a near-field is a unitary near-ring in which <N - {0}, . > is a multiplicative group. In [2], Beidelman characterizes near-fields as those unitary near-rings without non-trivial N-subgroups. We show that in the finite case this absence of non-
openaire +1 more source
ON RADICAL FIELD EXTENSIONS OF PRIME EXPONENT
Journal of Algebra and Its Applications, 2002In this paper we investigate finite separable radical extensions K ⊆ L of prime exponent via the concept of G-Cogalois extension. As particular cases we retrieve some older results in I. Kaplansky [9] and A. Baker and H. M. Stark [7] concerning such radical extensions.
openaire +1 more source
On singular primes in function fields
Archiv der Mathematik, 1988Sei F ein separabel erzeugter Funktionenkörper in einer Variablen mit Konstantenkörper K der Charakteristik p. Sei \(F'=K'\cdot F\) eine Konstantenkörpererweiterung. Ein Primdivisor von F heißt K'- regulär, wenn der ganze Abschluß seines lokalen Ringes in F' durch Konstantenkörpererweiterung hervorgeht, andernfalls heißt er K'- singulär.
openaire +1 more source
Prime numbers in quadratic fields
CWI Quarterly, 1994The author gives a method, similar to the sieve of Eratosthenes, for finding the numbers less than a given bound that are norms of primes in a given quadratic field with unique factorization. There are given an extensive background of number theory, and a Pascal program to implement the method and plot the primes \(x+ \omega y\) (where 1, \(\omega\) is
openaire +2 more sources
Computation of a 768-Bit Prime Field Discrete Logarithm
International Conference on the Theory and Application of Cryptographic Techniques, 2017T. Kleinjung +4 more
semanticscholar +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
Radiotheranostics in oncology: Making precision medicine possible
Ca-A Cancer Journal for Clinicians, 2023Eric Aboagye
exaly
Asynchronous-Symmetric Channel-Hopping Sequences Over Prime Field for Cognitive Radio Networks
IEEE Communications Letters, 2018Ming-hsuan Chiang +3 more
semanticscholar +1 more source