English
Related papers

Related papers: Note on the covering theorem for complex polynomia…

200 papers

In this note we extend a theorem from [13] about uniform circle random coverings

Probability · Mathematics 2025-01-28 D. Karagulyan

We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…

Classical Analysis and ODEs · Mathematics 2014-06-17 D. Babusci , G. Dattoli , K. Górska , K. A. Penson

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

Algebraic Geometry · Mathematics 2020-06-15 Miguel N. Walsh

The aim of this paper is to represent any polynomial in terms of the degenerate Frobenius-Euler polynomials and more generally of the higher-order degenerate Frobenius-Euler polynomials. We derive explicit formulas with the help of umbral…

Number Theory · Mathematics 2021-09-29 Taekyun Kim , Dae San Kim

We prove a version of van der Corput's Lemma for polynomials over the p-adic numbers.

Classical Analysis and ODEs · Mathematics 2007-05-23 Keith Rogers

D. Dimitrov has posed the problem of finding polynomials that set the sharpness of the Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal. We disprove Dimitrov's conjecture for polynomials of degree 3,…

Complex Variables · Mathematics 2019-04-26 Jimmy Dillies , Dmitriy Dmitrishin , Andrey Smorodin , Alex Stokolos

This note is a response to one of problems posed by A.K. Kwasniewski in one of his recent papers. Namely for the sequence of finite cobweb subposets, the looked for explicit formulas for corresponding sequence of characteristic polynomials…

Combinatorics · Mathematics 2008-02-21 Ewa Krot-Sieniawska

We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.

Commutative Algebra · Mathematics 2016-04-01 Edoardo Ballico , Michele Elia , Massimiliano Sala

In 2002 Dimitar Dimitrov posted the problem of finding the optimal polynomials that provide the sharpness of Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal ones. We disproved Dimitrov's conjecture…

Complex Variables · Mathematics 2018-08-28 Dmitriy Dmitrishin , Ivan Skrinnik , Andrey Smorodin , Alex Stokolos

In this paper we prove a recent conjecture formulated by Dmitrishin, Smorodin and Stokolos about that certain polynomials are univalent in the unit disk. As a consequence we get an upper estimate for the Koebe radius of univalent…

Complex Variables · Mathematics 2020-09-15 Ilgiz R. Kayumov , Diana M. Khammatova

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…

Complex Variables · Mathematics 2026-02-20 Olof Rubin

We introduce a general notion of covering property, of which many classical definitions are particular instances. Notions of closure under various sorts of convergence, or, more generally, under taking kinds of accumulation points, are…

General Topology · Mathematics 2022-06-28 Paolo Lipparini

We assign real numbers to finite sheeted coverings of compact CW complexes designed as finite counterparts to the Novikov-Shubin numbers. We prove an approximation theorem in the case of virtually cyclic fundamental groups employing methods…

Algebraic Topology · Mathematics 2017-01-27 Holger Kammeyer

In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.

Information Theory · Computer Science 2025-09-23 J. J. Bernal , J. J. Simón

We prove that any finite, abstract n-polytope is covered by a finite, abstract regular n-polytope.

Combinatorics · Mathematics 2012-09-07 B. Monson , Egon Schulte

We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…

Group Theory · Mathematics 2007-10-04 Seonhee Lim , Anne Thomas

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Complex Variables · Mathematics 2017-09-26 Simon St-Amant , Jérémie Turcotte

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

We prove large sieve inequalities with multivariate polynomial moduli and deduce a general Bombieri--Vinogradov type theorem for a class of polynomial moduli having a sufficient number of variables compared to its degree. This sharpens…

Number Theory · Mathematics 2021-10-27 Karin Halupczok , Marc Munsch

This essay summarizes the state of the art on some aspects of the dynamics of polynomial diffeomorphsms in complex dimension two, and it presents a number of open questions.

Dynamical Systems · Mathematics 2015-01-08 Eric Bedford