Related papers: The binomial transform of p-recursive sequences an…
In this paper, we introduce a new class of subsets of bounded linear operators between Banach spaces which is p-version of the uniformly completely continuous sets. Then, we study the relationship between these sets with the equicompact…
We investigate the asymptotic number of elements of size $n$ in a particular class of closed lambda-terms (so-called $BCI(p)$-terms) which are related to axiom systems of combinatory logic. By deriving a differential equation for the…
In this paper we propose a new approach for developing a proof that P=NP. We propose to use a polynomial-time reduction of a NP-complete problem to Linear Programming. Earlier such attempts used polynomial-time transformation which is a…
The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].
We prove two transformations for the $p$-adic hypergeometric functions which can be described as $p$-adic analogues of a Euler's transformation and a transformation of Clausen. We first evaluate certain character sums, and then relate them…
The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.
Differentially-algebraic (D-algebraic) functions are solutions of polynomial equations in the function, its derivatives, and the independent variables. We revisit closure properties of these functions by providing constructive proofs. We…
In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
We study the structure of multiple correlation sequences defined by measure preserving actions of commuting transformations. When the iterates of the transformations are integer polynomials we prove that any such correlation sequence is the…
The Segal conjecture describes stable maps between classifying spaces in terms of (virtual) bisets for the finite groups in question. Along these lines, we give an algebraic formula for the p-completion functor applied to stable maps…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…
We develop a systematic and fully explicit approach to the evaluation of binomial sums involving reciprocals of binomial coefficients based on Beta integral techniques. Starting from a simple integral representation, we provide a derivation…
In this paper, we consider the matrix polynomial obtained by using bi-periodic Fibonacci matrix polynomial. Then, we give some properties and binomial transforms of the new matrix polynomials.
We define the deformed $(s,t)$-binomial formula and the deformed Newton $(s,t)$-binomial series, and we will use it to establish the generating functions of the generalized central binomial coefficients and the generalized Catalan numbers.
We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…
We study the Fourier transform windowed by a bump function. We transfer Jackson's classical results on the convergence of the Fourier series of a periodic function to windowed series of a not necessarily periodic function. Numerical…
We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…