Related papers: A geometric iterated function system on triangles
Geometric properties of the fixed point set $Fix(f)$ of a self-mapping $f$ on a metric or a generalized metric space is an attractive issue. The set $Fix(f)$ can contain a geometric figure (a circle, an ellipse, etc.) or it can be a…
The aim of the current paper is to introduce a new class of contractive mappings, which are contracting (a feature of) triangles. We prove that maps contracting triangles are continuous and give the fixed point result for such mappings. We…
Modular forms are highly self-symmetric functions studied in number theory, with connections to several areas of mathematics. But they are rarely visualized. We discuss ongoing work to compute and visualize modular forms as 3D surfaces and…
A formula is derived that provides generating functions for any multi-j-symbol, such as the 3-j-symbol, the 6-j-symbol, the 9-j-symbol, etc. The result is completely determined by geometrical objects (loops and curves) in the graph of the…
We construct an explicit family of modular iterated integrals which involves cusp forms. This leads to a new method of producing "invariant versions" of iterated integrals of modular forms. The construction will be based on an extension of…
Associated to any affine space A endowed with a metric structure of arbitrary signature we consider the space of affine functionals operating on the space of quadratic functions of A. On this functional space we characterize a symmetric…
An approach is proposed which, given a family of linearly independent functions, constructs the appropriate biorthogonal set so as to represent the orthogonal projector operator onto the corresponding subspace. The procedure evolves…
Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…
We construct moduli spaces of framed logarithmic connections and also moduli spaces of framed parabolic connections. It is shown that these moduli spaces possess a natural algebraic symplectic structure. We also give an upper bound of the…
A class of spherical functions is studied which can be viewed as the matrix generalization of Bessel functions. We derive a recursive structure for these functions. We show that they are only special cases of more general radial functions…
A geometric derivation of numerical integrators for nonholonomic systems and optimal control problems is obtained. It is based in the classical technique of generating functions adapted to the special features of nonholonomic systems and…
We give a short proof of the contractibility of the space of geodesic triangulations with fixed combinatorial type of a convex polygon in the Euclidean plane. Moreover, for any $n>0$, we show that there exists a space of geodesic…
We provide a new algorithm (called the grid algorithm) designed to generate the image of the attractor of a generalized iterated function system on a finite dimensional space and we compare it with the deterministic algorithm regarding…
We introduce the notion of a {\it mock tridiagonal system}. This is a generalization of a tridiagonal system in which the irreducibility assumption is replaced by a certain non-vanishing condition. We show how mock tridiagonal systems can…
We construct a wavelet and a generalised Fourier basis with respect to some fractal measures given by one-dimensional iterated function systems. In this paper we will not assume that these systems are given by linear contractions…
An iterative square root of a function $f$ is a function $g$ such that $g(g(\cdot))=f(\cdot)$. We obtain new characterizations for detecting the non-existence of such square roots for self-maps on arbitrary sets. This is used to prove that…
We discuss some examples of geometrically meaningful rational self-maps of moduli space of curves of low genus and homogeneous forms.
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
In this paper, we introduce an iterative numerical method to solve systems of nonlinear equations. The third-order convergence of this method is analyzed. Several examples are given to illustrate the efficiency of the proposed method.
A one-to-one continuous function from a triangle to itself is defined that has both interesting number theoretic and analytic properties. This function is shown to be a natural generalization of the classical Minkowski ?(x) function. It is…