中文
相关论文

相关论文: On the length of lemniscates

200 篇论文

We define the \emph{curvilinear rank} of a degree $d$ form $P$ in $n+1$ variables as the minimum length of a curvilinear scheme, contained in the $d$-th Veronese embedding of $\mathbb{P}^n$, whose span contains the projective class of $P$.…

代数几何 · 数学 2015-07-07 Edoardo Ballico , Alessandra Bernardi

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

动力系统 · 数学 2007-05-23 Laura DeMarco

A rational lemniscate is a level set of $|r|$ where $r: \hat{\mathbb{C}} \rightarrow \hat{\mathbb{C}}$ is rational. We prove that any planar Euler graph can be approximated, in a strong sense, by a homeomorphic rational lemniscate. This…

复变函数 · 数学 2025-02-11 Christopher J. Bishop , Alexandre Eremenko , Kirill Lazebnik

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

动力系统 · 数学 2012-08-29 James T. Campbell , Jared T. Collins

By using a result from the numerical algebraic geometry package Bertini we show that (up to high numerical accuracy) a specific set of degree 6 and degree 9 polynomials cut out the secant variety $\sigma_{4}(\mathbb{P}^{2}\times \mathbb{P}…

代数几何 · 数学 2025-10-16 Daniel J. Bates , Luke Oeding

In this note, we give a criteria whether given two Eisenstein polynomials over a padic field define the same extension (Proposition 1.6). In particular, we completely identify Eisenstein polynomials of degree p (Theorem 1.16). This note is…

数论 · 数学 2013-02-06 Shun'ichi Yokoyama , Manabu Yoshida

The set ${\cal P}^{m\times n}_{r,d}$ of $m \times n$ complex matrix polynomials of grade $d$ and (normal) rank at most $r$ in a complex $(d+1)mn$ dimensional space is studied. For $r = 1, \dots , \min \{m, n\}-1$, we show that ${\cal…

数值分析 · 数学 2016-12-14 Andrii Dmytryshyn , Froilán M. Dopico

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

数论 · 数学 2021-11-18 Rainer Dietmann , Alina Ostafe , Igor E. Shparlinski

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

数论 · 数学 2015-01-14 Artūras Dubickas , Min Sha

Consider a Leibniz superalgebra $\mathfrak L$ additionally graded by an arbitrary set $I$ (set grading). We show that $\mathfrak L$ decomposes as the sum of well-described graded ideals plus (maybe) a suitable linear subspace. In the case…

The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice points in the $n$-th dilate of $P$ for all integers $n\geq 0$. The degree of $P$ is defined as the degree of its $h^\ast$-polynomial, a…

组合数学 · 数学 2024-09-24 Matthias Beck , Ellinor Janssen , Katharina Jochemko

A classically studied geometric property associated to a complex polynomial $p$ is the inradius (the radius of the largest inscribed disk) of its (filled) lemniscate $\Lambda := \{z \in \mathbb{C}:|p(z)| < 1\}$. In this paper, we study the…

概率论 · 数学 2023-02-01 Manjunath Krishnapur , Erik Lundberg , Koushik Ramachandran

The joint spectral radius of a bounded set of $d \times d$ real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn…

最优化与控制 · 数学 2017-05-24 Kevin G. Hare , Ian D. Morris , Nikita Sidorov

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

复变函数 · 数学 2008-01-16 John P. D'Angelo , Jiri Lebl , Han Peters

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

组合数学 · 数学 2021-11-02 Zhicheng Gao

Let $K$ be an algebraically closed field of characteristic zero and let $f \in K[x]$. The $m$-th {\it cyclic resultant} of $f$ is \[r_m = \text{Res}(f,x^m-1).\] A generic monic polynomial is determined by its full sequence of cyclic…

代数几何 · 数学 2007-05-23 Christopher J. Hillar , Lionel Levine

We generalize the recent work of S. Fomin and G. Mikhalkin on polynomial formulas for Severi degrees. The degree of the Severi variety of plane curves of degree d and delta nodes is given by a polynomial in d, provided delta is fixed and d…

代数几何 · 数学 2012-08-24 Florian Block

We give a short proof that the limsup of the p-th root of the modulus of the p-th moment of a sequence of complex numbers is equal to the modulus of the maximum of the sequence.This strengthens known results, and provides an analog to a…

复变函数 · 数学 2020-04-07 Greg Markowsky , Maher Boudabra

We prove that any analytic set in $\C^n$ with a unique tangent cone at infinity is an algebraic set. We prove that the degree of a complex algebraic set in $\C^n$, which is Lipschitz normally embedded at infinity, is equal to the degree of…

复变函数 · 数学 2022-01-21 L. R. G. Dias , N. R. Ribeiro

We study a family of polynomials in two variables having moduli up to bilipschitz equivalence: two distinct polynomials of this family are not bilipschitz equivalent. However any level curve of the first polynomial is bilipschitz equivalent…

几何拓扑 · 数学 2020-02-25 Arnaud Bodin