Related papers: Dynamical approximations of postsingularly finite …

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

We introduce the Hermitian-invariant group $\Gamma_f$ of a proper rational map $f$ between the unit ball in complex Euclidean space and a generalized ball in a space of typically higher dimension. We use properties of the groups to define…

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).

We prove the No Invariant Line Fields conjecture for a class of generalized postcritically-finite branched covers on higher-dimensional Riemannian manifolds. Moreover, we establish a quasisymmetric uniformization theorem for this class of…

Consider a dynamical system $T:\mathbb{T}\times \mathbb{R}^{d} \rightarrow \mathbb{T}\times \mathbb{R}^{d} $ given by $ T(x,y) = (E(x), C(y) + f(x))$, where $E$ is a linear expanding map of $\mathbb{T}$, $C$ is a linear contracting map of…

We propose to compute approximations to general invariant sets in dynamical systems by minimizing the distance between an appropriately selected finite set of points and its image under the dynamics. We demonstrate, through computational…

We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. We focus on the case where the escape is degenerate in the sense that points from…

This paper explores topological complexity in the finite equivariant setting. We first define and study an equivariant version of Tanaka's combinatorial complexity for finite topological spaces. We explore the relationships between this…

Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.

Let G be a finite simple group. We show that the commutator map $a : G \times G \to G$ is almost equidistributed as the order of G goes to infinity. This somewhat surprising result has many applications. It shows that for a subset X of G we…

The holomorphic endomorphism f of projective space is called post-critically finite (PCF) if the forward image of the critical locus, under iteration of f, has algebraic support (i.e., is a finite union of hypersurfaces). In the case of…

Filaments are a natural generalization of the well-known concept of dynamic rays in complex dynamics. In this article we investigate which periodic or preperiodic filaments land together for arbitrary post-singularly finite transcendental…

We employ projective Fra\"iss\'e theory to define the "generic combinatorial $n$-simplex" as the pro-finite, simplicial complex that is canonically associated with a family of simply defined selection maps between finite triangulations of…

Let $d\in {\mathbb N}$ and $p_i$ be an integral polynomial with $p_i(0)=0$, $1\le i\le d$. It is shown that if $S$ is piecewise syndetic in $\mathbb Z$, then $$\{(m,n)\in{\mathbb Z}^2: m+p_1(n),\ldots,m+p_d(n)\in S\}$$ is piecewise syndetic…

In this work we design graph neural network architectures that capture optimal approximation algorithms for a large class of combinatorial optimization problems, using powerful algorithmic tools from semidefinite programming (SDP).…

This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…

Complex signed measures of finite total variation are a powerful signal model in many applications. Restricting to the $d$-dimensional torus, finitely supported measures allow for exact recovery if the trigonometric moments up to some order…

Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…

A strongly polynomial sequence of graphs $(G_n)$ is a sequence $(G_n)_{n\in\mathbb{N}}$ of finite graphs such that, for every graph $F$, the number of homomorphisms from $F$ to $G_n$ is a fixed polynomial function of $n$ (depending on $F$).…