Results 1  10
of
125
Searching for Primitive Roots in Finite Fields
, 1992
"... Let GF(p n ) be the finite field with p n elements where p is prime. We consider the problem of how to deterministically generate in polynomial time a subset of GF(p n ) that contains a primitive root, i.e., an element that generates the multiplicative group of nonzero elements in GF(p n ). ..."
Abstract

Cited by 47 (3 self)
 Add to MetaCart
Let GF(p n ) be the finite field with p n elements where p is prime. We consider the problem of how to deterministically generate in polynomial time a subset of GF(p n ) that contains a primitive root, i.e., an element that generates the multiplicative group of nonzero elements in GF(p n
Primitive and Quasi Primitive Elements in Weyl Modules for Type
 Bielefeld University
, 1997
"... this paper we will find out all (quasi) primitive elements in Verma modules of the quantized Frobenius kernel and Weyl modules for type A 2 , see xx23. Thus we understand the structure of the Verma modules and the Weyl modules more explicitly. Our method is based on the main results in [X1] and is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
this paper we will find out all (quasi) primitive elements in Verma modules of the quantized Frobenius kernel and Weyl modules for type A 2 , see xx23. Thus we understand the structure of the Verma modules and the Weyl modules more explicitly. Our method is based on the main results in [X1
Bounded gaps between primes with a given primitive root, II
"... Let m be a natural number, and letQ be a set containing at least exp(Cm) primes. We show that one can find infinitely many strings of m consecutive primes each of which has some q ∈ Q as a primitive root, all lying in an interval of length OQ(exp(C ′m)). This is a bounded gaps variant of a theorem o ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Let m be a natural number, and letQ be a set containing at least exp(Cm) primes. We show that one can find infinitely many strings of m consecutive primes each of which has some q ∈ Q as a primitive root, all lying in an interval of length OQ(exp(C ′m)). This is a bounded gaps variant of a theorem
Normal coordinates and primitive elements in the Hopf algebra of renormalization
 Commun. Math. Phys
, 2002
"... Abstract: We introduce normal coordinates on the infinite dimensional group G introduced by Connes and Kreimer in their analysis of the Hopf algebra of rooted trees. We study the primitive elements of the algebra and show that they are generated by a simple application of the inverse Poincaré lemma, ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Abstract: We introduce normal coordinates on the infinite dimensional group G introduced by Connes and Kreimer in their analysis of the Hopf algebra of rooted trees. We study the primitive elements of the algebra and show that they are generated by a simple application of the inverse Poincaré lemma
Evaluating Unsupervised Fault Detection in SelfHealing Systems Using Stochastic Primitives
"... Autonomous fault detection represents one approach for reducing operational costs in largescale computing environments. However, little empirical evidence exists regarding the implementation or comparison of such methodologies, or offers proof that such approaches reduce costs. This paper compares ..."
Abstract
 Add to MetaCart
the effectiveness of several types of stochastic primitives using unsupervised learning to heuristically determine the root causes of faults. The results suggest that selfhealing systems frameworks leveraging these techniques can reliably and autonomously determine the source of an anomaly within as little as five
MAXIMAL AND PRIMITIVE ELEMENTS IN BABY VERMA MODULES FOR TYPE B2
, 803
"... The purpose of this paper is to find maximal and primitive elements of baby Verma modules for a quantum group of type B2. As a consequence the composition factors of the baby Verma modules are determined. Similar approach can be used to find find maximal and primitive elements of Weyl modules for ty ..."
Abstract
 Add to MetaCart
The purpose of this paper is to find maximal and primitive elements of baby Verma modules for a quantum group of type B2. As a consequence the composition factors of the baby Verma modules are determined. Similar approach can be used to find find maximal and primitive elements of Weyl modules
AUSTRALIA’S ABORIGINAL ROOTS
"... the ocean blue in 1492 and founded America. Only later do they learn that America already had an indigenous population that Columbus, by his own error, named Indians. Preexisting populations were forced off of their lands and placed on reservations, effectively changing – and in many cases destroyi ..."
Abstract
 Add to MetaCart
destroying – life and culture as they knew it. This kind of history is not exclusive only to America. Even fewer people know of the pending extinction of the indigenous culture in Australia – the Aborigines. The undisturbed Aboriginal people, by today’s standards, would be classified as “primitives
ENSEMBLE KALMAN FILTER EXPERIMENTS WITH A PRIMITIVEEQUATION GLOBAL MODEL
, 2005
"... The ultimate goal is to develop a path towards an operational ensemble Kalman filtering (EnKF) system. Several approaches to EnKF for atmospheric systems have been proposed but not systematically compared. The sensitivity of EnKF to the imperfections of forecast models is unclear. This research expl ..."
Abstract
 Add to MetaCart
and testing of two EnKF methods: a serial ensemble square root filter (serial EnSRF, Whitaker and Hamill 2002) and a local EnKF (LEKF, Ott et al. 2002; 2004). We reproduced the results obtained by Whitaker and Hamill (2002) and Ott et al. (2004) on the Lorenz (1996) model. If we localize the LEKF error
Exact Roots for a RealTime Garbage Collector
, 2006
"... Garbage collection is traditionally not used in realtime systems due to the unpredictable temporal behavior of current implementations of a garbage collector. However, without garbage collection the programming model is very different from standard Java. It is the opinion of the authors that garbag ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
that garbage collection algorithms can be adapted to meet even the requirements for hard realtime systems. One important property of a realtime garbage collector is to identify only the real roots on the root scan. Misinterpreting primitive values as false root pointers can result in an unpredictable worst
The massless higherloop twopoint function
 Commun. Math. Phys
, 2009
"... Abstract. We introduce a new method for computing massless Feynman integrals analytically in parametric form. An analysis of the method yields a criterion for a primitive Feynman graph G to evaluate to multiple zeta values. The criterion depends only on the topology of G, and can be checked algorith ..."
Abstract

Cited by 49 (6 self)
 Add to MetaCart
Abstract. We introduce a new method for computing massless Feynman integrals analytically in parametric form. An analysis of the method yields a criterion for a primitive Feynman graph G to evaluate to multiple zeta values. The criterion depends only on the topology of G, and can be checked
Results 1  10
of
125