相关论文: The fundamental theorem of complex multiplication

The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…

Some elementary rigorous remark about the replica formalism in the Statistical Physics' approach to threshold phenomena in Computational Complexity Theory is presented.

The main theorem here is the K-theoretic analogue of the cohomological `stable double component formula' for quiver functions in [Knutson, Miller, and Shimozono, math.AG/0308142]. This K-theoretic version is still in terms of lacing…

In this note we prove analogues of the main theorems of complex multiplication for abelian varieties for K3 surfaces. This is done by studying the field of definition of the period morphism for complex K3 surfaces. More precisely we relate…

This note presents an especially short and direct variant of Hermite's proof of the simple continued fraction expansion e = [2,1,2,1,1,4,1,1,6,...] and explains some of the motivation behind it.

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

The purpose of this paper is to extend some useful results, such as the multiplication being open, previously known for suitable finitely generated relatively free profinite semigroups, to relatively free profinite semigroupoids over…

In the proposed matrix primes, through which one can readily generate a sequence of primes. The paper also proposes a number of theorems proved by which an infinite number of prime numbers twins

Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…

A recently proposed integral representation for permanents is rederived using only elementary combinatorics. For this proof the assumption that the matrix, for which the permanent is calculated, has an inverse is not necessary.

Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…

We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…

This is an expository paper designed to introduce undergraduates to the Atiyah-Singer index theorem 50 years after its announcement. It includes motivation, a statement of the theorem, an outline of the easy part of the heat equation proof.…

To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…

The Recognition Theorem for graded Lie algebras is an essential ingredient in the classification of finite-dimensional simple Lie algebras over an algebraically closed field of characteristic p > 3. The main goal of this monograph is to…

This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…

In this short note, we give a localized version of the basic triangle theorem, first published in 2011 (see [4]) in order to prove the independence of hyperlogarithms over various function fields. This version provides direct access to…

This is a technical report, containing all the theorem proofs and additional evaluations in paper "Monitor Placement for Maximal Identifiability in Network Tomography" by Liang Ma, Ting He, Kin K. Leung, Ananthram Swami, Don Towsley,…

In this note, simple proofs of certain well-known results involving the positive square root of positive matrices are given.

We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.