Related papers: The binomial transform of p-recursive sequences an…
In this paper, we consider sums of values of degenerate falling factorials and give a probabilistic proof of a recurrence relation for them. This may be viewed as a degenerate version of the recent probabilistic proofs on sums of powers of…
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
We establish two binomial coefficient--generalized harmonic sum identities using the partial fraction decomposition method. These identities are a key ingredient in the proofs of numerous supercongruences. In particular, in other works of…
There exist many explicit evaluations of Dirichlet series. Most of them are constructed via the same approach: by taking products or powers of Dirichlet series with a known Euler product representation. In this paper we derive a result of a…
We prove that, if dichotomy occurs when the concentration-compactness principle is used, the dichotomizing sequence can be choosen so that a nontrivial part of it concentrates. Iterating this argument leads to a profile decomposition for…
This paper introduces the notion of referring forms as a new metric for analyzing sequential circuits from a functional perspective. Sequential circuits are modeled as causal stream functions, the outputs of which depend solely on the past…
In this paper we present a special formula for transforming integrals to series. The resulting series involves binomial transforms with the Taylor coefficients of the integrand. Five applications are provided for evaluating challenging…
A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…
In this paper, using geometric polynomials, we obtain a generating function of p-Bernoulli numbers. As a consequences this generating function, we derive closed formulas for the finite summation of Bernoulli and harmonic numbers involving…
We consider the semiring of abstract finite dynamical systems up to isomorphism, with the operations of alternative and synchronous execution. We continue searching for efficient algorithms for solving polynomial equations of the form $P(X)…
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…
We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
We study a one-parameter family of binomial-convolution operators acting on sequences. These operators form an additive semigroup with an explicit inverse, and they subsume iterated classical binomial transforms as a special case. We…
In this work, Miller Ross function with bicomplex arguments has been introduced. Various properties of this function including recurrence relations, integral representations and differential relations are established. Furthermore, the…
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…
We prove that every finite dimensional representation of a finite group over a field of characteristic p admits a finite resolution by p-permutation modules. The proof involves a reformulation in terms of derived categories.
We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…
We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…
We present a unified algebraic framework utilizing the formal Bell transform to bridge the Dirichlet convolution of arithmetic functions with the combinatorial structure of infinite Euler-type products. By analyzing the logarithmic…