相关论文: Local connectivity of Julia sets: expository lectu…

Consider the one-parameter family of cubic polynomials defined by $f_t(z) =-\frac 32 t(-2z^3+3z^2)+1, t \in \mathbb{C}_2$. This family corresponds to a slice of the parameter space of cubic polynomials in $\mathbb{C}_2[z]$. We investigate…

In this article, we prove that for a definable set in an o-minimal structure with connected link (at 0 or infinity), the inner distance of the link is equivalent to the inner distance of the set restricted to the link. With this result, we…

The geometric formulation of Hamilton--Jacobi theory for systems with nonholonomic constraints is developed, following the ideas of the authors in previous papers. The relation between the solutions of the Hamilton--Jacobi problem with the…

In this article, we revisit the complexity of the reconfiguration of independent sets under the token sliding rule on chordal graphs. In the \textsc{Token Sliding-Connectivity} problem, the input is a graph $G$ and an integer $k$, and the…

We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…

Many polynomial invariants of knots and links, including the Jones and HOMFLY-PT polynomials, are widely used in practice but #P-hard to compute. It was shown by Makowsky in 2001 that computing the Jones polynomial is fixed-parameter…

This paper is concerned with developing some new connection formulae between two generalized classes of Fibonacci and Lucas polynomials. All the connection coefficients involve hypergeometric functions of the type $_2F_{1}(z)$, for certain…

Bryant \cite{Br} proved the existence of torsion free connections with exotic holonomy, i.e. with holonomy that does not occur on the classical list of Berger \cite{Ber}. These connections occur on moduli spaces $\Y$ of rational contact…

We describe non-locally connected planar continua via the concepts of fiber and numerical scale. Given a continuum $X\subset\mathbb{C}$ and $x\in\partial X$, we show that the set of points $y\in \partial X$ that cannot be separated from $x$…

We prove that any unicritical polynomial $f_c:z\mapsto z^d+c$ which is at most finitely renormalizable and has only repelling periodic points is combinatorially rigid. It implies that the connectedness locus (the ``Multibrot set'') is…

In previous publications I have proposed a geometrical framework underpinning the local, realistic, and deterministic origins of the strong quantum correlations observed in Nature, without resorting to superdeterminism, retrocausality, or…

In this thesis, I study the local charges $\{Q_k\}$ in the one-dimensional Hubbard model, which is an integrable system used for theoretical studies of non-perturbative effects in strongly correlated electron systems. I obtained their…

In this paper we study the local behavior of solutions to some free boundary problems. We relate the theory of quasi-conformal maps to the regularity of the solutions to nonlinear thin-obstacle problems; we prove that the contact set is…

A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several…

Laminations are a combinatorial and topological way to study Julia sets. Laminations give information about the structure of parameter space of degree $d$ polynomials with connected Julia sets. We first study fixed point portraits in…

Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is…

The so-called "pinched disk" model of the Mandelbrot set is due to A.~Douady, J.~H.~Hubbard and W.~P.~Thurston. It can be described in the language of geodesic laminations. The combinatorial model is the quotient space of the unit disk…

An important question is to describe topological conjugacy classes of dynamical systems. Here we show that within the space of real analytic one-dimensional maps with critical points of prescribed order, the conjugacy class of a map is a…

We present an algorithm for a rigorous computation of lower bounds on the Hausdorff dimensions of Julia sets for a wide class of holomorphic maps. We apply this algorithm to obtain lower bounds on the Hausdorff dimension of the Julia sets…

We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of…