Related papers: An elementary proof for the decomposition theorem …

This expository paper is based on the author's series of lectures delivered at the January 1999 Mini-course in Number Theory, held at Sogang University (Seoul). The aim is to give an elementary and self-contained introduction to the theory…

The aim of this article is to establish new two-functions minimax inequalities extending classical results such as Simons' minimax theorem. Our results will be proved in a non-compact setting. We also prove, under general conditions, that…

The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…

We generalize the logarithmic decomposition theorem of Deligne-Illusie to a filtered version. There are two applications. The easier one provides a mod $p$ proof for a vanishing theorem in characteristic zero. The deeper one gives rise to a…

In this article we will introduce a central problem in additive combinatorics, which arised from the famous van der Waerden theorem and an early conjecture of Erd\H{o}s and Tur\'{a}n. The first important theorem was due to Roth in 1953.…

This work is motivated by the search for an "explicit" proof of the Bloch-Kato conjecture in Galois cohomology, proved by Voevodsky. Our concern here is to lay the foundation for a theory that, we believe, will lead to such a proof- and to…

In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In…

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

In 1967, Schmidt wrote a seminal paper [10] on heights of subspaces of R n or C n defined over a number field K, and diophantine approximation problems. The going-down Theorem -- one of the main theorems he proved in his paper -- remains…

Ribet has proven remarkable results about non-optimal levels of residually reducible Galois representations. We focus on a non-optimal level $N$ that is the product of two distinct primes and where the Galois deformation ring is not…

By means of a new technique, we develop further a discrete subordination approach to the functional calculus of power bounded and Ritt operators initiated by N. Dungey in [19]. This allows us to show, in particular, that (infinite) convex…

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

We give a new proof the arithmetic Hilbert-Samuel theorem by using classical reductions in the theory of coherent sheaves, a direct proof in the case of the projective space and the conservation of some numerical invariants, called…

We introduce four new elementary short proofs of the famous K\"onig's theorem which characterizes bipartite graphs by absence of odd cycles.

It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…

The Four-Vertex Theorem has been of interest ever since a discrete version appeared in 1813 due to Cauchy. Up until now, there have been many different versions of this theorem, both for discrete cases and smooth cases. In 2004, an approach…

The reconstruction theorem deals with dynamical systems that are given by a map $T:X\to X$ of a compact metric space $X$ together with an observable $f:X \to \R$ from $X$ to the real line $\R$. In 1981, by use of Whitney's embedding…

If $R$ is a rational map, the Main Result is a uniformization Theorem for the space of decompositions of the iterates of $R$. Secondly, we show that Fatou conjecture holds for decomposable rational maps.

We give a short proof that every finite graph (or matroid) has a tree-decomposition that displays all maximal tangles. This theorem for graphs is a central result of the graph minors project of Robertson and Seymour and the extension to…

Inspired by the work of Wang and Zhou [4] for Rota-Baxter algebras, we develop a cohomology theory of Rota-Baxter systems and justify it by interpreting the lower degree cohomology groups as formal deformations and as abelian extensions of…