Related papers: Sequences, q-Multinomial Identities, Integer Parti…

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.

We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…

Using techniques from the theories of convex polytopes, lattice paths, and indirect influences on directed manifolds, we construct continuous analogues for the binomial coefficients and the Catalan numbers. Our approach for constructing…

We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…

We introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…

We will prove an identity involving refined $q$-trinomial coefficients. We then extend this identity to two infinite families of doubly bounded polynomial identities using transformation properties of the refined $q$-trinomials in an…

In this paper, we examine the unimodality and strict unimodality of certain formal bivariate Laurent series with non-negative coefficients. We show that the sets of these formal bivariate Laurent series form commutative semirings under the…

The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…

Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…

In this paper we study the action of a generalization of the Binomial interpolated operator on the set of linear recurrent sequences. We find how the zeros of characteristic polynomials are changed and we prove that a subset of these…

We prove polynomial identities for the N=1 superconformal model SM(2,4\nu) which generalize and extend the known Fermi/Bose character identities. Our proof uses the q-trinomial coefficients of Andrews and Baxter on the bosonic side and a…

Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…

Natural q analogues of classical statistics on the symmetric groups $S_n$ are introduced; parameters like: the q-length, the q-inversion number, the q-descent number and the q-major index. MacMahon's theorem about the equi-distribution of…

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

Bliem and Kousidis (arXiv:1109.4624) recently considered a family of random variables whose distributions are given by the generalized Galois numbers (after normalization). We give probabilistic interpretations of these random variables,…

The Factorial Basis method, initially designed for quasi-triangular, shift-compatible factorial bases, provides solutions to linear recurrence equations in the form of definite-sums. This paper extends the Factorial Basis method to its…

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…

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…

We provide combinatorial proofs of some of the q-series identities considered by Andrews, Jimenez-Urroz and Ono [q-series identities and values of certain $L$-functions. Duke Math. J. 108 (2001), no. 3, 395--419].