相关论文: Extreme values of the derivative of Blaschke produ…

In this paper we study the area function of polygons, where the vertices are sliding along curves. We give geometric criteria for the critical points and determine also the Hesse matrix at those points. This is the starting point for a…

We study a broad class of polynomial optimization problems whose constraints and objective functions exhibit sparsity patterns. We give two characterizations of the number of critical points to these problems, one as a mixed volume and one…

We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. The construction involves an iteration procedure on an infinite-dimensional…

It is well known that the bounding curve of the central hyperbolic component of the Multibrot set in the parameter space of unicritical degree $d$ polynomials is an epicycloid with $d-1$ cusps. The interior of the epicycloid gives the…

Given an homogeneous polynomial on a Banach space $E$ belonging to some maximal or minimal polynomial ideal, we consider its iterated extension to an ultrapower of $E$ and prove that this extension remains in the ideal and has the same…

Under general multivariate regular variation conditions, the extreme Value-at-Risk of a portfolio can be expressed as an integral of a known kernel with respect to a generally unknown spectral measure supported on the unit simplex. The…

We present a survey of central developments in the theory of Chebyshev polynomials, introduced by P.~L.~Chebyshev and later extended to the complex plane by G.~Faber. Our primary focus is their defining extremal property: among all…

We give a constructive and flexible proof of a result of P. Gorkin and R. Mortini concerning a special finite interpolation problem on the unit circle with interpolating Blaschke products. Our proof also shows that the result can be…

Let $B$ be a Blaschke product with zeros $\{a_n\}$. If $B' \in A^p_{\alpha}$ for certain $p$ and $\alpha$, it is shown that $\sum_n (1 - |a_n|)^{\beta} < \infty$ for appropriate values of $\beta$. Also, if $\{a_n\}$ is uniformly discrete…

This paper develops a theory of Lipschitz comparisons of hyperbolic surfaces analogous to the theory of quasi-conformal comparisons. Extremal Lipschitz maps (minimal stretch maps) and geodesics for the `Lipschitz metric' are constructed.…

Dynamical systems of a new kind are described, which are motivated by the problem of constructing diffeomorphism invariant quantum theories. These are based on the extremization of a non-local and non-additive quantity that we call the…

We study the supremum of some random Dirichlet polynomials and obtain sharp upper and lower bounds for supremum expectation that extend the optimal estimate of Hal\'asz-Queff\'elec and enable to cunstruct random polynomials with unusually…

This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…

We obtain an optimal deviation from the mean upper bound \begin{equation} D(x)\=\sup_{f\in \F}\mu\{f-\E_{\mu} f\geq x\},\qquad\ \text{for}\ x\in\R\label{abstr} \end{equation} where $\F$ is the class of the integrable, Lipschitz functions on…

We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…

In approximation theory, logarithmic derivatives of complex polynomials are called simple partial fractions (SPF) as suggested by Eu.P. Dolzhenko. Many solved and unsolved extremal problems related to SPF are traced back to works of G.…

Algorithmic fractal dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions…

Let k be a field. A finite dimensional k-algebra is said to be minimal representation-infinite provided it is representation-infinite and all its proper factor algebras are representation-finite. Our aim is to classify the special biserial…

Graph density profiles are fundamental objects in extremal combinatorics. Very few profiles are fully known, and all are two-dimensional. We show that even in high dimensions ratios of graph densities and numbers often form the power-sum…

We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of $K_n\times G$ is found, provided that $G$…