Related papers: Generalized Lucas congruences and linear $p$-schem…

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…

Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, Lehmer's generalized Euler numbers are studied to give certain…

Generalized quantum cluster algebras introduced in [1] are quantum deformation of generalized cluster algebras of geometric types. In this paper, we prove that the Laurent phenomenon holds in these generalized quantum cluster algebras. We…

In this paper, we present a new generalization of the Lucas numbers by matrix representation using Genaralized Lucas Polynomials. We give some properties of this new generalization and some relations between the generalized order-k Lucas…

The $LS$-sequences are a parametric family of sequences of points in the unit interval. They were introduced by Carbone, who also proved that under an appropriate choice of the parameters $L$ and $S$, such sequences are low-discrepancy. The…

The classic example of a low-discrepancy sequence in $\mathbb{Z}_p$ is $(x_n) = an+b$ with $a \in \mathbb{Z}_p^x$ and $b \in \mathbb{Z}_p$. Here we address the non-linear case and show that a polynomial $f$ generates a low-discrepancy…

For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…

We give a generalization of Collatz conjecture or 3n+1 problem on 2-adic completion of Q. A isometric of $Q_2$ provides information on the average behavior of the firsts terms of the sequence according to the class of $u_0$ modulo $2^m$. A…

For $A,B\in\mathbb Z$, the Lucas sequence $u_n(A,B)\ (n=0,1,2,\ldots)$ are defined by $u_0(A,B)=0$, $u_1(A,B)=1$, and $u_{n+1}(A,B) = Au_n(A,B)-Bu_{n-1}(A,B)$ $(n=1,2,3,\ldots).$ For any odd prime $p$ and positive integer $n$, we establish…

Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…

We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…

We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.

Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…

Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this…

For a prime $p$ and a positive integer $s$ consider a homogeneous linear system over the ring $\mathbb{Z}_{p^s}$ (the ring of integers modulo $p^s$) described by an $n \times m$-matrix. The possible number of solutions to such a system is…

This paper presents new sequence spaces $X(r, s, t, p ;\Delta)$ for $X \in \{l_\infty(p), c(p), c_0(p), l(p)\}$ defined by using generalized means and difference operator. It is shown that these spaces are complete under a suitable…

We prove a Lucas-type congruence for q-Delannoy numbers.

We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…

Let p be any prime and a be a positive integer. For nonnegative integers l,n and an integer r, the normalized cyclotomic $\psi$-coefficient $${n,r}_{l,p^a}:=p^{-[(n-p^{a-1}-lp^a)/(p^{a-1}(p-1))]} \sum_{k=r(mod p^a)}(-1)^k{n \choose…

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…