一类(p_1,p_2)一图的自同构群

在本文中,作者运用Stellmacher先生改进了的Amalgam方法(见[2]),推广了Goldschmidt在[1]中的工作。     

“关灯”游戏中的代数学

研究的是来自互联网上的一个有趣的数学游戏,运用数学建模的方法给出了其基于有限域上的线性方程组的数学模型,对n=5的情形给出了所有解.并进一步,运用代数学的“分类”方法给出了游戏的四个等价类的直观描述,使游戏者不用解方程组就能立即判断出该“残局”能够变为哪个类型.     

On Browkin''''s conjecture about the elements of order five in K_2(Q)

Based on the work of Lenstra, a succinct proof of Browkin's conjecture about the elements of order five in K2(Q) is given.     

On A(X) → TC(X) for some X

Let X be a connected based space and p be a two-regular prime number. If the fundamental group of X has order p, we compute the two-primary homotopy groups of the homotopy fiber of the trace map A(X) → TC(X) relating algebraic K-theory of spaces to topological cyclic homology. The proof uses a theorem of Dundas and an explicit calculation of the cyclotomic trace map K(ℤ[C_p])→ TC(ℤ[C_p]).     

Strong local homogeneity and coset spaces

We prove that for every homogeneous and strongly locally homogeneous separable metrizable space there is a metrizable compactification of such that, among other things, for all there is a homeomorphism such that . This implies that is a coset space of some separable metrizable topological group .

     

Resultants and discriminants of Chebyshev and related polynomials

We show that the resultants with respect to of certain linear forms in Chebyshev polynomials with argument are again linear forms in Chebyshev polynomials. Their coefficients and arguments are certain rational functions of the coefficients of the original forms. We apply this to establish several related results involving resultants and discriminants of polynomials, including certain self-reciprocal quadrinomials.

     

On a Criterion for Catalan's Conjecture

We give a new proof of a theorem of P. Mihailescu which states that the equation x ^p – y ^q = 1 is unsolvable with x, y integral and p, q odd primes, unless the congruences p ^q p (mod q ²) and q ^p q (mod p ²) hold.     

First-hit analysis of algorithms for computing quadratic irregularity

The author has previously extended the theory of regular and irregular primes to the setting of arbitrary totally real number fields. It has been conjectured that the Bernoulli numbers, or alternatively the values of the Riemann zeta function at odd negative integers, are uniformly distributed modulo for every . This is the basis of a well-known heuristic, given by Siegel, estimating the frequency of irregular primes. So far, analyses have shown that if is a real quadratic field, then the values of the zeta function at negative odd integers are also distributed as expected modulo for any . We use this heuristic to predict the computational time required to find quadratic analogues of irregular primes with a given order of magnitude. We also discuss alternative ways of collecting large amounts of data to test the heuristic.

     

Existence of (q, 7, 1) difference families with q a prime power

The existence of a (q,k, 1) difference family in GF(q) has been completely solved for k = 3,4,5,6. For k = 7 only partial results have been given. In this article, we continue the investigation and use Weil's theorem on character sums to show that the necessary condition for the existence of a (q,7,1) difference family in GF(q), i.e. q ≡ 1; (mod 42) is also sufficient except for q = 43 and possibly except for q = 127, q = 211, q = 31⁶ and primes q∈ [261239791, 1.236597 × 10¹³] such that in GF(q). © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 126–138, 2002; DOI 10.1002/jcd.998     

Comparison of algorithms to calculate quadratic irregularity of prime numbers

In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields , using the values of the zeta function at negative integers as our ``higher Bernoulli numbers'. In the case where is a real quadratic field, Siegel presented two formulas for calculating these zeta-values: one using entirely elementary methods and one which is derived from the theory of modular forms. (The author would like to thank Henri Cohen for suggesting an analysis of the second formula.) We briefly discuss several algorithms based on these formulas and compare the running time involved in using them to determine the index of -irregularity (more generally, ``quadratic irregularity') of a prime number.