Searcharxiv⌕ Search

arXiv subjects

Gérard H. E. Duchamp

Publications and source records attributed to Gérard H. E. Duchamp.

11 recordsLinked to original sources

Operational Methods in the Study of Sobolev-Jacobi Polynomials

Inspired by ideas from umbral calculus and based on the two types of integrals occurring in the defining equations for the gamma and the reciprocal gamma functions, respectively, we develop a multi-variate version of umbral calculus and of the so-called umbral image technique. Besides providing a class of new formulae for generalized hypergeometric functions and an implementation of series manipulations for computing lacunary generating functions, our main application of these techniques is the study of Sobolev-Jacobi polynomials. Motivated by applications to theoretical chemistry, we moreover present a deep link between generalized normal-ordering techniques introduced by Gurappa and Panigrahi, two-variable Hermite polynomials and our integral-based series transforms. Notably, we thus calculate all K-tuple L-shifted lacunary exponential generating functions for a certain family of SJ polynomials explicitly.

math-ph↗

Explicit formulae for all higher order exponential lacunary generating functions of Hermite polynomials

For a sequence $P=(p_n(x))_{n=0}^{\infty}$ of polynomials $p_n(x)$, we study the $K$-tuple and $L$-shifted exponential lacunary generating functions $\mathcal{G}_{K,L}(λ;x):=\sum_{n=0}^{\infty}\frac{λ^n}{n!} p_{n\cdot K+L}(x)$, for $K=1,2\dotsc$ and $L=0,1,2\dotsc$. We establish an algorithm for efficiently computing $\mathcal{G}_{K,L}(λ;x)$ for generic polynomial sequences $P$. This procedure is exemplified by application to the study of Hermite polynomials, whereby we obtain closed-form expressions for $\mathcal{G}_{K,L}(λ;x)$ for arbitrary $K$ and $L$, in the form of infinite series involving generalized hypergeometric functions. The basis of our method is provided by certain resummation techniques, supplemented by operational formulae. Our approach also reproduces all the results previously known in the literature.

math-ph↗

(Pure) transcendence bases in $ϕ$-deformed shuffle bialgebras

Computations with integro-differential operators are often carried out in an associative algebra with unit, and they are essentially non-commutative computations. By adjoining a cocommutative co-product, one can have those operators perform act on a bialgebra isomorphic to an enveloping algebra. That gives an adequate framework for a computer-algebra implementation via monoidal factorization, (pure) transcendence bases and Poincaré--Birkhoff--Witt bases. In this paper, we systematically study these deformations, obtaining necessary and sufficient conditions for the operators to exist, and we give the most general cocommutative deformations of the shuffle co-product and an effective construction of pairs of bases in duality. The paper ends by the combinatorial setting of local systems of coordinates on the group of group-like series.

cs.SC↗

Combinatorics of chemical reaction systems

We propose a concise stochastic mechanics framework for chemical reaction systems that allows to formulate evolution equations for three general types of data: the probability generating functions, the exponential moment generating functions and the factorial moment generating functions. This formulation constitutes an intimate synergy between techniques of statistical physics and of combinatorics. We demonstrate how to analytically solve the evolution equations for all six elementary types of single-species chemical reactions by either combinatorial normal-ordering techniques, or, for the binary reactions, by means of Sobolev-Jacobi orthogonal polynomials. The former set of results in particular highlights the relationship between infinitesimal generators of stochastic evolution and parametric transformations of probability distributions.

math-ph↗

The mechanics of shuffle products and their siblings

We carry on the investigation initiated in [15] : we describe new shuffle products coming from some special functions and group them, along with other products encountered in the literature, in a class of products, which we name $φ$-shuffle products. Our paper is dedicated to a study of the latter class, from a combinatorial standpoint. We consider first how to extend Radford's theorem to the products in that class, then how to construct their bi-algebras. As some conditions are necessary do carry that out, we study them closely and simplify them so that they can be seen directly from the definition of the product. We eventually test these conditions on the products mentioned above.

math.CO↗

Finite Decomposition Semigroups

In this paper, we explain the importance of finite decomposition semigroups and present two theorems related to their structure.

math.CO↗

Recipe theorem for the Tutte polynomial for matroids, renormalization group-like approach

Using a quantum field theory renormalization group-like differential equation, we give a new proof of the recipe theorem for the Tutte polynomial for matroids. The solution of such an equation is in fact given by some appropriate characters of the Hopf algebra of isomorphic classes of matroids, characters which are then related to the Tutte polynomial for matroids. This Hopf algebraic approach also allows to prove, in a new way, a matroid Tutte polynomial convolution formula appearing in W. Kook {\it et. al., J. Comb. Series} {\bf B 76} (1999).

math.CO↗

Radford bases and Schützenberger's Factorizations

In this paper, we present Schützenberger's factorization in different combinatorial contexts and show that its validity is not restricted to these cases but can be extended to every Lie algebra endowed with an ordered basis. We also expose some elements of the relations between the Poincaré-Birkhoff-Witt bases of the enveloping algebra and their dual families.

math.CO↗

The Rayleigh-Schrödinger perturbation series of quasi-degenerate systems

We present the first representation of the general term of the Rayleigh-Schrödinger series for quasidegenerate systems. Each term of the series is represented by a tree and there is a straightforward relation between the tree and the analytical expression of the corresponding term. The combinatorial and graphical techniques used in the proof of the series expansion allow us to derive various resummation formulas of the series. The relation with several combinatorial objects used for special cases (degenerate or non-degenerate systems) is established.

quant-ph↗

Sweedler's duals and Schützenberger's calculus

We describe the problem of Sweedler's duals for bialgebras as essentially characterizing the domain of the transpose of the multiplication. This domain is the set of what could be called ``representative linear forms'' which are the elements of the algebraic dual which are also representative on the multiplicative semigroup of the algebra. When the algebra is free, this notion is indeed equivalent to that of rational functions of automata theory. For the sake of applications, the range of coefficients has been considerably broadened, i.e. extended to semirings, so that the results could be specialized to the boolean and multiplicity cases. This requires some caution (use of ``positive formulas'', iteration replacing inversion, stable submodules replacing finite-rank families for instance). For the theory and its applications has been created a rational calculus which can, in return, be applied to harness Sweedler's duals. A new theorem of rational closure and application to Hopf algebras of use in Physics and Combinatorics is provided. The concrete use of this ``calculus'' is eventually illustrated on an example.

math.CO↗

Moderate Growth Time Series for Dynamic Combinatorics Modelisation

Here, we present a family of time series with a simple growth constraint. This family can be the basis of a model to apply to emerging computation in business and micro-economy where global functions can be expressed from local rules. We explicit a double statistics on these series which allows to establish a one-to-one correspondence between three other ballot-like strunctures.

cs.SC↗