Related papers: An elementary proof for the decomposition theorem …

Although there are many simple proofs of Jordan's decomposition theorem in the literature (see [1], the references mentioned there, and [2]), our proof seems to be even more elementary. In fact, all we need is the theorem on the dimensions…

This work proposes a unified theory of regularity in one hypercomplex variable: the theory of $T$-regular functions. In the special case of quaternion-valued functions of one quaternionic variable, this unified theory comprises…

We prove a continued fraction expansion for a certain $q$-tangent function that was conjectured by the present writer, then proved by Fulmek, now in a completely elementary way.

One of the main open problems of mathematical physics is to consistently quantize Yang-Mills gauge theory. If such a consistent quantization were to exist, it is reasonable to expect a ``Wightman reconstruction theorem,'' by which a Hilbert…

The purpose of this paper is to study a generalization of strongly $\eta$-convex functions using the fractal calculus developed by Yang \cite{Yang}, namely generalized strongly $\eta$-convex function. Among other results, we obtain some…

By using a general formalism, we expose a simplified proof of the convergence of the B\'ezier polynomials attached to a continuous function defined in arbitrary dimensional simplex. We obtain an error estimate that contains the error in…

We give a short and self-contained proof of the Decomposition Theorem for the non-small resolution of a Special Schubert variety. We also provide an explicit description of the perverse cohomology sheaves. As a by-product of our approach,…

In 1957, Chandler Davis proved that unitarily invariant convex functions on the space of hermitian matrices are precisely those which are convex and symmetrically invariant on the set of diagonal matrices. We give a simple perturbation…

We establish a novel characterisation of the law of the convex minorant of any L\'evy process. Our self-contained elementary proof is based on the analysis of piecewise linear convex functions and requires only very basic properties of…

In this article, we prove a decomposition theorem on differential polynomials of theta functions of high level.

The main goal of the paper is to prove the sandwich theorem for geodesic convex functions in a complete Riemannian manifold. Then by using this theorem we have proved an inequality in a manifold with bounded sectional curvature. Finally, we…

We give yet another proof of the Riemann hypothesis for smooth projective varieties over a finite field (Deligne's theorem), by reducing to the hypersurface case. The latter was established by N. Katz via an elementary argument. A reduction…

This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…

We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…

We introduce a new and extensive theory of noncommutative convexity along with a corresponding theory of noncommutative functions. We establish noncommutative analogues of the fundamental results from classical convexity theory, and apply…

The classical theory of regularity of embeddings of compact convex sets was developed in the 1970s, exclusively in the real case, and even there it does not appear to have been stated in its simplest form. We begin by revisiting this…

The statement of the Riemann hypothesis makes sense for all global fields, not just the rational numbers. For function fields, it has a natural restatement in terms of the associated curve. Weil's work on the Riemann hypothesis for curves…

Robertson and Seymour proved two fundamental theorems about tangles in graphs: the tree-of-tangles theorem, which says that every graph has a tree-decomposition such that distinguishable tangles live in different nodes of the tree, and the…

In 1857 Sylvester established an elegant theory that certain counting functions (which he termed denumerants) are quasi-polynomials by decomposing them into periodic and non-periodic parts. Each component of the decomposition, called a…

We give a motivated introduction to the theory of perverse sheaves, culminating in the Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber. A goal of this survey is to show how the theory develops naturally from classical…