Related papers: Sharp bounds for some segments of bounded power se…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

We provide sharp bounds for the exponential moments and $p$-moments, $1\leqslant p \leqslant 2$, of the terminate distribution of a martingale whose square function is uniformly bounded by one. We introduce a Bellman function for the…

In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quadratic polynomials. Specifically, we prove that if…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.

We show that, in every weighted Dirichlet space on the unit disk with superharmonic weight, the Taylor series of a function in the space is $(C,\alpha)$-summable to the function in the norm of the space, provided that $\alpha>1/2$. We…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

Polynomial series approximations are a central theme in approximation theory due to their utility in an abundance of numerical applications. The two types of series, which are featured most prominently, are Taylor series expansions and…

For any given natural number $k$, this paper gives upper bounds on the radius of a packing of a complete hyperbolic surface of finite area by $k$ equal-radius disks in terms of the surface's topology. We show that the bounds given here are…

We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.

We establish a sharp geometric constant for the upper bound on the resonance counting function for surfaces with hyperbolic ends. An arbitrary metric is allowed within some compact core, and the ends may be of hyperbolic planar, funnel, or…

The purpose of this letter is to investigate the time complexity consequences of the truncated Taylor series, known as Taylor Polynomials \cite{bakas2019taylor,Katsoprinakis2011,Nestoridis2011}. In particular, it is demonstrated that the…

We study symmetric arithmetic circuits and improve on lower bounds given by Dawar and Wilsenach (ArXiv 2020). Their result showed an exponential lower bound of the permanent computed by symmetric circuits. We extend this result to show a…

In recent years some near-optimal estimates have been established for certain sum-product type estimates. This paper gives some first extremal results which provide information about when these bounds may or may not be tight. The main tool…

We study the sup-norm and mean-square-norm problems for Eisenstein series on certain arithmetic hyperbolic orbifolds, producing sharp exponents for the modular surface and Picard 3-fold. The methods involve bounds for Epstein zeta…

In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.

We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…

Explicit lower bounds for the length of the shortest opaque set for the unit disc and the unit square in the Euclidean plane are derived. The results are based on an explicit application of the general method of Kawamura, Moriyama, Otachi…

We find upper bounds, sharp in most cases, on the number of real hyperplane sections of real smooth polarized $K3$-surfaces that split into lines. Most bounds coincide with their complex counterparts.

We determine the Lagrange function in Taylor polynomial approximation by solving an appropriate initial-value problem. Hence, we determine the remainder term which we then approximate by means of a natural cubic spline. This results in a…