相关论文: Unmating of expanding Thurston maps with Julia set…
Let $\tilde f\colon(S^2,\tilde A)\to(S^2,\tilde A)$ be a Thurston map and let $M(\tilde f)$ be its mapping class biset: isotopy classes rel $\tilde A$ of maps obtained by pre- and post-composing $\tilde f$ by the mapping class group of…
Considering the worst-case scenario, junction tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees. Unfortunately, its main tractability assumption requires the treewidth of a…
Some easily verifiable sufficient conditions for the nonexistence of iterative roots for multifunctions on arbitrary nonempty sets are presented. Typically if the graph of the multifunction has a distinguished point with a relatively large…
The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the…
We investigate monogenicity and prime splitting in extensions generated by roots of iterated quadratic polynomials. Let $f(x)\in\mathbb{Z}[x]$ be an irreducible, monic, quadratic polynomial, and write $f^n(x)$ for the $n^{\text{th}}$…
We investigate the dynamics of semigroups generated by a family of polynomial maps on the Riemann sphere such that the postcritical set in the complex plane is bounded. The Julia set of such a semigroup may not be connected in general. We…
We introduce a new method for computing massless Feynman integrals analytically in parametric form. An analysis of the method yields a criterion for a primitive Feynman graph $G$ to evaluate to multiple zeta values. The criterion depends…
We give a new fpt algorithm testing isomorphism of $n$-vertex graphs of tree width $k$ in time $2^{k\operatorname{polylog} (k)}\operatorname{poly} (n)$, improving the fpt algorithm due to Lokshtanov, Pilipczuk, Pilipczuk, and Saurabh (FOCS…
The double Hamiltonian Hopf bifurcation is studied, i.e. a generic two-parametric unfolding of a smooth Hamiltonian system with four degrees of freedom which has at the critical value of parameters the equilibrium with two pairs of double…
We give an algorithm for learning $O(\log n)$ juntas in polynomial-time with respect to Markov Random Fields (MRFs) in a smoothed analysis framework where only the external field has been randomly perturbed. This is a broad generalization…
We study the post-critical set of a class of holomorphic systems with an irrationally indifferent fixed point. We prove a trichotomy for the topology of the post-critical set based on the arithmetic of the rotation number at the fixed…
Holomorphic renormalization plays an important role in complex polynomial dynamics. We consider certain conditions guaranteeing that a polynomial which does not admit a polynomial-like connected Julia set still admits an invariant continuum…
We consider bivariate polynomials over the skew field of quaternions, where the indeterminates commute with all coefficients and with each other. We analyze existence of univariate factorizations, that is, factorizations with univariate…
We obtain a unique, canonical one-to-one correspondence between the space of marked postcritically finite Newton maps of polynomials and the space of postcritically minimal Newton maps of entire maps that take the form $p(z)…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
We consider a class $G(S^n)$ of orientation preserving Morse-Smale diffeomorphisms of the sphere $S^{n}$ of dimension $n>3$ in assumption that invariant manifolds of different saddle periodic points have no intersection. We put in a…
This article introduces a new nonparametric method for estimating a univariate regression function of bounded variation. The method exploits the Jordan decomposition which states that a function of bounded variation can be decomposed as the…
We prove that the Julia set of a rational function $f$ is computable in polynomial time, assuming that the postcritical set of $f$ does not contain any critical points or parabolic periodic orbits.
This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…
Mixed trigonometric-polynomials (MTPs) are functions of the form $f(x,\sin{x}, \cos{x})$ with $f\in\mathbb{Q}[x_1,x_2,x_3]$. In this paper, an algorithm ``isolating" all the real roots of an MTP is provided and implemented. It automatically…