In this note, we estimate the distance between two $q$-nomial coefficients $\left|{\left(\genfrac{}{}{0pt}{}{n}{k}\right)}_q-{\left(\genfrac{}{}{0pt}{}{n^{\text{'}}}{k^{\text{'}}}\right)}_q\right|$, where $(n,k)\ne (n^{\text{'}},k^{\text{'}})$ and $q\ge 2$ is an integer.

The study of class number invariants of absolute abelian fields, the investigation of congruences for special values of L-functions, Fourier coefficients of half-integral weight modular forms, Rubin's congruences involving the special values of L-functions of elliptic curves with complex multiplication, and many other problems require congruence properties of the generalized Bernoulli numbers (see [16]-[18], [12], [29], [3], etc.). The first steps in this direction can be found in the papers of...

Known results on the generalized Davenport constant relating zero-sum sequences over a finite abelian group are extended for the generalized Noether number relating rings of polynomial invariants of an arbitrary finite group. An improved general upper degree bound for polynomial invariants of a non-cyclic finite group that cut out the zero vector is given.

Let G be a finite cyclic group. Every sequence S over G can be written in the form $S=\left(n₁g\right)·...·\left(n_{l}g\right)$ where g ∈ G and $n₁,...,n_{l}i\in [1,ord\left(g\right)]$, and the index ind(S) is defined to be the minimum of $(n₁+\cdots +n_l)/ord\left(g\right)$ over all possible g ∈ G such that ⟨g⟩ = G. A conjecture says that every minimal zero-sum sequence of length 4 over a finite cyclic group G with gcd(|G|,6) = 1 has index 1. This conjecture was confirmed recently for the case when |G| is a product of at most two prime powers. However, the general case is still open. In this paper, we make some...

Let $k\ge 2$ and define $F^{\left(k\right)}:={\left(F_n^{\left(k\right)}\right)}_{n\ge 0}$, the $k$-generalized Fibonacci sequence whose terms satisfy the recurrence relation $F_n^{\left(k\right)}=F_{n-1}^{\left(k\right)}+F_{n-2}^{\left(k\right)}+\cdots +F_{n-k}^{\left(k\right)}$, with initial conditions $0,0,\cdots ,0,1$ ($k$ terms) and such that the first nonzero term is $F_1^{\left(k\right)}=1$. The sequences $F:=F^{\left(2\right)}$ and $T:=F^{\left(3\right)}$ are the known Fibonacci and Tribonacci sequences, respectively. In 2005, Noe and Post made a conjecture related to the possible solutions of the Diophantine equation $F_n^{\left(k\right)}=F_m^{\left(\ell \right)}$. In this note, we use transcendental tools to provide a general method for finding the intersections $F^{\left(k\right)}\cap F^{\left(m\right)}$ which gives evidence supporting...