• 沒有找到結果。

COMPOSITIO MATHEMATICA

N/A
N/A
Protected

Academic year: 2022

Share "COMPOSITIO MATHEMATICA"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

COMPOSITIO MATHEMATICA Volume 122 No. 3, July 2000

T. N.Venkataramana: Abelianness of Mumford-Tate Groups Associated 223-242 to Some Unitary Groups

Paul Schmutz Schaller: Mapping Class Groups of Hyperbolic Surfaces 243-260 and Automorphism Groups of Graphs

Liang-Chung Hsia and Jing Yu: On Characteristic Polynomials of 261—280 Geometric Frobenius Associated to Drinfeld Modules

Robert L. Benedetto: />-Adic Dynamics and Sullivan's No Wandering 281—298 Domains Theorem

Matthew A. Papanikolas: Canonical Heights on Elliptic Curves in 299-313 Characteristic p

Kirti Joshi and Eugene Z. Xia: Moduli of Vector Bundles on Curves in 315—321 Positive Characteristics

(

Nobuhiro Honda: On Some Twistor Spaces Over 4CP 323-336 Pavlos Tzermias: Explicit Rational Functions on Fermat Curves and a 337-345

Theorem of Greenberg

Author Index 122 (2000) 347 Contents to Volume 122 (2000) 349-350

參考文獻

相關文件

ix Twisted Group Algebras Satisfying a Generalized

Lerner 243 The canonical-boundary representation for automorphism groups of locally compact countable state Markov shifts M.. Schraudner 253 Extensions of holomorphic

Recursion Formulas for Some Abelian Knot Invariants 413

In particular, if s = f(t) is the position function of a particle that moves along a straight line, then f ′(a) is the rate of change of the displacement s with respect to the

By using the new characterization, the following algorithmic results have been achieved: a linear time algorithm that solves the recognition problem, a linear time algorithm that

Wang and Lih proved the 4-choosability of planar graphs without 5-cycles, or without 6-cycles, or without intersecting 3-cycles in [10, 9, 11]5. Farzad [3] proved the 4-choosability

(with Huah Chu, Shou-Jen Hu and Boris E. Kunyavskii) Noether’s problem and the unramified Brauer group for groups of order 64, International Mathematics Research Notices 12

Rank, nullity, power, cycle, path, zero forcing number, path cover number.. ∗