中文
相关论文

相关论文: On the length of lemniscates

200 篇论文

Let p(z) be a monic polynomial of degree n. Consider the lemniscate L={z:|p(z)|=1}. It has been conjectured that L has the largest length when p(z)=z^n-1. We show that the length of L attains a local maximum at this polynomial and prove the…

经典分析与常微分方程 · 数学 2008-08-07 Alexander Fryntov , Fedor Nazarov

Let $n \geq 1$, and let $p : {\bf C} \to {\bf C}$ be a monic polynomial of degree $n$. It was conjectured by Erd\H{o}s, Herzog, and Piranian that the maximal length of lemniscate $\{z \in {\bf C}: |p(z)| = 1\}$ is attained by the polynomial…

复变函数 · 数学 2025-12-23 Terence Tao

A polynomial lemniscate is a curve in the complex plane defined by $\{z \in \mathbb{C}:|p(z)|=t\}$. Erd\"os, Herzog, and Piranian posed the extremal problem of determining the maximum length of a lemniscate $\Lambda=\{ z \in…

概率论 · 数学 2017-11-15 Erik Lundberg , Koushik Ramachandran

We prove that for every $0 < c < 4$ and every $N \in \mathbb{N}$ there exists a monic polynomial $p(z) = z^n + a_{n-1} z^{n-1} + \dots + a_0$ such that the set $\{z \in \mathbb{C} : |p(z)| \leq 1\}$ has at least $N$ connected components…

复变函数 · 数学 2025-09-17 Linhang Huang

The second author proved that the set of post-critically finite polynomials of given degree is a set of bounded height, up to change of variables. Motivated by an observation about unicritical polynomials, we complement this by proving that…

数论 · 数学 2022-10-27 Benjamin Fraser , Patrick Ingram

We consider a family of heights defined by the $L_p$ norms of polynomials with respect to the equilibrium measure of a lemniscate for $0 \le p \le \infty$, where $p=0$ corresponds to the geometric mean (the generalized Mahler measure) and…

数论 · 数学 2021-01-19 Igor Pritsker

We prove that lemniscates (i.e., sets of the form $|P(z)|=1$ where $P$ is a complex polynomial) are irreducible real algebraic curves.

代数几何 · 数学 2024-12-03 S. Yu. Orevkov

A lemniscate of a complex polynomial $Q_n$ of degree $n$ is a sublevel set of its modulus, i.e., of the form $\{z \in \mathbb{C}: |Q_n(z)| < t\}$ for some $t>0.$ In general, the number of connected components of this lemniscate can vary…

概率论 · 数学 2023-06-21 Subhajit Ghosh

We obtain a more precise version of an asymptotic formula of A. Dubickas for the number of monic Eisenstein polynomials of fixed degree $d$ and of height at most $H$, as $H\to \infty$. In particular, we give an explicit bound for the error…

数论 · 数学 2017-07-12 Randell Heyman , Igor E. Shparlinski

We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy…

数论 · 数学 2011-02-15 Patrick Ingram

We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…

复变函数 · 数学 2020-07-16 L. Pardo-Simón , D. J. Sixsmith

We study root separation of reducible monic integer polynomials of odd degree. Let h(P) be the naive height, sep(P) the minimal distance between two distinct roots of an integer polynomial P(x) and sep(P)=h(P)^{-e(P)}. Let…

数论 · 数学 2017-09-19 Andrej Dujella , Tomislav Pejkovic

The descriptions (up to isomorphism) of naturally graded $p$-filiform Leibniz algebras and $p$-filiform ($p\leq 3$) Leibniz algebras of maximum length are known. In this paper we study the gradation of maximum length for $p$-filiform…

环与代数 · 数学 2013-11-22 L. M. Camacho , E. M. Canete , J. R. Gomez , B. A. Omirov

To each generic complex polynomial $p(z)$ there is associated a labeled binary tree (here referred to as a "lemniscate tree") that encodes the topological type of the graph of $|p(z)|$. The branching structure of the lemniscate tree is…

概率论 · 数学 2018-06-05 Michael Epstein , Boris Hanin , Erik Lundberg

Let $K\subset\mathbb{C}$ be a compact set in the plane whose logarithmic capacity $c(K)$ is strictly positive. Let $\mathscr{P}_n(K)$ be the space of monic polynomials of degree $n,$ \emph{all} of whose zeros lie in $K.$ For $p\in…

复变函数 · 数学 2023-12-22 Subhajit Ghosh , Koushik Ramachandran

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

组合数学 · 数学 2016-06-07 Jesse Geneson

Consider a logharmonic polynomial; that is, a product of the form $p(z)\overline{q(z)}$, where $p$, $q$ are holomorphic polynomials. Assume $q$ is linear and denote by $n$ the degree of $p$. It was recently shown in arXiv:2302.04339…

复变函数 · 数学 2025-08-15 Kirill Lazebnik , Erik Lundberg

We consider families of polynomial lemniscates in the complex plane and determine if they bound a Jordan domain. This allows us to find examples of regions for which we can calculate the projection of $\bar{z}$ to the Bergman space of the…

复变函数 · 数学 2024-10-03 Adam Kraus , Brian Simanek

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

数论 · 数学 2022-10-04 Artūras Dubickas , Min Sha

We initiate a classification of complex polynomials f of degree d having the top Betti number of the general fibre close to the maximum. We find a range in which the polynomial must have isolated singularities and another range where it may…

代数几何 · 数学 2011-09-01 Dirk Siersma , Mihai Tibar
‹ 上一页 1 2 3 10 下一页 ›