English
Related papers

Related papers: Convex hulls of polynomial Julia sets

200 papers

Let $(P, Q)$ be a pair of Jacobian polynomials. We can show that $ <P, Q>+l+2g(P)-2= 0= <P, [P,Q]>$, where $<f, g>$ is the intersection number of $f, g\in \CC[x, y]$ in the affine plane, $l$ is the number of branch at point at infinity and…

Algebraic Geometry · Mathematics 2013-09-16 Dosang Joe

Denote $\mathcal{A}$ as the set of all doubly substochastic $m \times n$ matrices and let $k$ be a positive integer. Let $\mathcal{A}_k$ be the set of all $1/k$-bounded doubly substochastic $m \times n$ matrices, i.e., $\mathcal{A}_k…

Combinatorics · Mathematics 2017-11-21 Lei Deng , Qiulin Lin

We study the possible Hausdorff limits of the Julia sets and filled Julia sets of subsequences of the sequence of dual Chebyshev polynomials of a non-polar compact set K in C and compare such limits to K. Moreover, we prove that the…

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

Complex Variables · Mathematics 2020-09-29 Purvi Gupta , Rasul Shafikov

The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…

Combinatorics · Mathematics 2021-11-01 Bo Chen , Chen Peng , Yueshan Xiong

Any planar shape $P\subset \mathbb{C}$ can be embedded isometrically as part of the boundary surface $S$ of a convex subset of $\mathbb{R}^3$ such that $\partial P$ supports the positive curvature of $S$. The complement $Q = S \setminus P$…

Dynamical Systems · Mathematics 2016-12-02 Laura DeMarco , Kathryn Lindsey

A cubic Galois polynomial is a cubic polynomial with rational coefficients that defines a cubic Galois field. Its discriminant is a full square and its roots $x_1,x_2,x_3$ (enumerated in some order) are real. There exists (and only one)…

Number Theory · Mathematics 2024-01-23 Yury Kochetkov

Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and for $q$ a power of $p$, the lemma says that any multilinear polynomial $P\in…

Computational Complexity · Computer Science 2023-06-22 Srikanth Srinivasan

Lasserre [La] proved that for every compact set $K\subset\mathbb R^n$ and every even number $d$ there exists a unique homogeneous polynomial $g_0$ of degree $d$ with $K\subset G_1(g_0)=\{x\in\mathbb R^n:g_0(x)\leq 1\}$ minimizing $|G_1(g)|$…

Functional Analysis · Mathematics 2021-07-26 David Alonso-Gutiérrez , Bernardo González Merino , Rafael Villa

If $p$ is an odd prime, then we prove that $\e(H_2(G,\mathbb{Z})) \mid p\ \e(G)$ for $p$ groups of class 7. We prove the same for $p$ groups of class at most $p+1$ with $\e(Z(G))=p$. We also prove Schurs conjecture if $\e(G/Z(G))$ is $2,3$…

Group Theory · Mathematics 2020-06-30 A. E. Antony , V. Z. Thomas

In this paper, we characterize the closures of convex hulls of unitary orbits of self-adjoint operators in unital, separable, simple C$^*$-algebras with non-trivial tracial simplex, real rank zero, stable rank one, and strict comparison of…

Operator Algebras · Mathematics 2019-02-08 Ping Wong Ng , Paul Skoufranis

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

Computational Complexity · Computer Science 2014-05-14 Pascal Koiran , Natacha Portier , Sébastien Tavenas , Stéphan Thomassé

For a planar point set $P$, its convex hull is the smallest convex polygon that encloses all points in $P$. The construction of the convex hull from an array $I_P$ containing $P$ is a fundamental problem in computational geometry. By…

Computational Geometry · Computer Science 2025-06-30 Ivor van der Hoog , Eva Rotenberg , Daniel Rutschmann

We consider extremal polynomials with respect to a Sobolev-type $p$-norm, with $1<p<\infty$ and measures supported on compact subsets of the real line. For a wide class of such extremal polynomials with respect to mutually singular measures…

Classical Analysis and ODEs · Mathematics 2017-10-10 A. Diaz Gonzalez , G. Lopez Lagomasino , H. Pijeira Cabrera

The Hardy--Littlewood inequality for complex homogeneous polynomials asserts that given positive integers $m\geq2$ and $n\geq1$, if $P$ is a complex homogeneous polynomial of degree $m$ on $\ell_{p}^{n}$ with $2m\leq p\leq\infty$ given by…

Functional Analysis · Mathematics 2015-10-08 Gustavo Araujo , Daniel Pellegrino

We present a characterization, in terms of projective biduality, for the hypersurfaces appearing in the boundary of the convex hull of a compact real algebraic variety.

Algebraic Geometry · Mathematics 2010-07-02 Kristian Ranestad , Bernd Sturmfels

Using the recently proposed differential hierarchy (Z-expansion) technique, we obtain a general expression for the HOMFLY polynomials in two arbitrary symmetric representations of link families, including Whitehead and Borromean links.…

High Energy Physics - Theory · Physics 2014-05-07 S. Arthamonov , A. Mironov , A. Morozov , An. Morozov

In this paper, we prove that for any odd prime $p$ and for any $p$-integer $\alpha $,we have $ \binom{\alpha p-1}{p-1}\equiv 1-\alpha (\alpha -1)(\alpha ^{2}-\alpha -1)p\sum_{k=1}^{p-1}\frac{1}{k}+\alpha ^{2} (\alpha-1)^{2}p^{2}\sum_{1\leq…

Combinatorics · Mathematics 2016-07-05 Farid Bencherif , Rachid Boumahdi

We prove the Goldbach Conjecture using p-adic analysis and algebraic methods, requiring no knowledge of prime gaps or distribution by showing counterexamples exist if and only if certain polynomials have integer solutions. Assuming, for the…

General Mathematics · Mathematics 2026-02-17 Jason R. South

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Optimization and Control · Mathematics 2008-01-24 Didier Henrion