Related papers: Rescaling limits of complex rational maps
The dynamical structure of the rational map $ax+1/x$ on the projective line over the field Q2 of $2$-adic numbers, is fully described.
Recently, several strong limit theorems for the oscillation moduli of the empirical process have been given in the iid-case. We show that, with very slight differences, those strong results are also obtained for some representation of the…
We identify the scaling limits for the sizes of the largest components at criticality for inhomogeneous random graphs when the degree exponent $\tau$ satisfies $\tau>4$. We see that the sizes of the (rescaled) components converge to the…
We study the random walk $X$ on the range of a simple random walk on $\mathbb{Z}^d$ in dimensions $d\geq 4$. When $d\geq 5$ we establish quenched and annealed scaling limits for the process $X$, which show that the intersections of the…
We find the sharp range for boundedness of the discrete bilinear spherical maximal function for dimensions $d \geq 5$. That is, we show that this operator is bounded on $l^{p}(\mathbb{Z}^d)\times l^{q}(\mathbb{Z}^d) \to l^{r}(\mathbb{Z}^d)$…
Infinite-dimensional linear conic formulations are described for nonlinear optimal control problems. The primal linear problem consists of finding occupation measures supported on optimal relaxed controlled trajectories, whereas the dual…
In characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…
The core of this note is the observation that links between circle packings of graphs and potential theory developed in \cite{BeSc01} and \cite{HS} can be extended to higher dimensions. In particular, it is shown that every limit of finite…
We consider discrete Gaussian free fields with ergodic random conductances on a class of random subgraphs of $\mathbb{Z}^{d}$, $d \geq 2$, including i.i.d.\ supercritical percolation clusters, where the conductances are possibly unbounded…
In this paper we investigate the scaling limit of the range (the set of visited vertices) for a class of critical lattice models, starting from a single initial particle at the origin. We give conditions on the random sets and an associated…
In a previous paper with the same title, we gave an upper bound for the exponent of uniform rational approximation to a quadruple of $\mathbb{Q}$-linearly independent real numbers in geometric progression. Here, we explain why this upper…
We develop techniques for using compactifications of Hurwitz spaces to study families of rational maps $\mathbb{P}^1\to\mathbb{P}^1$ defined by critical orbit relations. We apply these techniques in two settings: We show that the parameter…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
Given a bounded planar domain $\Omega \subset \mathbb{R}^2$, we show that any singular harmonic map into the circle $\mathbb{S}^1$ corresponding to a topologically nondegenerate critical point of the renormalised energy in the sense of…
We gain tight rigorous bounds on the renormalisation fixed point for period doubling in families of unimodal maps with degree $4$ critical point. We use a contraction mapping argument to bound essential eigenfunctions and eigenvalues for…
Recurrence quantification analysis is a method for measuring the complexity of dynamical systems. Recurrence determinism is a fundamental characteristic of it, closely related to correlation sum. In this paper, we study asymptotic behavior…
It is critical to understand the properties of spatial correlation matrices in massive multiple-input multiple-output (MIMO) systems. We derive new bounds on the extreme eigenvalues of a spatial correlation matrix that is characterized by…
We give an upper bound for the topological entropy of maps on inverse limit spaces in terms of their set-valued components. In a special case of a diagonal map on the inverse limit space $\underleftarrow{\lim}(I,f)$, where every diagonal…
This article provides sharp bounds for the maximum number of edges possible in a simple graph with restricted values of two of the three parameters, namely, maxi- mum matching size, independence number and maximum degree. We also construct…
We prove super-polynomial lower bounds on the size of linear programming relaxations for approximation versions of constraint satisfaction problems. We show that for these problems, polynomial-sized linear programs are exactly as powerful…