Related papers: Rich dynamical behaviors from a digital reversal o…
We define polygonal dynamics as a family of dynamical systems acting on points in projective spaces. The most famous example is the pentagram map. Similar collapsing phenomena seem to occur in most of these systems. We prove it in some…
This paper is about randomized iterative algorithms for solving a linear system of equations $X \beta = y$ in different settings. Recent interest in the topic was reignited when Strohmer and Vershynin (2009) proved the linear convergence…
This survey paper is aimed to describe a relatively new branch of symbolic dynamics which we call Arithmetic Dynamics. It deals with explicit arithmetic expansions of reals and vectors that have a "dynamical" sense. This means precisely…
An existing dialogue between number theory and dynamical systems is advanced. A combinatorial device gives necessary and sufficient conditions for a sequence of non-negative integers to count the periodic points in a dynamical system. This…
We extract a two-dimensional dynamical system from the theorems of Pappus and Steiner in classical projective geometry. We calculate an explicit formula for this system, and study its elementary geometric properties. Then we use Artin…
In the first part of this work the classical and statistical aspects of the dynamics of an inextensible chain in three dimensions are investigated. In the second part the special case of a chain admitting only fixed angles with respect to…
Random Reshuffling (RR) is an algorithm for minimizing finite-sum functions that utilizes iterative gradient descent steps in conjunction with data reshuffling. Often contrasted with its sibling Stochastic Gradient Descent (SGD), RR is…
Dyck paths are one of the most important objects in enumerative combinatorics, and there are many papers devoted to counting selected families of Dyck paths. Here we present two approaches for the automatic counting of many such families,…
Discrete numerical methods with finite time-steps represent a practical technique to solve initial-value problems involving nonlinear differential equations. These methods seem particularly useful to the study of chaos since no analytical…
Dynamic programming is a class of algorithms used to compute optimal control policies for Markov decision processes. Dynamic programming is ubiquitous in control theory, and is also the foundation of reinforcement learning. In this paper,…
This work investigates the inverse drift problem in the one-dimensional parabolic equation with the final time data. The authors construct an operator first, whose fixed points are the unknown drift, and then apply it to prove the…
Repdigits are natural numbers formed by the repetition of a single digit. In this paper, we study the problem of writing repdigits as the difference of two balancing or Lucas-balancing numbers. The method of proof involves the application…
In this paper, the notion of Integral Value Transformations (IVTs), a class of Discrete Dynamical Maps has been introduced. Then notion of Affine Discrete Dynamical System (ADDS) in the light of IVTs is defined and some rudimentary…
Mathematical methods of step-by-step and combined shifts are proposed for experimental data processing to reconstruct the measuring system impulse response distorted by shift-invariant blur. Proposed methods base on direct non-blind…
In this paper we shall study the inverse problem relative to dynamics of the w function which is a special arithmetic function and shall get some results.
The Collatz conjecture is one of the easiest mathematical problems to state and yet it remains unsolved. For each $n\ge 2$ the Collatz iteration is mapped to a binary sequence and a corresponding unique integer which can recreate the…
Dynamic decisions are pivotal to economic policy making. We show how existing evidence from randomized control trials can be utilized to guide personalized decisions in challenging dynamic environments with budget and capacity constraints.…
An algebraic telic problem is a decision problem in $\textsf{NP}_\mathbb{R}$ formalizing finite-time reachability questions for one-dimensional dynamical systems. We prove that the existence of "natural" mapping reductions between algebraic…
Nature and our world have a bias! Roughly $30\%$ of the time the number $1$ occurs as the leading digit in many datasets base $10$. This phenomenon is known as Benford's law and it arrises in diverse fields such as the stock market,…
We introduce \emph{coarse scrambling}, a novel randomization for digital sequences that permutes blocks of digits in a mixed-radix representation. This construction is designed to preserve the powerful $(0,\boldsymbol{e},d)$-sequence…