相关论文: Amplitude maximization in stable systems, Schur po…

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

Let either $R_k(t) := |P_k(e^{it})|^2$ or $R_k(t) := |Q_k(e^{it})|^2$, where $P_k$ and $Q_k$ are the usual Rudin-Shapiro polynomials of degree $n-1$ with $n=2^k$. In a recent paper we combined close to sharp upper bounds for the modulus of…

In this note we investigate the asymptotic behavior of the number of maximum modulus points, of an entire function, sitting in a disc of radius $r$. In 1964, Erd\Humlaut{o}s asked whether there exists a non-monomial function so that this…

In large-data applications, it is desirable to design algorithms with a high degree of parallelization. In the context of submodular optimization, adaptive complexity has become a widely-used measure of an algorithm's "sequentiality".…

The well-known Hermite-Biehler theorem claims that a univariate monic polynomial s of degree k has all roots in the open upper half-plane if and only if s=p+iq where p and q are real polynomials of degree k and k-1 resp. with all real,…

Motivated by relativistic materials, we develop a numerical scheme to support existing or state new conjectures in the spectral optimisation of eigenvalues of the Dirac operator, subject to infinite-mass boundary conditions. We study the…

Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…

We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…

In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…

Submodular maximization generalizes many fundamental problems in discrete optimization, including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility location and marketing over social networks. In this paper we…

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

We study the regularity of the roots of complex univariate polynomials whose coefficients depend smoothly on parameters. We show that any continuous choice of the roots of a $C^{n-1,1}$-curve of monic polynomials of degree $n$ is locally…

This paper is devoted to the investigation of multidimensional analogues of refined Bohr-type inequalities for bounded holomorphic mappings on the unit polydisc $\mathbb{D}^n$. We establish a sharp extension of the classical Bohr…

We study extreme values of Dirichlet polynomials with multiplicative coefficients, namely \[D_N(t) : = D_{f,\, N}(t)= \frac{1}{\sqrt{N}} \sum_{n\leqslant N} f(n) n^{it}, \] where $f$ is a completely multiplicative function with $|f(n)|=1$…

The presented analysis determines several new bounds on the roots of the equation $a_n x^n + a_{n-1} x^{n-1} + \cdots + a_0 = 0$ (with $a_n > 0$). All proposed new bounds are lower than the Cauchy bound max$\{1, \sum_{j=0}^{n-1} |a_j/a_n|…

We prove algorithmic and hardness results for the problem of finding the largest set of a fixed diameter in the Euclidean space. In particular, we prove that if $A^*$ is the largest subset of diameter $r$ of $n$ points in the Euclidean…

We consider constellations of disks which are unions of disjoint hyperbolic disks in the unit disk with fixed radii and unfixed centers. We study the problem of maximizing the conformal capacity of a constellation with a fixed number of…

This paper solves the open problem on the sharp bound for the number of isolated solutions in $\mathbf{R}_*^n$ to the real system of $n$ polynomial equations in $n$ variables, i.e., the real $n$ by $n$ fewnomial system. For an unmixed…