Related papers: The fundamental theorem of complex multiplication
This is an English translation of the monograph "Die Klassenk\"orper der komplexen Multiplikation" by Max Deuring, published in 1958 as Enzyklop\"adie der Mathematischen Wissenschaften, Band I-2, Heft 10, Teil II by B.G. Teuber…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…
The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…
The main purpose of this paper is to make Nakayama's theorem more accessible. We give a proof of Nakayama's theorem based on the negative definiteness of intersection matrices of exceptional curves. In this paper, we treat Nakayama's…
Section 10.4 of the 1998 Springer-Verlag book {\em Complexity and Real Computation}, by Blum, Cucker, Shub, and Smale, contains a particularly elegant proof of the Fundamental Theorem of Algebra: The central idea of the proof naturally…
The article on the upper central series of infinite groups by M. de Falco, F. de Giovanni, C. Musella and Y.P. Sysak, proceedings of the american mathematical society, Volume 139, Number 2, February 2011, 385--389 consists of a quite long…
The purpose of this note is to give an (esentially optimal) effective version of Matsusaka's Big theorem for smooth projective surfaces.
This paper presents an alternative proof of the Fundamental Theorem of Algebra that has several distinct advantages. The proof is based on simple ideas involving continuity and differentiation. Visual software demonstrations can be used to…
In this paper, we prove a result related to the deformation of complex submanifolds, modifying a result of Kodaira (Ann. Math, 75(1), 146-162, 1962).
In this paper motivated by the celebrated fundamental theorem of algebra and its standard proof utilizing Liouville's Theorem, we prove the fundamental theorem of algebra type results for both commutative and noncommutative polynomials in…
A new simple geometrical interpretation of complex numbers is presented. It differs from their usual interpretation as points in the complex plane. From the new point of view the complex numbers are rather operations on vectors than points.…
The purpose of this short note is to present a simplified proof of Serre's modularity conjecture using the strong modularity lifting results currently available. This second version includes extra details on definitions and proofs than the…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
The goal of the paper is an exposition of the simplest $(2+1)$-TQFTs in a sense following a pictorial approach. In the end, we fell short on details in the later sections where new results are stated and proofs are outlined. Comments are…
In this article, we prove a decomposition theorem on differential polynomials of theta functions of high level.
We prove a multiplication theorem for quantum cluster algebras of acyclic quivers. The theorem generalizes the multiplication formula for quantum cluster variables in \cite{fanqin}. We apply the formula to construct some $\mathbb{ZP}$-bases…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
We present an elementary proof of the fundamental theorem of algebra, following Cauchy's version but avoiding his use of circular functions. It is written in the same spirit as Littlewood's proof of 1941, but reduces it to more elementary…
In this note, we leverage some of our results from arXiv:1706.06319 to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case. Our main theorem recovers and…