English
Related papers

Related papers: Gauss-Lucas Theorems for Entire Functions on CM

200 papers

We study multivariate entire functions and polynomials with non-negative coefficients. A class of {\bf Strongly Log-Concave} entire functions, generalizing {\it Minkowski} volume polynomials, is introduced: an entire function $f$ in $m$…

Combinatorics · Mathematics 2009-05-14 Leonid Gurvits

In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…

Complex Variables · Mathematics 2020-01-14 Trevor J. Richards

We show how to solve explicitly an equation satisfied by a real function belonging to certain general quasianalytic classes. Examples of the classes under consideration are the collection of convergent generalised power series, a class of…

Algebraic Geometry · Mathematics 2014-05-13 Tamara Servi

We obtain sharp estimates for a generalized Zalcman coefficient functional with a complex parameter for the Hurwitz class and the Noshiro-Warschawski class of univalent functions as well as for the closed convex hulls of the convex and…

Complex Variables · Mathematics 2018-10-31 Iason Efraimidis , Dragan Vukotić

A novel recurrence formula for moments with respect to M\"{u}ntz-Legendre polynomials is proposed and applied to construct a numerical method for solving generalized Gauss quadratures with power function weight for M\"{u}ntz systems. These…

Numerical Analysis · Mathematics 2023-10-23 Huaijin Wang , Chuanju Xu

Polynomial sequence ${P_m}_{m\geq0}$ is $q$-logarithmically concave if $P_{m}^2-P_{m+1}P_{m-1}$ is a polynomial with nonnegative coefficients for any $m\geq{1}$. We introduce an analogue of this notion for formal power series whose…

Classical Analysis and ODEs · Mathematics 2012-11-15 S. I. Kalmykov , D. B. Karp

We establish generalized Gaussian bounds and local limit theorems with Gaussian-type error for the convolution powers of certain complex-valued functions on $\mathbb{Z}^d$. These global space-times estimates/error, which are sharp in…

Classical Analysis and ODEs · Mathematics 2026-02-17 Pedro H. Alves , Evan Randles

The paper is devoted to a comprehensive second-order study of a remarkable class of convex extended-real-valued functions that is highly important in many aspects of nonlinear and variational analysis, specifically those related to…

Optimization and Control · Mathematics 2015-07-21 Boris S. Mordukhovich , M. Ebrahim Sarabi

We study the set of continuous functions that admit no spurious local optima (i.e. local minima that are not global minima) which we term \textit{global functions}. They satisfy various powerful properties for analyzing nonconvex and…

Optimization and Control · Mathematics 2025-02-17 Cedric Josz , Yi Ouyang , Richard Y. Zhang , Javad Lavaei , Somayeh Sojoudi

Previously, we developed the technique of balayage of measures or charges and ($\delta$-)subharmonic functions of finite order onto an closed system of rays $S$ with a vertex at zero on the complex plane $\mathbb C$. In this article, we use…

Complex Variables · Mathematics 2020-05-13 B. N. Khabibullin , A. E. Salimova

It is established that general s-convex functions are a new class of generalized convex functions. In a similar vein, a new class of general s-convex sets is introduced, which are generalizations of s-convex sets. Additionally, certain…

Optimization and Control · Mathematics 2023-01-03 Musavvir Ali , Ehtesham Akhter

We prove three sharp estimates for the generalized Zalcman coefficient functional: one for the Hurwitz class, another for the Noshiro-Warschawski class, and yet another for the functions in the closed convex hull of convex univalent…

Complex Variables · Mathematics 2014-03-21 Iason Efraimidis , Dragan Vukotić

We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…

Logic in Computer Science · Computer Science 2015-02-10 Zoltán Ésik , Panos Rondogiannis

In this work, using a new geometrical approach we study to the existence of the fixed-point of mappings that independence of the smoothness, and also of their single-values or multi-values. This work proved the theorems that generalize in…

Analysis of PDEs · Mathematics 2022-03-22 Kamal N. Soltanov

Let $U\subseteq\mathbb{R}^{n}$ be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function $f:U\to\mathbb{R}$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we…

Functional Analysis · Mathematics 2012-01-17 D. Azagra

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…

Classical Analysis and ODEs · Mathematics 2015-10-09 Bruce Blackadar

This study focuses on convex functions and their generalized. Thus, we start this study by giving the definition of convex functions and some of their properties and discussing a simple geometric property. Then we generalize E-convex…

Classical Analysis and ODEs · Mathematics 2017-04-27 Adem Kilicman , Wedad Saleh

Absolute continuity implies uniform continuity, but generally not vice versa. In this short note, we present one sufficient condition for a uniformly continuous function to be absolutely continuous, which is the following theorem: For a…

Classical Analysis and ODEs · Mathematics 2015-03-17 Kai Yang , Chenhong Zhu

A method of proving local continuity of concave functions on convex set possessing the $\mu$-compactness property is presented. This method is based on a special approximation of these functions. The class of $\mu$-compact sets can be…

Functional Analysis · Mathematics 2010-06-22 M. E. Shirokov

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…

Logic in Computer Science · Computer Science 2010-10-15 Marie Ferbus-Zanda , Serge Grigorieff