Related papers: Cycles in Repeated Exponentiation Modulo $p^n$
We consider large-dimensional dynamical systems involving a linear force and a random force comprising both potential and non-conservative contributions. Such systems are known to exhibit a topological trivialization phase transition as the…
It is shown how regular model sets can be characterized in terms of regularity properties of their associated dynamical systems. The proof proceeds in two steps. First, we characterize regular model sets in terms of a certain map $\beta$…
We compute the motivic nearby cycles of functions obtained by composition with a polynomial which is non-degenerate with respect to its Newton polyhedron. Our result involves new convolution operators and generalized nearby cycles.
The Douglas-Rachford (DR) algorithm is an iterative procedure that uses sequential reflections onto convex sets and which has become popular for convex feasibility problems. In this paper we propose a structural generalization that allows…
We prove a recursive formula for the exterior and symmetric powers of modules for a cyclic 2-group. This makes computation straightforward. Previously, a complete description was only known for cyclic groups of prime order.
Let $R=\mathbb{Z}_4+u\mathbb{Z}_4,$ where $\mathbb{Z}_4$ denotes the ring of integers modulo $4$ and $u^2=0$. In the present paper, we introduce a new Gray map from $R^n$ to $\mathbb{Z}_{4}^{2n}.$ We study $(1+2u)$-constacyclic codes over…
This paper is concerned with a duality between $r$-regular permutations and $r$-cycle permutations, and a monotone property due to B\'ona-McLennan-White on the probability $p_r(n)$ for a random permutation of $\{1,2,\ldots, n\}$ to have an…
A precise meaning is given to the notion of continuous iteration of a mapping. Usual discrete iterations are extended into a dynamical flow which is a homotopy of them all. The continuous iterate reveals that a dynamical map is formend by…
Open dynamical systems are mathematical models of machines that take input, change their internal state, and produce output. For example, one may model anything from neurons to robots in this way. Several open dynamical systems can be…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
The multiple futile cycle is a phosphorylation system in which a molecular substrate might be phosphorylated sequentially n times by means of an enzymatic mechanism. The system has been studied mathematically using reaction network theory…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
In this work we consider families of smooth vector fields having a persistent polycycle with $n$ hyperbolic saddles. We derive the asymptotic expansion of the return map associated to the polycycle, determining explicitly its leading terms.…
Let $G$ be a graph of radius $r$ and diameter $d$ with $d\leq 2r-2$. We give a new proof that $G$ contains a cycle of length at least $4r-2d$, i.e. for its circumference it holds $c(G)\geq 4r-2d$.
In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of…
An $n\times n$ matrix $M=[m_{ij}]$ with $m_{ij}\in U_n=\{1,2,\ldots,n\}$ will be called a cycle matrix if $(U_n,\cdot)$ is a cycle set, where $i\cdot j=m_{ij}$. We study these matrices in this article. Using these matrices, we give some…
We introduce and study an extension of the classical elapsed time equation in the context of neuron populations that are described by the elapsed time since the last discharge, i.e., the refractory period. In this extension we incorporate…
We present a new solution for fundamental problems in nonlinear dynamical systems: finding, verifying, and stabilizing cycles. The solution we propose consists of a new control method based on mixing previous states of the system (or the…
Analyzing the dynamics of open quantum systems has a long history in mathematics and physics. Depending on the system at hand, basic physical phenomena that one would like to explain are, for example, convergence to equilibrium, the…
We consider the dynamical system described by the area--preserving standard mapping. It is known for this system that $P(t)$, the normalized number of recurrences staying in some given domain of the phase space at time $t$ (so-clled…