Related papers: Subdivision rule constructions on critically prepe…
In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…
Hubbard trees are invariant trees connecting the points of the critical orbits of postcritically finite polynomials. Douady and Hubbard \cite{Orsay} introduced these trees and showed that they encode the essential information of Julia sets…
One of the fundamental properties of the Mandelbrot set is that the set of postcritically finite parameters is structured like a tree. We extend this result to the set of quadratic kneading sequences and show that this space contains no…
We study the forward orbit of the critical point for polynomials of the form $f_c=z^2+c$ defined over $\mathbb{Z}_p$. Hubbard trees capture the dynamical behavior for such maps with finite critical orbit in $\mathbb{C}$. We suggest a notion…
We propose an analytical method for the construction of Hartree-Fock phase diagrams for the (fermion) Hubbard model and various generalizations thereof. Such phase diagrams are traditionally constructed numerically, but we argue that, by…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
This paper is concerned with realizing Lattes maps as subdivision maps of finite subdivision rules. The main result is that the Lattes maps in all but finitely many analytic conjugacy classes can be realized as subdivision maps of finite…
A rigorous mathematical framework is provided for a substructuring-based domain-decomposition approach for nonlocal problems that feature interactions between points separated by a finite distance. Here, by substructuring it is meant that a…
Decision trees built with data remain in widespread use for nonparametric prediction. Predicting probability distributions is preferred over point predictions when uncertainty plays a prominent role in analysis and decision-making. We study…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
Polymatroids are combinatorial abstractions of subspace arrangements in the same way that matroids are combinatorial abstractions of hyperplane arrangements. By introducing augmented Chow rings of polymatroids, modeled after augmented…
Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…
Matrix Factorization has emerged as a widely adopted framework for modeling data exhibiting low-rank structures. To address challenges in manifold learning, this paper presents a subspace-constrained quadratic matrix factorization model.…
Parabolic cut pairs in the boundaries of relatively hyperbolic group are a new and previously unexplored phenomenon. In this paper, we give a way to create examples of relatively hyperbolic groups with parabolic cut pairs on their boundary…
We suggest a new mean field method for studying the thermodynamic competition between magnetic and superconducting phases in a two-dimensional square lattice. A partition function is constructed by writing microscopic interactions that…
Thurston parameterized quadratic invariant laminations with a non-invariant lamination, the quotient of which yields a combinatorial model for the Mandelbrot set. As a step toward generalizing this construction to cubic polynomials, we…
The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many…
We propose {\delta}-MAPS, a method that analyzes spatio-temporal data to first identify the distinct spatial components of the underlying system, referred to as "domains", and second to infer the connections between them. A domain is a…
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).
This article reveals an analysis of the quadratic systems that hold multiparametric families therefore, in the first instance the quadratic systems are identified and classified in order to facilitate their study and then the stability of…