Related papers: The Return Map in the Class $\mathcal{O}_C$: Geome…
The Takagi function $T:[0,1]\to \mathbb{R}$ is a classical example of a continuous nowhere differentiable function. In this paper, we study the discrete dynamical system generated by the Takagi function. First, we prove that for almost…
Given two regular graphs with consistent rotation maps, we produce a constructive method for a consistent rotation map on their Cartesian product. This method will be given as a simple set of rules of addition and table look ups. We assume…
A spherical droplet is given an initial rotation in the streamwise direction and is impulsively accelerated by a uniform free stream. Numerical results for the deformation and dynamics of the droplet are obtained by utilising a finite…
Gradient methods are widely used in optimization problems. In practice, while the smoothness parameter can be estimated utilizing techniques such as backtracking, estimating the strong convexity parameter remains a challenge; moreover, even…
The most usual procedure for deriving curvature corrections to effective actions for topological defects is subjected to a critical reappraisal. A logically unjustified step (leading to overdetermination) is identified and rectified, taking…
We introduce the scalar function $C(v)=\pi(1-v^2/c^2)$ as a conformal factor associated, within the model, with longitudinal Lorentz contraction. Extending $C(v)$ to a one-parameter family $C(v,\tau)$, we construct a variational scalar…
We consider a closed convex set $C$ in a separable, infinite-dimensional Hilbert space and endow the set $\mathcal{N}(C)$ of nonexpansive self-mappings on $C$ with the topology of pointwise convergence. We introduce the notion of a somewhat…
The topologies permitted in joint ocular dominance (OD), orientation preference (OP), and direction preference (DP) maps in the primary visual cortex (V1) are considered, with the aim of finding a maximally symmetric periodic case that can…
We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean spaces. Of special interest are the Method of Alternating Projections (MAP) and the Douglas-Rachford or Averaged Alternating Reflection Algorithm…
In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…
This note concerns the relationship between conditions on cost functions and domains and the convexity properties of potentials in optimal transportation and the continuity of the associated optimal mappings. In particular, we prove that if…
The exploration of shape metamorphism, surface reconstruction, and image interpolation raises fundamental inquiries concerning the $C^1$ and higher-order regularity of $\infty$-harmonic potentials -- a specialized category of…
The global Lipschitz smoothness condition underlies most convergence and complexity analyses via two key consequences: the descent lemma and the gradient Lipschitz continuity. How to study the performance of optimization algorithms in the…
We study a parametric family of piecewise rotations of the torus, in the limit in which the rotation number approaches the rational value 1/4. There is a region of positive measure where the discontinuity set becomes dense in the limit; we…
This study analyzes the Collatz map through nonlinear dynamics. By embedding integers in Sharkovsky's ordering, we show that odd initial values suffice for full dynamical characterization. We introduce ``direction phases'' to partition…
We investigate random complex dynamics of rational or polynomial maps on the Riemann sphere. We show that regarding random complex dynamics of polynomials, generically, the chaos of the averaged system disappears at any point in the Riemann…
One can see deep-learning models as compositions of functions within the so-called tame geometry. In this expository note, we give an overview of some topics at the interface of tame geometry (also known as o-minimality), optimization…
In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…
This is the first of a series of papers devoted to a thorough analysis of the class of gradient flows in a metric space $(X,\mathsf{d})$ that can be characterized by Evolution Variational Inequalities. We present new results concerning the…
Learning unknown dynamics under environmental (or external) constraints is fundamental to many fields (e.g., modern robotics), particularly challenging when constraint information is only locally available and uncertain. Existing approaches…