In this paper we investigate singularly perturbed complex quadratic polynomial maps of the form Fλ(z) = z 2 − 1 + λ z2 . We prove that for parameter values λ ∈ R as λ → 0 the Julia set of Fλ(z) converges to the filled basilica when λ 6= 0.

In this paper we answer certain questions posed by V.I. Arnold, namely, we study periods of continued fractions for solutions of quadratic equations in the form x + px = q with integer p and q, p + q ≤ R. Our results concern the average sum of period elements and Gauss–Kuzmin statistics as R → ∞.

In this paper, we examine the octahedron as a parameterization scheme to represent environment maps in real-time rendering applications. We discuss two projection schemes and show two convenient unfold mappings to pack the platonic solid into quadratic or rectangular textures. We carry out an analysis and consider rendering performance for interactive applications as well as the quality of repr...

We construct 9-parameter and 13-parameter dynamical systems of the plane which map bi-quadratic curves to other bi-quadratic curves and return to the original curve after two iterations. These generalize the QRT maps which map each such curve to itself. The new families of maps include those that were found as reductions of integrable lattices by [11].

A quadratic function q on an Abelian groupG is a map, with values in an Abelian group, such that the map b : (x, y) 7→ q(x + y) − q(x) − q(y) is Z-bilinear. Such a map q satisfies q(0) = 0. If, in addition, q satisfies the relation q(nx) = nq(x) for all n ∈ Z and x ∈ G, then q is homogeneous. In general, a quadratic function cannot be recovered from the associated bilinear pairing b. Homogeneou...

We present the first detailed case study using quadratic estimators (QE) to diagnose and remove systematics in observed Cosmic Microwave Background (CMB) maps. In this work we focus on temperature polarization leakage. use an iterative QE analysis systematics, analogy de-lensing, recovering primordial B-mode signal systematic introduce a new Gaussian filtering scheme crucial stable convergence ...

In this paper, we address the problem of computing canonical representations of n-dimensional combinatorial maps and of using them for efficiently searching for a map in a database. We define two combinatorial map signatures: the first one has a quadratic space complexity and may be used to decide of isomorphism with a new map in linear time whereas the second one has a linear space complexity ...