Nanoelectronics systems must often be made with a wide variety of disparate materials, but the primary modes of manufacture – epitaxy or mechanical bonding – place stringent requirements on the ultimate scale or constituent materials of circuits. Researchers at the University of Illinois, Urbana-Champaign have developed a method for building twoand threedimensional circuits using a process akin...

We describe a rare case of Twiddler's syndrome that resulted in a complex ICD lead fracture involving both the insulation and the conductor. The conductor fracture resulted in noise artefact that was interpreted by the device as ventricular fibrillation, but the patient had not received any shocks because the "episodes" were non-sustained. The patient did not have traditional risk factors for T...

We had fixed the notation ζ f = e 2πi f , and τ (χ) = f k=1 χ(k)ζ k f , if χ has conductor f. We want to show: Theorem 0.1. Let χ be a Dirichlet character of conductor f > 1. Then for χ even, we have L(1, χ) = −

An algorithm is given to efficiently compute L-functions with large conductor in a restricted range of the critical strip. Examples are included for about 24000 dihedral Galois representations with conductor near 107. The data shows good agreement with a symplectic random matrix model.

In this paper, we determine all the imaginary abelian number fields with class number one. There exist exactly 172 imaginary abelian number fields with class number one. The maximal conductor of these fields is 10921 = 67 • 163 , which is the conductor of the biquadratic number field Q(\/-67, v'—163).

A polymer film electrode can be defined as an electrochemical system in which at least three phases are contacted successively in such a way that between a first-order conductor (usually a metal) and a second-order conductor (usually an electrolyte solution) is an electrochemically active polymer layer. The polymer layer is more or less stably attached to the metal, mainly by adsorption (adhesi...

Let AT be a cyclic number field with generating polynomial i a— 3 ^ û + 3 x3 —Y-x1 -=~-xi and conductor m. We will derive a lower bound for the class number of these fields and list all such fields with prime conductor m = (a1 + 21)/A or m = (1 + 21b2)/A and small class number.

In this paper we compute the relative class number of all imaginary Abelian fields of prime conductor below 10000. Our approach is based on a novel multiple evaluation technique, and, assuming the ERH, it has a running time of O(p2 log(p) log log(p)), where p is the conductor of the field.

An algorithm is given to efficiently compute, for large discriminant, L-functions of characters on the class group of a complex quadratic field. This is an analog in conductor aspect of the Odlyzko-Schönhage algorithm to compute the Riemann zeta function. Examples are included for about 21000L-functions with conductor near 10. The data shows good agreement with a symplectic random matrix model.

We discuss a new algorithm for finding all elliptic curves over Q with a given conductor. Though based on (very) classical ideas, this approach appears to be computationally quite efficient. We provide details of the output from the algorithm in case of conductor p or p2, for p prime, with comparisons to existing data.