相关论文: Unmating of expanding Thurston maps with Julia set…

In this paper, we prove that for any post-critically finite rational map $f$ on the Riemann sphere $\overline{\mathbb{C}}$, and for each sufficiently large integer $n$, there exists a finite and connected graph $G$ in the Julia set of $f$…

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if…

A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…

Let $\mathcal{U}=\left[ \begin{array}{cc} \mathcal{A} & \mathcal{M} \mathcal{N}& \mathcal{B} \end{array} \right]$ be a generalized matrix ring, where $\mathcal{A}$ and $\mathcal{B}$ are 2-torsion free. We prove that if $\phi…

In the second paper [LZ24b] of this series, we obtained an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly…

By a symmetry of the Julia set of a polynomial, also referred as polynomial Julia set, we mean an Euclidean isometry preserving the Julia set. Each such symmetry is in fact a rotation about the centroid of the polynomial. In this article, a…

We introduce the notion of n-mating in this work, which includes the classical mating of polynomials as a special case. The new notion brings further links between the polynomial world and the rational world than the classical one, as well…

We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…

We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and $2-$structures. We show that, under some axioms, a unique decomposition…

Many applications, including rank aggregation, crowd-labeling, and graphon estimation, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and/or columns. We consider the problem of estimating…

Let $f_0$ be a polynomial of degree $d_1+d_2$ with a periodic critical point $0$ of multiplicity $d_1-1$ and a Julia critical point of multiplicity $d_2$. We show that if $f_0$ is primitive, free of neutral periodic points and…

We consider a class of nonlinear mappings $\mathsf{F}_{A,N}$ in $\mathbb{R}^N$ indexed by symmetric random matrices $A\in\mathbb{R}^{N\times N}$ with independent entries. Within spin glass theory, special cases of these mappings correspond…

Any Jordan curve in the complex plane can be approximated arbitrarily well in the Hausdorff topology by Julia sets of polynomials. Finite collections of disjoint Jordan domains can be approximated by the basins of attraction of rational…

Let $f: S^2 \to S^2$ be an expanding branched covering map of the sphere to itself with finite postcritical set $P_f$. Associated to $f$ is a canonical quasisymmetry class $\GGG(f)$ of Ahlfors regular metrics on the sphere in which the…

We propose a framework for optimal $t$-matchings excluding the prescribed $t$-factors in bipartite graphs. The proposed framework is a generalization of the nonbipartite matching problem and includes several problems, such as the…

We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…

We study the dynamics of Stirling's iterative root-finding method $St_f(z)$ for rational and polynomial functions. It is seen that the Scaling theorem is not satisfied by Stirling's iterative root-finding method. We prove that for a…

To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…

Let f be an obstructed Thurston map with canonical obstruction \Gamma_f. We prove the following generalization of Pilgrim's conjecture: if the first-return map F of a periodic component C of the topological surface obtained from the sphere…