相关论文: Parabolic Julia Sets are Polynomial Time Computabl…

For an infinitely renormalizable quadratic map $f_c: z\mapsto z^2+c$ with the sequence of renormalization periods ${k_m}$ and rotation numbers ${t_m=p_m/q_m}, we prove that if $\limsup k_m^{-1}\log |p_m|>0$, then the Mandelbrot set is…

Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…

It has been shown that the Sierpi\'nski gasket-like sets can appear as the Julia sets of some geometrically finite rational maps. In this paper we prove that such type of Julia sets can also appear in the rational maps containing Siegel…

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…

In this paper, we prove that a rational map with a Cantor Julia set carries no invariant line fields on its Julia set. It follows that a structurally stable rational map with a Cantor Julia set is hyperbolic.

We provide detailed local descriptions of stable polynomials in terms of their homogeneous decompositions, Puiseux expansions, and transfer function realizations. We use this theory to first prove that bounded rational functions on the…

We find new quantitative estimates on the space-time analyticity of solutions to linear parabolic equations with time-independent coefficients and apply them to obtain observability inequalities for its solutions over measurable sets.

It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kampen diagrams, which represent groups as quotients of…

In this paper, we establish $L_p$ estimates and solvability for time fractional divergence form parabolic equations in the whole space when leading coefficients are merely measurable in one spatial variable and locally have small mean…

We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…

We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential…

We relate periodic and recurrent points in dendritic Julia sets. This generalizes well-known results for interval dynamics.

We characterize left and right amenable semigroups of polynomials of one complex variable with respect to the composition operation. We also prove a number of results about amenable semigroups of arbitrary rational functions. In particular,…

We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing…

In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…

We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…

The purpose of this note is to show that the regular locus of a complex variety is locally parabolic at the singular set. This yields that the regular locus of a compact complex variety, e.g., of a projective variety, is parabolic. We give…

It has been known since Julia that polynomials commuting under composition have the same Julia set. More recently in the works of Baker and Eremenko, Fern\'andez, and Beardon, results were given on the converse question: When do two…

In this paper, we consider an extension of Jacobi's symbol, the so called rational $2^k$-th power residue symbol. In Section 3, we prove a novel generalization of Zolotarev's lemma. In Sections 4, 5 and 6, we show that several hard…

We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…