Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

199397596794 · Jun 202019922001200920172026
48 results for Julia sets

We extend a result regarding the Random Backward Iteration algorithm for drawing Julia sets (known to work for certain rational semigroups containing a non-Möbius element) to a class of Möbius semigroups which includes certain settings not yet been dealt with in the literature, namely, when the Julia set is not a thick…

2015-11-09abs ↗pdf ↗

We show that if PP is a quadratic polynomial with a fixed Cremer point and Julia set JJ, then for any monotone map $\ph:J\to A$ from JJ onto a locally connected continuum AA, AA is a single point.

2008-09-06abs ↗pdf ↗

Study dynamics of automorphisms on cubic surfaces and their connection to Painlevé 6.

problem Dynamics of holomorphic automorphisms on cubic surfaces and their relation to Painlevé 6.
method Defined Julia and Fatou sets, studied locally discrete and non-discrete dynamics, and proved existence of non-empty Fatou and Julia sets.
result Existence of non-empty Fatou and Julia sets for the group action.

This paper deals with both complex dynamical systems and conformal iterated function systems. We study finitely generated expanding semigroups of rational maps with overlaps on the Riemann sphere. We show that if a dd-parameter family of such semigroups satisfies the transversality condition, then for almost every par…

2011-09-12abs ↗pdf ↗

JULIA combines multi-linear and nonlinear models for tensor completion.

problem Complex patterns in real-world tensors require a unified model.
method JULIA unifies multi-linear and nonlinear models with flexible component assignment and efficient alternating optimization.
result JULIA outperforms existing methods in large-scale tensor completion.

We investigate the random dynamics of polynomial maps on the Riemann sphere and the dynamics of semigroups of polynomial maps on the Riemann sphere. In particular, the dynamics of a semigroup GG of polynomials whose planar postcritical set is bounded and the associated random dynamics are studied. In general, the Juli…

2011-04-19abs ↗pdf ↗

Paper introduces a new Poisson kernel for strongly pseudoconvex domains.

problem Developing a new mathematical tool for strongly pseudoconvex domains.
method Introducing a maximal plurisubharmonic function called the pluricomplex Poisson kernel.
result The pluricomplex Poisson kernel shares properties with the classical Poisson kernel and reproduces pluriharmonic functions.

We present new rectification theorems of degenerate quasi-conformal structures that give a meaning to quotients of Riemann surfaces with empty interior "fundamental domains". These techniques are used to define the unique renormalization of polynomials with Cantor set Julia sets.

2014-05-22abs ↗pdf ↗

This paper describes Convex, a convex optimization modeling framework in Julia. Convex translates problems from a user-friendly functional language into an abstract syntax tree describing the problem. This concise representation of the global structure of the problem allows Convex to infer whether the problem complies …

2014-10-17abs ↗pdf ↗

Let PP be a polynomial of degree dd with a Cremer point pp and no repelling or parabolic periodic bi-accessible points. We show that there are two types of such Julia sets JPJ_P. The \emph{red dwarf} JPJ_P are nowhere connected im kleinen and such that the intersection of all impressions of external angles is a cont…

2008-09-05abs ↗pdf ↗

We present the preliminary high-level design and features of DynamicPPL.jl, a modular library providing a lightning-fast infrastructure for probabilistic programming. Besides a computational performance that is often close to or better than Stan, DynamicPPL provides an intuitive DSL that allows the rapid development of…

2020-02-07abs ↗pdf ↗

Algorithm approximates functions into manifolds with curvature bounds.

problem Approximating functions into manifolds with lower curvature bounds.
method Algorithm using manifold exponential and logarithm, with error bounds based on sectional curvature.
result Error bounds for nonnegative sectional curvature are similar to linear space approximations.

We present proofs of basic results, including those developed by Harold Bell, for the plane fixed point problem: does every map of a non-separating plane continuum have a fixed point? Some of these results had been announced much earlier by Bell but without accessible proofs. We define the concept of the variation of a…

2010-04-01abs ↗pdf ↗

CoinTossX is a low-latency, open-source matching engine for financial trading.

problem Efficiently matching orders in financial markets with low latency and high throughput.
method Developed in Java, orders submitted via UDP SBE, low-latency message transport (Aeron Media Driver). Separates order generation and matching.
result Demonstrated low-latency, high-throughput performance in various deployment scenarios.

Extends DCP framework to Hadamard manifolds for geodesically convex functions.

problem Verifying convexity in nonlinear programs on Hadamard manifolds.
method Introduces Disciplined Geodesically Convex Programming (DGCP) framework, defining compositions and transformations for geodesically convex functions.
result Allows verification of geodesic convexity for a broader range of functions, including statistical estimators and matrix-valued optimization.

The presentation of supergravity theories of our previous paper "Super-Poincare' algebras, space-times and supergravities (I)" is re-formulated in the language of Berezin-Leites-Kostant theory of supermanifolds. It is also shown that the equations of Cremmer, Julia and Scherk's theory of 11D-supergravity are equivalent…

2011-08-31abs ↗pdf ↗

We discuss analogues of the prime number theorem for a hyperbolic rational map f of degree at least two on the Riemann sphere. More precisely, we provide counting estimates for the number of primitive periodic orbits of f ordered by their multiplier, and also obtain equidistribution of the associated holonomies; both e…

2016-03-01abs ↗pdf ↗

An infinite family of generalized pseudo-Anosov homeomorphisms of the sphere S is constructed, and their invariant foliations and singular orbits are described explicitly by means of generalized train tracks. The complex strucure induced by the invariant foliations is described, and is shown to make S into a complex sp…

2003-07-15abs ↗pdf ↗

The paper studies degenerations of rational maps and their limits as geometrically finite rational maps.

problem Understanding the limits of quasi post-critically finite degenerations of rational maps.
method Constructing limits as geometrically finite rational maps on a tree of Riemann spheres, proving boundedness, and giving convergence criteria.
result Progress towards Thurston's compactness theorem and double limit theorem in complex dynamics.

Path signatures adapted for Lie groups improve action recognition in computer vision.

problem Improving action recognition in computer vision with geometric constraints.
method Lifting path signatures to Lie groups and proving universality and characteristic property.
result Path signatures on Lie groups provide comparable performance to shallow learning approaches in action recognition.

Survey explores interactions between four conformal dynamics branches.

problem Understanding complex dynamics through different mathematical concepts.
method Examples and general results with technical tools.
result Dynamical relations between Schwarz reflection parameter spaces and anti-rational maps/ reflection groups.

New connection found between complex polynomials and surface homeomorphisms.

problem Investigating the existence of generalized pseudo-Anosov maps from quadratic polynomials.
method Developed a new connection between dynamics of quadratic polynomials and surface homeomorphisms, focusing on Hubbard trees.
result Identified conditions for constructing generalized pseudo-Anosov maps from quadratic polynomials.

The generation of artificial data based on existing observations, known as data augmentation, is a technique used in machine learning to improve model accuracy, generalisation, and to control overfitting. Augmentor is a software package, available in both Python and Julia versions, that provides a high level API for th…

2017-08-11abs ↗pdf ↗

We describe relations between hyperbolic geometry and codimension two knots or, more exactly, between varieties of conjugacy classes of discrete faithful representations of the fundamental groups of hyperbolic n-manifolds M into SO(n+2,1)\operatorname{SO}^{\circ} (n+2,1) and (n-1)-dimensional knots in the (n+1)-sphere. This a…

2001-02-26abs ↗pdf ↗

Identifying the unknown underlying trend of a given noisy signal is extremely useful for a wide range of applications. The number of potential trends might be exponential, which can be computationally exhaustive even for short signals. Another challenge, is the presence of abrupt changes and outliers at unknown times w…

2016-03-11abs ↗pdf ↗

In this article we prove that, for an oriented PL nn-manifold MM with mm boundary components and d0Nd_0\in \mathbb N, there exist mutually disjoint closed Euclidean balls and a K\mathsf K-quasiregular mapping MSnint(B1Bm)M \to \mathbb S^n \setminus \mathrm{int}(B_1\cup \cdots \cup B_m) of degree at least d0d_0. The result is …

2019-04-19abs ↗pdf ↗