Results 51 to 60 of about 868 (82)
Some identities on derangement and degenerate derangement polynomials
In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number.
AM Garsia +14 more
core +1 more source
Supercongruences satisfied by coefficients of 2F1 hypergeometric series [PDF]
Recently, Chan, Cooper and Sica conjectured two congruences for coefficients of classical 2F1 hypergeometric series which also arise from power series expansions of modular forms in terms of modular functions.
Chan, Heng Huat +3 more
core
Fully degenerate poly-Bernoulli numbers and polynomials
In this paper, we introduce the new fully degenerate poly-Bernoulli numbers and polynomials and inverstigate some properties of these polynomials and numbers.
Kim Taekyun, Kim Dae San, Seo Jong-Jin
doaj +1 more source
Generalized Chebyshev Polynomials
Let h(x) be a non constant polynomial with rational coefficients. Our aim is to introduce the h(x)-Chebyshev polynomials of the first and second kind Tn and Un. We show that they are in a ℚ-vectorial subspace En(x) of ℚ[x] of dimension n.
Abchiche Mourad, Belbachir Hacéne
doaj +1 more source
On the number of outer connected dominating sets of graphs
Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $V\backslash S$ is a connected graph.
Akhbari, Mohammad H. +2 more
core
The Yellowstone Permutation [PDF]
Define a sequence of positive integers by the rule that a(n) = n for 1
Applegate, David L. +5 more
core
Fourier series of functions involving higher-order ordered Bell polynomials
In 1859, Cayley introduced the ordered Bell numbers which have been used in many problems in number theory and enumerative combinatorics. The ordered Bell polynomials were defined as a natural companion to the ordered Bell numbers (also known as the ...
Kim Taekyun +3 more
doaj +1 more source
Carmichael numbers composed of Piatetski-Shapiro primes in Beatty sequences
The Piatetski-Shapiro sequences are sequences of the form (⌊nc⌋)n=1∞{\left(\lfloor {n}^{c}\rfloor )}_{n=1}^{\infty } and the Beatty sequence is the sequence of integers (⌊αn+β⌋)n=1∞{(\lfloor \alpha n+\beta \rfloor )}_{n=1}^{\infty }.
Qi Jinyun, Guo Victor Zhenyu
doaj +1 more source
The study of special functions has become an enthralling area in mathematics because of its properties and wide range of applications that are relevant into other fields of knowledge.
Corcino Cristina B. +2 more
doaj +1 more source
On the integral values of a curious recurrence
We discuss a problem initially thought for the Mathematical Olympiad but which has several interpretations. The recurrence sequences involved in this problem may be generalized to recurrence sequences related to a much larger set of diophantine ...
Dvornicich, Roberto +2 more
core

