Related papers: Short Cycles in Repeated Exponentiation Modulo a P…

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

We study in detail the role of short-cuts in promoting the emergence of cooperation in a network of agents playing the Prisoner's Dilemma Game (PDG). We introduce a model whose topology interpolates between the one-dimensional euclidean…

Parametric modulation in nonlinear dynamical systems can give rise to attractors on which the dynamics is aperiodic and nonchaotic, namely with largest Lyapunov exponent being nonpositive. We describe a procedure for creating such…

Self-regulatory models are common in nature, as described e.g. in (\cite{mur}), (\cite{ha}) and (\cite{Gb}).\\ Let us consider a system made up of a number of glands as a motivation. Each gland secretes a hormone that allows secretion in…

We present a constant and a recursive relation to define a sequence $f_n$ such that the floor of $f_n$ is the $n$th prime. Therefore, this constant generates the complete sequence of primes. We also show this constant is irrational and…

We show that the probability distribution function that best fits the distribution of return times between two consecutive visits of a chaotic trajectory to finite size regions in phase space deviates from the exponential statistics by a…

A classical problem in analytic number theory is to study the distribution of $\alpha p$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes $p$ such that $p+2$ is…

We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…

If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…

We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes $p$ in a dyadic interval $[Q,2Q]$ for which a given interval $[u+1,u+\psi(Q)]$ does not contain a quadratic non-residue modulo $p$. The bound…

For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the…

In this paper we investigate the growth rate of the number of all possible paths in graphs with respect to their length in an exact analytical way. Apart from the typical rates of growth, i.e. exponential or polynomial, we identify…

This paper proposes a computational method for obtaining the length of the cycle that arises from the Fibonacci series taken mod m (some number) and mod p (some prime number).

The Erdos-Kac theorem, a foundational result in probabilistic number theory, states that the number of prime factors of an integer follows a Gaussian distribution. In this paper we develop and analyze probabilistic models for "random…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

For a probability measure preserving dynamical system $(\mathcal{X},f,\mu)$, the Poincar\'e Recurrence Theorem asserts that $\mu$-almost every orbit is recurrent with respect to its initial condition. This motivates study of the statistics…

We study the lower and upper local rates of Poincare recurrence of rotations on the circle by means of symbolic dynamics. As a consequence, we show that if the lower rate of Poincare recurrence of an ergodic dynamical system (X,F,mu,T) is…

This is a paper with two aims. First, we show that the map from $\mathbb{Z}/p\mathbb{Z}$ to itself defined by exponentiation $x\to m^x$ has few $3$-cycles -- that is to say, the number of cycles of length three is $o(p)$. This improves on…

Projection methods provide an appealing way to construct reduced-order models of large-scale linear dynamical systems: they are intuitively motivated and fairly easy to compute. Unfortunately, the resulting reduced models need not inherit…

Many complex systems can be reduced to their key components through spectrally decomposing matrices that capture their dynamics. These matrices can in turn be constructed from data, often by least-squares fitting: examples of algorithms to…