Related papers: Rationality is decidable for nearly Euclidean Thur…
An orientation-preserving branched covering $f: S^2 \to S^2$ is a nearly Euclidean Thurston (NET) map if each critical point is simple and its postcritical set has exactly four points. Inspired by classical, non-dynamical notions such as…
Recent work of Dylan Thurston gives a condition for when a post-critically finite branched self-cover of the sphere is equivalent to a rational map. We apply D. Thurston's positive criterion for rationality to give a new proof of a theorem…
To any real rational function with generic ramification points we assign a combinatorial object, called a garden, which consists of a weighted labeled directed planar chord diagram and of a set of weighted rooted trees each corresponding to…
A real algebraic variety W of dimension m is said to be uniformly rational if each of its points has a Zariski open neighborhood which is biregularly isomorphic to a Zariski open subset of R^m. Let l be any nonnegative integer. We prove…
The Thurston norm of a closed oriented graph manifold is a sum of absolute values of linear functionals, and either each or none of the top-dimensional faces of its unit ball are fibered. We show that, conversely, every norm that can be…
In this paper, we study CTP maps, that is, marked rational maps with constant Thurston pullback mapping. We prove that all the regular or mixing CTP polynomials satisfy McMullen's condition. Additionally, we construct a new class of…
In 1980s, Thurston established a topological characterization theorem for postcritically finite rational maps. In this paper, a decomposition theorem for a class of postcritically infinite branched covering termed `Herman map' is developed.…
We define a notion of network capacity region of networks that generalizes the notion of network capacity defined by Cannons et al. and prove its notable properties such as closedness, boundedness and convexity when the finite field is…
A fundamental component of networking infras- tructure is the policy, used in routing tables and firewalls. Accordingly, there has been extensive study of policies. However, the theory of such policies indicates that the size of the…
We give an exposition of Natural Topology (NToP), which highlights its advantages for exact computation. The NToP-definition of the real numbers (and continuous real functions) matches recent expert recommendations for exact real…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Predictive coding has emerged as an influential normative model of neural computation, with numerous extensions and applications. As such, much effort has been put into mapping PC faithfully onto the cortex, but there are issues that remain…
A perfectly rational decision-maker chooses the best action with the highest utility gain from a set of possible actions. The optimality principles that describe such decision processes do not take into account the computational costs of…
We study rationality constructions for smooth complete intersections of two quadrics over nonclosed fields. Over the real numbers, we establish a criterion for rationality in dimension four.
Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
Large language models (LLMs), a recent advance in deep learning and machine intelligence, have manifested astonishing capacities, now considered among the most promising for artificial general intelligence. With human-like capabilities,…
Using Thurston's characterization of postcritically finite rational functions as branched coverings of the sphere to itself, we give a new method of constructing new conformal dynamical systems out of old ones. Let $f(z)$ be a rational map…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…