Related papers: Periodic Structure of the Exponential Pseudorandom…
Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…
We investigate the iterative behaviour of continuous order preserving subhomogeneous maps that map a polyhedral cone into itself. For these maps we show that every bounded orbit converges to a periodic orbit and, moreover, that there exists…
A somewhat pretentious presentation of number systems (N, Z, Q, R, C, Q_p, >...). The problem of a p-adic characterisation of good-reduction p-adic curves is posed.
According to the Wagstaff heuristic, the probability that a Mersenne number $M_p = 2^p-1$ is prime mainly depends on the size of the exponent $p$. We investigate whether the secondary arithmetic structure in $p-1$ is linked to noticeable…
In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the…
In dynamical systems limit cycles arise as a result of a Hopf bifurcation, after a control parameter has crossed its critical value. In this study we present a constructive method to produce dissipative dynamics which lead to stable…
The crystalline period map is a tool for linearizing $p$-divisible groups. It has been applied to study the Langlands correspondences, and has possible applications to the homotopy groups of spheres. The original construction of the period…
This paper investigates randomness properties of sequences derived from Fibonacci and Gopala-Hemachandra sequences modulo m for use in key distribution applications. We show that for sequences modulo a prime a binary random sequence B(n) is…
In this work, Pseudo-Random Bit Generation (PRBG) based on 2D chaotic mappings of logistic type is considered. The sequences generated with two Pseudorandom Bit Generators (PRBGs) of this type are statistically tested and the computational…
We study decomposable combinatorial labeled structures in the exp-log class, specifically, two examples of type a=1 and two examples of type a=1/2. Our approach is to establish how well existing theory matches experimental data. For…
For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…
We studied the growth of an epitaxial graphene monolayer on Ru(0001). The graphene monolayer covers uniformly the Ru substrate over lateral distances larger than several microns reproducing the structural defects of the Ru substrate. The…
We define the dual of a set of generators of the fundamental group of an oriented two-surface $S_{g,n}$ of genus $g$ with $n$ punctures and the associated surface $S_{g,n}\setminus D$ with a disc $D$ removed. This dual is another set of…
In this paper we study canonical $\gamma$-structures, a class of RNA pseudoknot structures that plays a key role in the context of polynomial time folding of RNA pseudoknot structures. A $\gamma$-structure is composed by specific building…
This work introduces a method for constructing polyphase alternating codes in which the length of a code transmission cycle can be $p^m$ or $p-1$, where $p$ is a prime number and $m$ is a positive integer. The relevant properties leading to…
This paper introduces the \textit{truncator} map as a dynamical system on the space of configurations of an interacting particle system. We represent the symbolic dynamics generated by this system as a non-commutative algebra and classify…
We study scalar multivariate non-stationary subdivision schemes with a general dilation matrix. We characterize the capability of such schemes to reproduce exponential polynomials in terms of simple algebraic conditions on their symbols.…
The periods of polynomials can be used to characterize discrete structures such as algebraic error control codes and feedback shift registers. We study trinomial $x^h+x+1$ over GF(2), which has the maximum number of consecutive zero…
The aim of this work is to establish congruences $\left( \operatorname{mod}p^{2}\right) $ involving the trinomial coefficients $\binom{np-1}{p-1}_{2}$ and $\binom{np-1}{\left( p-1\right)/2}_{2}$ arising from the expansion of the powers of…
Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…