Related papers: Gluing polynomials along the circle
A completely stable multicurve of a post-critically finite rational map induces a combinatorial decomposition. The projections of the small Julia sets are immersed within the original Julia set. We prove that two small Julia sets are…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…
We describe a new approach to the problem of constructing gluing parameterizations for open neighborhoods of boundary points of moduli spaces of anti-self-dual connections over closed four-dimensional manifolds. Our approach employs general…
A new generalization of Grassmannians to supergeometry, different from the well known supergrassmannian, is introduced. These are constructed by gluing a finite number of copies of a \nu\- domain, i.e. a superdomain with an odd involution,…
There are many approaches to the classification of Morse functions and their gradient fields (Morse Fields) on 2-surfaces. This paper studies the gluings of quadrilaterals and the classification of topological surfaces obtained by gluing…
The Jacobian of a graph is a discrete analogue of the Jacobian of a Riemann surface. In this paper, we explore how Jacobians of graphs change when we glue two graphs along a common subgraph focusing on the case of cycle graphs. Then, we…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
Grafting is a method of obtaining new projective structures from a hyperbolic structure, basically by gluing a flat cylinder into a surface along a closed geodesic in the hyperbolic structure, or by limits of that procedure. This induces a…
In this article, we show that all admissible rational maps with fixed or period two cluster cycles can be constructed by the mating of polynomials. We also investigate the polynomials which make up the matings that construct these rational…
We study the properties of glued knots, a sub-class of real rational knots, that can be constructed by gluing ellipses. We define an invariant called the gluing degree and relate it to various classical properties of knots and classify all…
In this paper, we prove the rationality of the gluing relation of edge replacement systems, which were introduced for studying rearrangement groups of fractals. More precisely, we describe an algorithmic procedure for building a finite…
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…
Any Jordan curve in the complex plane can be approximated arbitrarily well in the Hausdorff topology by Julia sets of polynomials. Finite collections of disjoint Jordan domains can be approximated by the basins of attraction of rational…
A periodic parallelogram polyomino is a parallelogram polyomino such that we glue the first and the last column. In this work we extend a bijection between ordered trees and parallelogram polyominoes in order to compute the generating…
We describe applications of the gluing formalism discussed in the companion paper. When a $d$-dimensional local theory $\text{QFT}_d$ is supersymmetric, and if we can find a supersymmetric polarization for $\text{QFT}_d$ quantized on a…
In the paper, we introduce the terminology equivariant pointwise clutching map. By using this, we give details on how to glue an equivariant vector bundle over a finite set so as to obtain a new Lie group representation such that the…
A Thurston map is a branched covering map $f\colon S^2\to S^2$ that is postcritically finite. Mating of polynomials, introduced by Douady and Hubbard, is a method to geometrically combine the Julia sets of two polynomials (and their…
Let $R$ be an affine domain of characteristic zero with finite quotients. We prove that a polynomial map over $R$ is surjective if and only if it is surjective over $\hat{R_{\mathfrak{m}}}$, the completion of $R$ with respect to…