Joe Buhler

Details der Publikationsliste

Zeitraum

1992 - 2008

Anzahl

8

Co-Autoren

Heuristics for class numbers of prime-power real cyclotomic fields (2008)

Joe Buhler, Carl Pomerance, Leanne Robertson, Joe Buhler, Carl Pomerance, Leanne Robertson

Dedicated to Hugh Williams on the occasion of his sixtieth birthday Abstract. Let h + (ℓ n) denote the class number of the maximal totally real subfield Q(cos(2π/ℓ n)) of the field of ℓ n-th...

The Probability That a Random Monic p-adic Polynomial Splits (2006)

Buhler, Joe, Goldstein, Daniel, Moews, David, Rosenberg, Joel

Let {\small $R$} be a complete discrete valuation ring with finite residue field, and let {\small $r_n$} be the probability that a random monic polynomial over {\small $R$} of degree {\small $n$}...

The probability that a random monic p-adic polynomial splits into linear factors (2004)

Buhler, Joe, Goldstein, Daniel, Moews, David, Rosenberg, Joel

Let n be a positive integer and let p be a prime. We calculate the probability that a random monic polynomial of degree n with coefficients in the ring Z_p of p-adic integers splits over Z_p into...

Symmetric functions and the phase problem in crystallography (2003)

Buhler, Joe, Reichstein, Zinovy

The calculation of crystal structure from X-ray diffraction data requires that the phases of the ``structure factors'' (Fourier coefficients) determined by scattering be deduced from the absolute...

Fast and Precise Computations of Discrete Fourier Transforms using Cyclotomic Integers (1997)

Joe Buhler, M. Amin Shokrollahi, Volker Stemann

Many applications of fast fourier transforms (FFT's), such as computer-tomography, geophysical signal processing, high resolution imaging radars, and prediction filters, require high precision...

(Mathematics) (1996)

Joe Buhler

Approved for the Division

Note A Note on the Binomial Drop Polynomial of a Poset (1992)

Joe Buhler, Ron Graham

Suppose (P,-<) is a poset of size n and n: P- ~ P is a permutation. We say that n has a drop at x if n(x)~x. Let fie(k) denote the number of n having k drops, 0 < ~ k < n, and define the...