Related papers: The Ambiguous Class Number Formula Revisited
In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones
In this note, we prove a quantization formula for singular reductions. The main result is obtained as a simple application of an extended quantization formula proved in [TZ2].
We investigate the large values of class numbers of cubic fields, showing that one can find arbitrary long sequences of "close" abelian cubic number fields with class numbers as large as possible. We also give a first step toward an…
A very short proof of the Fej\'er-Riesz lemma is presented in the matrix case
The paper contains an alternative proof of M. Kontsevich Formality Theorem.
We present an elementary proof for Ljunggren equation
We present a new alternating convolution formula for the super Catalan numbers which arises as a generalization of two known binomial identities. We prove a generalization of this formula by using auxiliary sums, recurrence relations, and…
In this note we give a detailed proof of a theorem of Aubin.
We give a formula for the class number of an arbitrary CM algebraic torus over $\mathbb{Q}$. This is proved based on results of Ono and Shyr. As applications, we give formulas for numbers of polarized CM abelian varieties, of connected…
We study the explicit formula of Euler numbers and polynomials of higher order
We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…
Inspired by computer assisted proofs in analysis, we present an interval approach to real-number computations.
We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.
We provide a proof of a variant of the Landau-Siegel Zeros conjecture.
We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.
Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…
This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize a strong bisimulation between the two…
We prove an infinite family of lacunary recurrences for the Lucas numbers using combinatorial means.
We give a simple reformulation of the four color theorem as a problem on strings over a four letter alphabet.
In this note we shall give a new proof to a quadrature formulae due to Newton.