相关论文: Numeration systems as dynamical systems -- introdu…

In this work, we address the numerical identification of entanglement in dynamical scenarios. To this end, we consider different programs based on the restriction of the evolution to the set of separable (i.e., non-entangled) states,…

Dual numbers and their higher order version are important tools for numerical computations, and in particular for finite difference calculus. Based upon the relevant algebraic rules and matrix realizations of dual numbers, we will present a…

In this article, the operator approach to modeling numeral systems is introduced. This approach can be useful for coding information and providing computer protection. Certain examples of such numeral systems are considered. In addition,…

We introduce a class dynamical systems called $G$-systems equipped with a coupling operation. We use $G$-systems to define the notions of dependence (borrowed from dependence logic) and causality (borrowed from Pearl) for dynamical systems.…

Topological data analysis (TDA) is a fast-growing field that utilizes advanced tools from topology to analyze large-scale data. A central problem in topological data analysis is estimating the so-called Betti numbers of the underlying…

The ergodic decomposition theorem is a cornerstone result of dynamical systems and ergodic theory. It states that every invariant measure on a dynamical system is a mixture of ergodic ones. Here we formulate and prove the theorem in terms…

As dynamic and control systems become more complex, relying purely on numerical computations for systems analysis and design might become extremely expensive or totally infeasible. Computer algebra can act as an enabler for analysis and…

Substitution systems evolve in time by generating sequences of symbols from a finite alphabet: At a certain iteration step, the existing symbols are systematically replaced by blocks of $N_{k}$ symbols also within the alphabet (with…

Nested Sampling is a method for computing the Bayesian evidence, also called the marginal likelihood, which is the integral of the likelihood with respect to the prior. More generally, it is a numerical probabilistic quadrature rule. The…

In a previous article, we extended the notion of ergodic optimization to the setting of C*-dynamical systems of countable discrete groups. Among the key results of that paper was that given an action $G \stackrel{\Xi}{\curvearrowright}…

Let $f:T\longrightarrow T$ be a mapping and $\Omega$ be a subset of $T$ which intersects every (positive) orbit of $f$. Assume that there are given a second dynamical system $\lambda:Y\longrightarrow Y$ and a mapping…

Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…

A graph $G$ is defined encapsulating the number theoretic notion of the Fundamental Theorem of Arithmetic. We then provide a graph theoretic approach to the fundamental results on the coprimality of two natural numbers, through the use of…

In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…

Modified Hamiltonians are used in the field of geometric numerical integration to show that symplectic schemes for Hamiltonian systems are accurate over long times. For nonlinear systems the series defining the modified Hamiltonian usually…

We establish several new probabilistic, dynamical, dimensional and number theoretical phenomena connected with Ostrogradsky-Sierpi\'nski-Pierce expansion. First of all, we develop metric, ergodic and dimensional theories of the…

Digital System Research has pioneered the mathematics and design for a new class of computing machine using residue numbers. Unlike prior art, the new breakthrough provides methods and apparatus for general purpose computation using several…

Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…

We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…

When numerically integrating canonical Hamiltonian systems, the long-term conservation of some of its invariants, among which the Hamiltonian function itself, assumes a central role. The classical approach to this problem has led to the…