Related papers: Periodic Structure of the Exponential Pseudorandom…
Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length $s\ell$ with index $s$ over the finite field $\mathbb{F}$ are $\mathbb{F}[y]$-submodules of the ring $\frac{\mathbb{F}[x,y]}{<…
We present a general method to obtain a closed, finite formula for the exponential map from the Lie algebra to the Lie group, for the defining representation of the orthogonal groups. Our method is based on the Hamilton-Cayley theorem and…
We observe the occurrence of a strange nonchaotic attractor in a periodically driven two-dimensional map, formerly proposed as a neuron model and a sequence generator. We characterize this attractor through the study of the Lyapunov…
We propose a class of generating functions denoted by $\textrm{RGF}_p(x)$, which is related to the Sylvester denumerant for the quotients of numerical semigroups. Using MacMahon's partition analysis, we can obtain $\textrm{RGF}_p(x)$ by…
We consider pseudo-unitary quantum systems and discuss various properties of pseudo-unitary operators. In particular we prove a characterization theorem for block-diagonalizable pseudo-unitary operators with finite-dimensional diagonal…
The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.
We study the class of idempotent-generated pseudo-composition algebras, which is a subclass of the family of axial algebras. More specifically, we utilise the group-algebra correspondence, natural to the axial framework in order to study…
In this paper, we prove that a pseudoexponential field has continuum many non-isomorphic countable real closed exponential subfields, each with an order preserving exponential map which is surjective onto the nonnegative elements. Indeed,…
In this paper, a new pseudorandom number generator (PRNG) based on the logistic map has been proposed. To prevent the system to fall into short period orbits as well as increasing the randomness of the generated sequences, the proposed…
In this paper we study the one dimensional random geometric graph when the location of the nodes are independent and exponentially distributed. We derive exact results and the limit theorems for the connectivity and other properties…
We study the arithmetic complexity of hitting set generators, which are pseudorandom objects used for derandomization of the polynomial identity testing problem. We give new explicit constructions of hitting set generators whose outputs are…
We consider Riordan arrays $\bigl(1/(1-t^{d+1}), ~ tp(t)\bigr)$. These are infinite lower triangular matrices determined by the formal power series $1/(1-t^{d+1})$ and a polynomial $p(t)$ of degree $d$. Columns of such matrix are eventually…
The behavior of a family of dissipative dynamical systems representing transformations of two-dimensional torus is studied on a discrete lattice and compared with that of conservative hyperbolic automorphisms of the torus. Applying…
Let $F$ be a field of non-zero characteristic $p$, let $G$ be a cyclic group of order $q =p^a$ for some positive integer $a$, and let $U$ and $W$ be indecomposable $F G$-modules. We identify a generator for each of the indecomposable…
This paper introduces a group-theoretic framework to analyze the algebraic structure of the Grover walk on a complete graph with self-loops. We construct a group generated by the Grover matrix and a diagonal matrix whose entries are powers…
Chaotic dynamics is an important source for generating pseudorandom binary sequences (PRNS). Much efforts have been devoted to obtaining period distribution of the generalized discrete Arnold's Cat map in various domains using all kinds of…
Exponential family plays an important role in information geometry. In arXiv:1811.01394, we introduced a method to construct an exponential family $\mathcal{P}=\{p_\theta\}_{\theta\in\Theta}$ on a homogeneous space $G/H$ from a pair…
We consider exponential ultradistribution semigroups with non--densely defined generators and give structural theorems for ultradistribution semigroups. Also structural theorems for exponential ultradistribution semigroups are given.
We show that functions of type $X_n = P[Z^n]$, where $P[t]$ is a periodic function and $Z$ is a generic real number, can produce sequences such that any string of values $X_{s}, X_{s+1}, ...,X_{s+m}$ is deterministically independent of past…
We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…