Related papers: Deterministic Structures in the Stopping Time Dyna…

We obtain a formal integral solution to the 3+1 D Boltzmann Equation in relaxation time approximation. The gradient series obtained from this integral solution contains exponentially decaying non-hydrodynamic terms. It is shown that this…

We present some interesting observations on the 3x+1 problem. We propose a new algorithm which eliminates certain steps while we check the action of 3x+1 procedure on a number. Also, we propose a reason why many numbers follow a similar…

Assuming Temporal and Configurational Relationalism, GR as Geometrodynamic's DeWitt supermetric alongside local Lorentzian Relativity with its universal finite maximum propagation speed arises as one of very few options from Feeding…

Convergence is proved for solutions of Dirichlet problems in regions with many small excluded sets (holes), as the holes become smaller and more numerous. The problem is formulated in the context of Markov processes associated with general…

The $n+1$ vortex filament problem has explicit solutions consisting of $n$ parallel filaments of equal circulation in the form of nested polygons uniformly rotating around a central filament which has circulation of opposite sign. We show…

We consider a class of discretionary stopping problems within the $G$-framework. We first establish the well-definedness of the stopping problem under the $G$-expectation, by showing the quasi-continuity of the stopped process. We then…

The 3D incompressible Euler equation is an important research topic in the mathematical study of fluid dynamics. Not only is the global regularity for smooth initial data an open issue, but the behaviour may also depend on the presence or…

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…

Recently increasing penetration of renewable energy generation brings challenges for power system operators to perform efficient power generation daily scheduling, due to the intermittent nature of the renewable generation and discrete…

Constraints are found on the spatial variation of finite-time Lyapunov exponents of two and three-dimensional systems of ordinary differential equations. In a chaotic system, finite-time Lyapunov exponents describe the average rate of…

Under non-exponential discounting, we develop a dynamic theory for stopping problems in continuous time. Our framework covers discount functions that induce decreasing impatience. Due to the inherent time inconsistency, we look for…

Let $T$ be the map defined on $\N=\{1,2,3, ...\}$ by $T(n) = \frac{n}{2} $ if $n$ is even and by $T(n) = \frac{3n+1}{2}$ if $n$ is odd. Consider the dynamical system $(\N, 2^{\N}, T,\mu)$ where $\mu$ is the counting measure. This dynamical…

We study the stopping time of the Collatz map for a polynomial $f \in \mathbb{F}_2[x]$, and bound it by $O({\rm deg} (f)^{1.5})$, improving upon the quadratic bound proven by Hicks, Mullen, Yucas and Zavislak. We also prove the existence…

D-dimensional constrained systems are studied with stochastic Lagrangian and\break Hamiltonian. It is shown that stochastic consistency conditions are second class constraints and Lagrange multiplier fields can be determined in…

Stochastic interface dynamics serve as mathematical models for diverse time-dependent physical phenomena: the evolution of boundaries between thermodynamic phases, crystal growth, random deposition... Interesting limits arise at large…

In this paper we extend analysis of the WaveHoltz iteration -- a time-domain iterative method for the solution of the Helmholtz equation. We expand the previous analysis of energy conserving problems and prove convergence of the WaveHoltz…

I want to show one possibility to proof the Collatz conjecture, also called 3n+1 conjecture, for any natural number N. For this, I limit my analysis on the direct odd follower of every natural odd number and show the connections between the…

Periodicity analysis of sequences generated by a deterministic system is a long-standing challenge in both theoretical research and engineering applications. To overcome the inevitable degradation of the Logistic map on a finite-precision…

The problem of learning long-term dependencies in sequences using Recurrent Neural Networks (RNNs) is still a major challenge. Recent methods have been suggested to solve this problem by constraining the transition matrix to be unitary…

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…