Results 21 to 30 of about 927 (105)
Barker sequences of odd length [PDF]
A Barker sequence is a binary sequence for which all nontrivial aperiodic autocorrelations are at most 1 in magnitude. An old conjecture due to Turyn asserts that there is no Barker sequence of length greater than 13.
Schmidt, Kai-Uwe, Willms, Jürgen
core +1 more source
Some identities related to degenerate Stirling numbers of the second kind
The degenerate Stirling numbers of the second kind were introduced as a degenerate version of the ordinary Stirling numbers of the second kind. They appear very frequently when one studies various degenerate versions of some special numbers and ...
Kim Taekyun, Kim Dae San, Kim Hye Kyung
doaj +1 more source
Flat primes and thin primes [PDF]
A number is called upper (lower) flat if its shift by +1 ( −1) is a power of 2 times a squarefree number. If the squarefree number is 1 or a single odd prime then the original number is called upper (lower) thin. Upper flat numbers which are primes arise
Broughan, Kevin A., Zhou, Qizhi
core +2 more sources
Compositions of positive integers with 2s and 3s
In this article, we consider compositions of positive integers with 2s and 3s. We see that these compositions lead us to results that involve Padovan numbers, and we give some tiling models of these compositions.
Dişkaya Orhan, Menken Hamza
doaj +1 more source
Differential equations associated with generalized Bell polynomials and their zeros
In this paper, we study differential equations arising from the generating functions of the generalized Bell polynomials.We give explicit identities for the generalized Bell polynomials.
Ryoo Seoung Cheon
doaj +1 more source
Representations by degenerate Daehee polynomials
In this paper, we consider the problem of representing any polynomial in terms of the degenerate Daehee polynomials and more generally of the higher-order degenerate Daehee polynomials.
Kim Taekyun +3 more
doaj +1 more source
Formal inverses of the generalized Thue-Morse sequences and variations of the Rudin-Shapiro sequence [PDF]
A formal inverse of a given automatic sequence (the sequence of coefficients of the composition inverse of its associated formal power series) is also automatic.
Łukasz Merta
doaj +1 more source
On sequences without geometric progressions
An improved upper bound is obtained for the density of sequences of positive integers that contain no k-term geometric progression.Comment: 4 pages; minor ...
Nathanson, Melvyn B., O'Bryant, Kevin
core +1 more source
The group inverse of circulant matrices depending on four parameters
Explicit expressions for the coefficients of the group inverse of a circulant matrix depending on four complex parameters are analytically derived. The computation of the entries of the group inverse are now reduced to the evaluation of a polynomial ...
Carmona A. +3 more
doaj +1 more source
Some recurrence formulas for the Hermite polynomials and their squares
In this paper, by making use of the generating function methods and Padé approximation techniques, we establish some new recurrence formulas for the Hermite polynomials and their squares.
He Yuan, Yang Fengzao
doaj +1 more source

