Related papers: Ducci on $\mathbb{Z}_m^3$ and the Max Period
Periods are defined as integrals of semialgebraic functions defined over the rationals. Periods form a countable ring not much is known about. Examples are given by taking the antiderivative of a power series which is algebraic over the…
We give a lattice theory treatment of certain one and two dimensional quantum field theories. In one dimension we construct a combinatorial version of a non-trivial field theory on the circle which is of some independent interest in itself…
For odd n>=3, we consider a general hypothetical identity for the differences S_{n,0}(x) of multiples of n with even and odd digit sums in the base n-1 in interval [0,x), which we prove in the cases n=3 and n=5 and empirically confirm for…
We study random spatial permutations on Z^3 where each jump x -> \pi(x) is penalized by a factor exp(-T ||x-\pi(x)||^2). The system is known to exhibit a phase transition for low enough T where macroscopic cycles appear. We observe that the…
We construct an increasing sequence of natural numbers $(m_n)_{n=1}^{+\infty}$ with the property that $(m_n \th [1])_{n\geq 1}$ is dense in $\T$ for any $\th \in \R\setminus \Q$, and a continuous measure on the circle $\mu$ such that…
A criterion to obtain frequent hypercyclicity for a sequence of convolution operators on the space of entire functions on the complex plane is provided. The criterion involves that the generating functions of the operators do not vanish on…
The Collatz problem is related to the fixed point problem, and is widely used in mathematics. It has attracted a wide range of math enthusiasts, but is still difficult to solve. So, this article aimed to study the extension of the Collatz…
We consider perturbed pendulum-like equations on the cylinder of the form $ \ddot x+\sin(x)= \varepsilon \sum_{s=0}^{m}{Q_{n,s} (x)\, \dot x^{s}}$ where $Q_{n,s}$ are trigonometric polynomials of degree $n$, and study the number of limit…
Let n be a non-null positive integer and $d(n)$ is the number of positive divisors of n, called the divisor function. Of course, $d(n) \leq n$. $d(n) = 1$ if and only if $n = 1$. For $n > 2$ we have $d(n) \geq 2$ and in this paper we try to…
Dean conjectured three decades ago that every graph with minimum degree at least $k\ge 3$ contains a cycle whose length is divisible by $k$. While the conjecture has been verified for $k\in \{3,4\}$, it remains open for $k\ge 5$. A weaker…
The aim of this paper is to investigate the dynamics of a higher order system of rational difference equations. Our concentration is on boundedness character, the oscillatory, the existence of unbounded solutions and the global behavior of…
Let ${\Bbb Z}_{m}$ be the additive group of residue classes modulo $m$ and $s(m_{1},m_{2})$ denote the number of subgroups of the group ${\Bbb Z}_{m_{1}}\times {\Bbb Z}_{m_{2}}$, where $m_{1}$ and $m_{2}$ are arbitrary positive integers. We…
It is shown that an arbitrary function from $D\subset \R^n$ to $\R^m$ will become $C^{0,\alpha}$-continuous in almost every $x\in D$ after restriction to a certain subset with limit point $x$. For $n\geq m$ differentiability can be…
The $\phi^4_3$ model at finite temperature is simulated on the lattice. For fixed $N_t$ we compute the transition line for $N_s \to \infty$ by means of Finite Size Scaling techniques. The crossings of a Renormalization Group trajectory with…
The Hamiltonian cycle problem in digraph is mapped into a matching cover bipartite graph. Based on this mapping, it is proved that determining existence a Hamiltonian cycle in graph is $O(n^3)$.
In this work the generalized Collatz problem $qn+1$ ($q$ odd) is studied. As a natural generalization of the original $3n+1$ problem, it consists of a discrete dynamical system of an arithmetical kind. Using standard methods of number…
In this work we investigate the dynamics of the nonlinear DDE (delay-differential equation) x''(t)+x(t-T)+x(t)^3=0 where T is the delay. For T=0 this system is conservative and exhibits no limit cycles. For T>0, no matter how small, an…
It is known that $\Theta(\log n)$ chords must be added to an $n$-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, $\Theta(n)$ chords are required. A possibly `intermediate'…
A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and…
On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…