Related papers: Construction of normal numbers via pseudo-polynomi…

This paper describes several classical constructions of thin bases of finite order in additive number theory, and, in particular, gives a complete presentation of a beautiful construction of J. W. S. Cassels of a class of polynomially…

We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.

We obtain new explicit formulas for the recurrence coefficients of the q-orthogonal polynomial sequences in a class that extends the q-Askey scheme. Our formulas express the recurrence coefficients in terms of four parameters that determine…

The classical Eulerian polynomials can be expanded in the basis $t^{k-1}(1+t)^{n+1-2k}$ ($1\leq k\leq\lfloor (n+1)/2\rfloor$) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian…

In this paper we collect some results about arithmetic progressions of higher order, also called polynomial sequences. Those results are applied to $(m,q)$-isometric maps.

We prove that the set of normalized differences between primes, defined as $S = \{(p-q)/(p+q) : p > q \text{ are primes}\}$, is dense in the open unit interval $(0,1)$. Our proof provides an explicit construction algorithm with quantitative…

Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of $q$-ary linear codes with two or three weights from vectorial…

In this paper, we present some criteria for the $2$-$q$-log-convexity and $3$-$q$-log-convexity of combinatorial sequences, which can be regarded as the first column of certain infinite triangular array $[A_{n,k}(q)]_{n,k\geq0}$ of…

In this short note, we give a proof, conditional on the Generalized Riemann Hypothesis, that there exist numbers x which are normal with respect to the continued fraction expansion but not to any base b expansion. This partially answers a…

We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

Large sets of equiangular lines are constructed from sets of mutually unbiased bases, over both the complex and the real numbers.

We present a detailed and elementary construction of the real numbers from the rational numbers a la Bourbaki. The real numbers are defined to be the set of all minimal Cauchy filters in $\mathbb{Q}$ (where the Cauchy condition is defined…

The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…

We construct the new q-extension of Bernoulli numbers and polynomials in this paper. Finally we consider the q-zeta functions which interpolate the new q-extension of Bernoulli numbers and polynomials.

In this paper we get two new classes of regular sequences in the polynomial ring over the field of complex numbers.

The purpose of this paper is to define generalized twisted q-Bernoulli numbers by using p-adic q-integrals. Furthermore, we construct a q-analogue of the p-adic generalized twisted L-functions which interpolate generalized twisted…

We introduce poly-Cauchy permutations that are enumerated by the poly-Cauchy numbers. We provide combinatorial proofs for several identities involving poly-Cauchy numbers and some of their generalizations. The aim of this work is to…

With the help of a summation of basic hypergeometric series, the creative microscoping method recently introduced by Guo and Zudilin, and the Chinese remainder theorem for coprime polynomials, we find some new $q$-supercongruences.…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…