Related papers: Linear complexity and trace representation of quat…
In this paper, we have proved four theorems on the degree of approximation of continuous functions by matrix means of their Fourier series which is expressed in terms of the modulus of continuity and a non-negative mediate function.
We begin with (densely-defined) fractional linear transformations (FLT) on (some) Banach algebras and their relatives. This leads to Wedderburn's continued fractions (recursively-defined noncommutative polynomials) for any ring. Along the…
Let $\mathbb{F}_q$ be a finite field of cardinality $q$, where $q$ is a power of a prime number $p$, $t\geq 2$ an even number satisfying $t \not\equiv 1 \;(\bmod \;p)$ and $\mathbb{F}_{q^t}$ an extension field of $\mathbb{F}_q$ with degree…
We present in this paper some fundamental tools for developing matrix analysis over the complex quaternion algebra. As applications, we consider generalized inverses, eigenvalues and eigenvectors, similarity, determinants of complex…
This work is devoted to the study of representations of finite subgroups of the group of units of quaternion division algebras over a global or local field arising from the inclusion via extension of scalars splitting the algebra. Following…
Based on the definition of the Fourier transform in terms of the number operator of the quantum harmonic oscillator and in the corresponding definition of the fractional Fourier transform, we have obtained the discrete fractional Fourier…
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…
We propose a novel quaternion product unit (QPU) to represent data on 3D rotation groups. The QPU leverages quaternion algebra and the law of 3D rotation group, representing 3D rotation data as quaternions and merging them via a weighted…
An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by…
In this short note we use the presentations found in \cite{MP} and \cite{Po} to show that the Picard modular groups ${\rm PU}(2,1,\mathcal{O}_d)$ with $d=1,3,7$ (respectively the quaternion hyperbolic lattice ${\rm PSp}(2,1,\mathcal{H})$…
V.I. Arnold has recently defined the complexity of a sequence of $n$ zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtained for almost most complicated sequences of elements of a…
Employing the Fast Fourier Transform we propose a ready-to-use solution to circulant real linear systems of equations, particularly useful when a broader theoretical analysis is involved. We also show that strict diagonal dominance of the…
In this contribution we generalize the classical Fourier Mellin transform [S. Dorrode and F. Ghorbel, Robust and efficient Fourier-Mellin transform approximations for gray-level image reconstruction and complete invariant description,…
In this article, we construct infinite families of quaternary (that is, over the ring $\mathbb{Z}_4$) $\mathcal{C}_{D}$-codes, where the defining set $D$ is derived utilizing a two-generator simplicial complex, and determine their Lee…
Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a…
In this paper we study odd unimodal and odd strongly unimodal sequences. We use $q$-series methods to find several fundamental generating functions. Employing the Euler--Maclaurin summation formula we obtain the asymptotic main term for…
New generalized cyclotomic binary sequences of period $p^2$ are proposed in this paper, where $p$ is an odd prime. The sequences are almost balanced and their linear complexity is determined. The result shows that the proposed sequences…
I discuss the nature of a Fractional Discrete Fourier Transform (FrDFT) described algorithmically by a combination of chirp transforms and ordinary DFTs. The transform is shown to be consistent with a continuous two-dimensional rotation…
In [4] and [5], Folsom presents a family of modular units as higher-level analogues of the Rogers-Ramanujan $q$-continued fraction. These units are constructed from analytic solutions to the higher-order $q$-recurrence equations of Selberg.…
The representation theory of semisimple algebraic groups over the complex numbers (equivalently, semisimple complex Lie algebras or Lie groups, or real compact Lie groups) and the question of whether a given representation is symplectic or…