𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A cuspidal class number formula for the modular curvesX1(N)

✍ Scribed by Jing Yu

Book ID
105189378
Publisher
Springer
Year
1980
Tongue
English
Weight
843 KB
Volume
252
Category
Article
ISSN
0025-5831

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Cuspidal Class Number Formula for th
The Cuspidal Class Number Formula for the Modular CurvesX0(M) withMSquare-Free
✍ Toshikazu Takagi πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 413 KB

CUSPIDAL CLASS NUMBER FORMULA 181 the group ring. In Section 3, we prove that all modular units on the Ε½ . modular curve X M can be written as products of the functions h and 0 rational numbers. In Section 4, we determine a necessary and sufficient condition under which a product of the functions h

Determinantal Formula for the Cuspidal C
Determinantal Formula for the Cuspidal Class Number of the Modular CurveX1(m)
✍ Fumio Hazama πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 313 KB

An integer matrix whose determinant computes the cuspidal class number of the modular curve X 1 (m) is obtained. When m is an odd prime, this will provide us with an upper bound of the class number.

An alternative formula for the number of
An alternative formula for the number of Euler trails for a class of digraphs
✍ N. Macris; J.V. PulΓ© πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 250 KB

We derive an alternative formula for the number of Euler trails on strongly connected directed pseudographs whose every vertex has outdegree and indegree both equal to two in terms of an intersection matrix.

On a formula for the number of Euler tra
On a formula for the number of Euler trails for a class of digraphs
✍ J Lauri πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 240 KB

In this note we give an elementary combinatorial proof of a formula of Macris and Pul6 for the number of Euler trails in a digraph all of whose vertices have in-degree and out-degree equal to2.