Related papers: Generalized Cauchy identities, trees and multidime…
We elaborate on the recent suggestion to consider averaging of Cauchy identities for the Schur functions over power sum variables. This procedure has apparent parallels with the Borel transform, only it changes the number of combinatorial…
Recently, Komastu introduced the concept of poly-Cauchy numbers and polynomials which generalize Cauchy numbers and polynomials. In this paper, we introduce new generaliza- tion of poly-Cauchy and poly-Bernoulli numbers and polynomials.…
The Peters polynomials are a generalization of Boole polynomials. In this paper, we consider Peters and poly-Cauchy mixed type polynomials and investigate the properties of those polynomials which are derived from umbral calculus. Finally,…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…
A novel computational model (CoDD) utilizing combinatory logic to create higher-order decision trees is presented. A theoretical analysis of general intelligence in terms of the formal theory of pattern recognition and pattern formation is…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…
Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
Existence and uniqueness of advanced and retarded fundamental solutions (Green's functions) and of global solutions to the Cauchy problem is proved for a general class of first order linear differential operators on vector bundles over…
In the paper, the authors analytically generalize the Catalan numbers in combinatorial number theory, establish an integral representation of the analytic generalization of the Catalan numbers by virtue of Cauchy's integral formula in the…
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…
We present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine…
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.
We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…
Recently, Andrews and EI Bachraoui discovered several companions for some famous $q$-series formulas, and derived some new identities involving partitions and overpartitions with distinct parts. In this paper, we shall refine their results…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…