Related papers: Entire functions for which the escaping set is a s…
We introduce a new class of entire functions $\mathcal{E}$ which consists of all $F_0\in\mathcal{O}(\mathbb{C})$ for which there exists a sequence $(F_n)\in \mathcal{O}(\mathbb{C})$ and a sequence $(\lambda_n)\in\mathbb{C}$ satisfying…
The escaping set of an entire function is the set of points that tend to infinity under iteration. We consider subsets of the escaping set defined in terms of escape rates and obtain upper and lower bounds for the Hausdorff measure of these…
Relu Fully Connected Networks are ubiquitous but uninterpretable because they fit piecewise linear functions emerging from multi-layered structures and complex interactions of model weights. This paper takes a novel approach to piecewise…
The Fatou-Julia theory for rational functions has been extended both to transcendental meromorphic functions and more recently to several different types of quasiregular mappings in higher dimensions. We extend the iterative theory to…
We give an alternative way to construct an entire function with quasiconformal surgery so that all its Fatou components are quasi-circles but the Julia set is non-locally connected.
Beginning with Devaney, several authors have studied transcendental entire functions for which every point in the escaping set can be connected to infinity by a curve in the escaping set. Such curves are often called Devaney hairs. We show…
Iterated function systems (IFS) can be a surprisingly useful tool for studying structure in data. Here we present results stemming from a 2013 computational study by the author using IFS. The results include fractal patterns that reveal…
Convolutional networks are powerful visual models that yield hierarchies of features. We show that convolutional networks by themselves, trained end-to-end, pixels-to-pixels, exceed the state-of-the-art in semantic segmentation. Our key…
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…
In this investigation we study a family of networks, called spiders, which covers a range of networks going from chains to complete graphs. These spiders are characterized by three parameters: the number of nodes in the core, the number of…
We prove the existence of transcendental entire functions $f$ having a property studied by Mahler, namely that $f(\overline{\mathbb{Q}})\subseteq \overline{\mathbb{Q}}$ and $f^{-1}(\overline{\mathbb{Q}})\subseteq \overline{\mathbb{Q}}$, and…
Given any dimension function $h$, we construct a perfect set $E \subseteq \mathbb{R}$ of zero $h$-Hausdorff measure, that contains any finite polynomial pattern. This is achieved as a special case of a more general construction in which we…
We use partial actions, as formalized by Exel, to construct various commensurating actions. We use this in the context of groups piecewise preserving a geometric structure, and we interpret the transfixing property of these commensurating…
Short $\mathbb{C}^2$'s were constructed in [F] as attracting basins of a sequence of holomorphic automorphisms whose rate of attraction increases superexponentially. The goal of this paper is to show that such domains also arise naturally…
We prove an analog of Boettcher's theorem for transcendental entire functions in the Eremenko-Lyubich class B. More precisely, let f and g be entire functions with bounded sets of singular values and suppose that f and g belong to the same…
We prove the existence of a transcendental entire function whose Julia set is a "bouquet of pseudo-arcs". More precisely, the union of the Julia set with infinity is an uncountable union of pseudo-arcs, which are pairwise disjoint except at…
Real networks are vulnerable to random failures and malicious attacks. However, when a node is harmed or damaged, it may remain partially functional, which helps to maintain the overall network structure and functionality. In this paper, we…
We give a complete description of the possible Hausdorff dimensions of escaping sets for meromorphic functions with a finite number of singular values. More precisely, for any given $d\in [0,2]$ we show that there exists such a meromorphic…
Many studies have been carried out in order to increase the search efficiency of constraint satisfaction problems; among them, some make use of structural properties of the constraint network; others take into account semantic properties of…
In this work we propose a new neural network architecture that efficiently implements and learns general purpose set-equivariant functions. Such a function f maps a set of entities x = {x1, . . . , xn} from one domain to a set of same…