Related papers: Constructing rational maps with cluster points usi…

Earlier we introduced the notion of a stable set of points (SSP). We proved that a CNF formula is unsatisfiable iff there is a set of points (i.e. complete assignments) that is stable with respect to this formula. Experiments showed that…

Building on work of Doyle and Hyde on polynomial maps in one variable, we produce for each odd integer $d \geq 2$ a H\'enon map of degree $d$ defined over $\mathbb{Q}$ with at least $(d-4)^2$ integral periodic points. This provides a…

The ability to predict the existence and crystal type of ordered structures of materials from their components is a major challenge of current materials research. Empirical methods use experimental data to construct structure maps and make…

Let $S$ be a surface, $G$ a simply-connected classical group, and $G'$ the associated adjoint form of the group. In \cite{FG1}, it was shown that the moduli spaces of framed local systems $\X_{G',S}$ and $\A_{G,S}$ have the structure of…

Let $f$ be a degree $d$ bicritical rational map with critical point set $\mathcal{C}_f$ and critical value set $\mathcal{V}_f$. Using the group $\textrm{Deck}(f^k)$ of deck transformations of $f^k$, we show that if $g$ is a bicritical…

Let K be an algebraically closed field of characteristic zero. Given a polynomial f(x,y) in K[x,y] with one place at infinity, we prove that either f is equivalent to a coordinate, or the family (f+c) has at most two rational elements. When…

We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…

We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate plans for the class 3S of planning problems with binary state…

We study periodic, piecewise linear maps on the plane starting with the Mort Brown's map. We show that if the number of pieces is two, there is only a short list of possible periods (this fact can be seen as the crystallographic restriction…

A period is a complex number arising as the integral of a rational function with algebraic number coefficients over a rationally-defined region. Although periods are typically transcendental numbers, there is a conjectural Galois theory of…

The aim of this paper is to present a simple way to generate proper monomial rational maps between generalized balls and via the relations between generalized balls and bounded symmetric domains of type I, we suggest new examples of proper…

This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…

We present a means of formulating and solving graph coloring problems with probabilistic graphical models. In contrast to the prevalent literature that uses factor graphs for this purpose, we instead approach it from a cluster graph…

We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…

A Latt\`es map $f\colon \hat{\mathbb{C}}\rightarrow \hat{\mathbb{C}}$ is a rational map that is obtained from a finite quotient of a conformal torus endomorphism. We characterize Latt\`es maps by their combinatorial expansion behavior.

New algorithms are presented for numerical conformal mapping based on rational approximations and the solution of Dirichlet problems by least-squares fitting on the boundary. The methods are targeted at regions with corners, where the…

Motivated by the concept of network motifs we construct certain clustering methods (functors) which are parametrized by a given collection of motifs (or representers).

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

We construct the moduli space, $M_d$, of degree $d$ rational maps on $\mathbb{P}^1$ in terms of invariants of binary forms. We apply this construction to give explicit invariants and equations for $M_3$. Using classical invariant theory, we…