English
Related papers

Related papers: A visual and simple proof for the Picard Little Th…

200 papers

We give a simple proof of the Baillon-Haddad theorem for convex functions defined on open and convex subsets of Hilbert spaces. We also state some generalizations and limitations. In particular, we discuss equivalent characterizations of…

Functional Analysis · Mathematics 2022-04-04 Daniel Wachsmuth , Gerd Wachsmuth

We consider a generalization of the classic Sperner lemma. This lemma states that every Sperner coloring of a triangulation of a simplex contains a fully colored simplex. We found a weaker assumption than Sperner's coloring. It is also…

Combinatorics · Mathematics 2014-05-30 Oleg R Musin

This paper studies how spatial thinking interacts with simplicity in [informal] proof, by analysing a set of example proofs mainly concerned with Ferrers diagrams (visual representations of partitions of integers, and comparing them to…

History and Overview · Mathematics 2018-03-02 Alan J. Cain

We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…

Commutative Algebra · Mathematics 2016-11-09 Davide Alberelli

On a real ($\mathbb F=\mathbb R$) or complex ($\mathbb F=\mathbb C$) analytic connected 2-manifold $M$ with empty boundary consider two vector fields $X,Y$. We say that $Y$ {\it tracks} $X$ if $[Y,X]=fX$ for some continuous function…

Dynamical Systems · Mathematics 2016-06-28 Morris W. Hirsch , F. -J. Turiel

We prove sharp Landau- and Schottky-type theorems for analytic functions which omit the $n$-th roots of unity. The proofs are based on a sharp lower bound for the Poincar\'e metric of the complex plane punctured at the roots of unity.

Complex Variables · Mathematics 2014-05-05 Daniela Kraus , Oliver Roth

In this paper we develop in detail the geometric constructions that lead to many uniqueness results for the determination of polyhedral sets, typically scatterers, by a finite minimal number of measurements. We highlight how unique…

Analysis of PDEs · Mathematics 2023-10-10 Luca Rondi

The already proved Lum-Chua's conjecture says that a continuous planar piecewise linear differential system with two zones separated by a straight line has at most one limit cycle. In this paper, we provide a new proof by using a novel…

Dynamical Systems · Mathematics 2021-01-21 Victoriano Carmona , Fernando Fernández-Sánchez , Douglas D. Novaes

We use reduction maps to study the minimal model program. Our main result is that the existence of a good minimal model for a klt pair $(X,\Delta)$ can be detected on the base of the $(K_{X}+\Delta)$-trivial reduction map. Thus we show that…

Algebraic Geometry · Mathematics 2019-02-20 Yoshinori Gongyo , Brian Lehmann

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

A theorem of Picard's type is proved for entire holomorphic mappings into complex projective varieties. This theorem has local character in the sense that the existence of Julia directions can be proved under a natural additional…

Complex Variables · Mathematics 2025-07-30 Alexandre Eremenko

Consider a rational map from a projective space to a product of projective spaces, induced by a collection of linear projections. Motivated by the the theory of limit linear series and Abel-Jacobi maps, we study the basic properties of the…

Algebraic Geometry · Mathematics 2013-11-01 Binglin Li

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

Combinatorics · Mathematics 2019-09-16 Greg Kuperberg , Shachar Lovett , Ron Peled

Let K be any compact set in the complex plane that has a connected complement, let A(K) be the uniforn algebra of all continuous complex functions on K that are holomorphic on the interior of K, let bK be the topological boundary of K, let…

Complex Variables · Mathematics 2015-06-29 John M. Bachar

Lyapunov's theorem is a classical result in convex analysis, concerning the convexity of the range of nonatomic measures. Given a family of integrable vector functions on a compact set, this theorem allows to prove the equivalence between…

Functional Analysis · Mathematics 2018-05-15 Marco Mazzola , Khai T. Nguyen

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

Functional Analysis · Mathematics 2014-03-14 Ibrahim Karahan , Murat Ozdemir

Analytic perturbation theory for matrices and operators is an immensely useful mathematical technique. Most elementary introductions to this method have their background in the physics literature, and quantum mechanics in particular. In…

Spectral Theory · Mathematics 2022-04-26 Bassam Bamieh

The goal of this paper is to formalize the notion of The Compositional Integral in The Complex Plane. We prove a convergence theorem guaranteeing its existence. We prove an analogue of Cauchy's Integral Theorem--and suggest an approach at…

General Mathematics · Mathematics 2020-11-03 James David Nixon

The classical Theorem of Mumford states that a topologically regular complex algebraic surface in $\mathbb{C}^3$ with an isolated singular point is smooth. We proof that any Lipschitz regular complex algebraic set is smooth. No restriction…

Algebraic Geometry · Mathematics 2014-05-08 Lev Birbrair , Alexandre Fernandes , Edson Sampaio , Lê D. Trang

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

Computational Complexity · Computer Science 2018-01-19 John M. Hitchcock , Hadi Shafei