English
Related papers

Related papers: Parabolic Julia Sets are Polynomial Time Computabl…

200 papers

We study symmetries enjoyed by the polynomials enumerating non-degenerate flags in finite vector spaces, equipped with a non-degenerate alternating bilinear, hermitian or quadratic form. To this end we introduce Igusa-type rational…

Group Theory · Mathematics 2008-12-06 Benjamin Klopsch , Christopher Voll

Criteria are given for determining whether an irreducible sextic equation with rational coefficients is algebraically solvable over the complex numbers.

Mathematical Physics · Physics 2007-05-23 C. Boswell , M. L. Glasser

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…

Data Structures and Algorithms · Computer Science 2012-12-21 Michel Feldmann

In this paper we introduce the notion of parabolic-like mapping, which is an object similar to a polynomial-like mapping, but with a parabolic external class, i.e. an external map with a parabolic fixed point. We prove a straightening…

Dynamical Systems · Mathematics 2013-08-05 Luciana Luna Anna Lomonaco

This paper is a continuation of authors work: Fatou and Julia like sets,Ukranian J. Math., to appear/arXiv:2006.08308[math.CV](see [4]). Here, we introduce escaping like set and generalized escaping like set for a family of holomorphic…

Complex Variables · Mathematics 2020-06-17 Kuldeep Singh Charak , Anil Singh , Manish Kumar

A cubic polynomial $P$ with a non-repelling fixed point $b$ is said to be immediately renormalizable if there exists a (connected) QL invariant filled Julia set $K^*$ such that $b\in K^*$. In that case, exactly one critical point of $P$…

Dynamical Systems · Mathematics 2023-08-31 Alexander Blokh , Lex Oversteegen , Vladlen Timorin

We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…

Computational Complexity · Computer Science 2022-05-23 Norman Danner , James S. Royer

It is well known that the real and imaginary parts of any holomorphic function are harmonic functions of two variables. In this paper we generalize this property to finite-dimensional commutative algebras. We prove that if some basis of a…

Analysis of PDEs · Mathematics 2008-11-18 Anatoliy A. Pogorui

We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…

Combinatorics · Mathematics 2017-01-03 Jesús A. De Loera , David C. Haws , Matthias Köppe

We continue the study of constructing invariant Laplacians on Julia sets, and studying properties of their spectra. In this paper we focus on two types of examples: 1) Julia sets of cubic polynomials $z^3 + c$ with a single critical point;…

Dynamical Systems · Mathematics 2012-06-12 Calum Spicer , Robert S. Strichartz , Emad Totari

This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…

Computational Complexity · Computer Science 2017-06-02 Akitoshi Kawamura , Florian Steinberg

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Algebraic Geometry · Mathematics 2014-02-19 Grigoriy Blekherman , João Gouveia , James Pfeiffer

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

Commutative Algebra · Mathematics 2016-03-14 H. W. Lenstra , A. Silverberg

Let $G$ be a locally graded group and suppose that every non-nilpotent subgroup of $G$ is permutable. We prove that $G$ is soluble. (In light of previous results of the authors, it suffices to prove that $G$ is soluble if it is periodic.

Group Theory · Mathematics 2023-08-10 Sevgi Atlihan , Martyn R. Dixon , Martin J. Evans

Background: Hyperbolic complex numbers are used in the description of hyperbolic spaces. One of the well-known examples of such spaces is the Minkowski space, which plays a leading role in the problems of the special theory of relativity…

Mathematical Software · Computer Science 2023-01-05 Anna V. Korolkova , Migran N. Gevorkyan , Dmitry S. Kulyabov

The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…

Combinatorics · Mathematics 2024-09-26 Jaume de Dios Pont , Jan Grebík , Rachel Greenfeld , Jose Madrid

The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…

Commutative Algebra · Mathematics 2014-05-22 Robert Krone

Let $H^d$ be the set of all rational maps of degree $d\ge 2$ on the Riemann sphere which are expanding on Julia set. We prove that if $f\in H^d$ and all or all but one critical points (or values) are in the immediate basin of attraction to…

Dynamical Systems · Mathematics 2016-09-06 Feliks Przytycki

We consider the dynamics arising from the iteration of an arbitrary sequence of polynomials with uniformly bounded degrees and coefficients and show that, as parameters vary within a single hyperbolic component in parameter space, certain…

Dynamical Systems · Mathematics 2012-02-17 Mark Comerford , Todd Woodard

We present the following result: consider the space of complex polynomials of degree n>2 with n-1 distinct marked periodic orbits of given periods. Then this space is irreducible and the multipliers of the marked periodic orbits considered…

Dynamical Systems · Mathematics 2013-10-28 Igors Gorbovickis
‹ Prev 1 4 5 6 7 8 10 Next ›