Related papers: Construction of normal numbers via pseudo-polynomi…
The Cauchy polynomials with a $q$ parameter were recently defined, and several arithmetical properties were studied. In this paper, we establish explicit formulae for computing the Cauchy polynomials with a $q$ parameter in terms of…
By using p-adic q-integrals, we study the q-Bernoulli numbers and polynomials of higher order.
We prove that digital sequences modulo $m$ along squares are normal, which covers some prominent sequences like the sum of digits in base $q$ modulo $m$, the Rudin-Shapiro sequence and some generalizations. This gives, for any base, a class…
Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…
We propose a new method of constructing q-ary propelinear perfect codes. The approach utilizes permutations of the fixed length q-ary vectors that arise from the automorphisms of the regular subgroups of the affine group. For any prime q it…
A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x]…
A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several…
Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…
This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…
We investigate products of certain double cosets for the symmetric group and use the findings to derive some multiplication formulas for q-Schur superalgebras. This gives a combinatorialisation of the relative norm approach developed by the…
The type-PQ adjacency polytope associated to a simple graph is a $0/1$-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph $G$ is…
Champernowne famously proved that the number $0.(1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)...$ formed by concatenating all the integers one after another is normal base 10. We give a generalization of Champernowne's construction to various…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
We analyze the convergence order of an algorithm producing the digits of an absolutely normal number. Furthermore, we introduce a stronger concept of absolute normality by allowing Pisot numbers as bases, which leads to expansions with…
In this paper, we investigate a specific class of $q$-polynomial sequences that serve as a $q$-analogue of the classical Appell sequences. This framework offers an elegant approach to revisiting classical results by Carlitz and, more…
Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in $\mathbb{F}_{q^2 }$. We construct permutation polynomials over $\mathbb{F}_{q^2}$ by using rational functions of any degree that induce bijections either on $\mu_{q+1}$ or…
In this paper we study the genralized q-Euler numbers and polynomials. From our results, we derive some interesting congruences related tothe generalized q-Euler numbers.
We continue our recent work on averages for ternary additive problems with powers of prime numbers.
Defined by Borel, a real number is normal to an integer base $b$, greater than or equal to $2$, if in its base-$b$ expansion every block of digits occurs with the same limiting frequency as every other block of the same length. We consider…
It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…