Related papers: Andre Permutation Calculus; a Twin Seidel Matrix S…

In this paper, we study some Euler-Ap\'ery-type series which involve central binomial coefficients and (generalized) harmonic numbers. In particular, we establish elegant explicit formulas of some series by iterated integrals and…

We construct explicitly groups associated to specific ternary algebras which extend the Lie (super)algebras (called Lie algebras of order three). It turns out that the natural variables which appear in this construction are variables which…

It is well known that the $(-1)$-evaluation of the enumerator polynomials of permutations (resp. derangements) by the number of excedances gives rise to tangent numbers (resp. secant numbers). Recently, two distinct $q$-analogues of the…

An index transform, involving the square of Whittaker's function is introduced and investigated. The corresponding inversion formula is established. Particular cases cover index transforms of the Lebedev type with products of the modified…

We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.

In this paper we establish plenty of number theoretic and combinatoric identities involving generalized Bernoulli and Stirling numbers of both kinds. These formulas are deduced from Pascal type matrix representations of Bernoulli and…

We investigate the relationship between (countable) transfinite iteration and ordinal arithmetic. The nice connection between finite iteration and addition, multiplication, and exponentiation is lost when passing to the transfinite. In this…

From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…

Analogue of Springer's formula for the Poincar\'e series of the algebra invariants of ternary form is found.

A generalization of the Apery-like numbers, which is used to describe the special values $\zeta_Q(2)$ and $\zeta_Q(3)$ of the spectral zeta function for the non-commutative harmonic oscillator, are introduced and studied. In fact, we give a…

A difficult problem in the theory of random tensors is to calculate the expectation values of polynomials in the tensor entries, even in the large N limit and in a Gaussian distribution. Here we address this issue, focusing on a family of…

The unitary evolution can be represented by a finite product of exponential operators. It leads to a perturbative expression of the density operator of a close system. Based on the perturbative expression scheme, we present a entanglement…

In this paper, we derive eight basic identities of symmetry in three variables related to Euler polynomials and alternating power sums. These and most of their corollaries are new, since there have been results only about identities of…

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…

Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…

We describe a practical algorithm which computes the accepting automaton for the insertion encoding of a permutation class, whenever this insertion encoding is regular. This algorithm is implemented in the accompanying Maple package INSENC,…

Expressions are given for the exponential of a hermitian matrix, A. Replacing A by iA these are explicit formulas for the Fourier transform of exp(iA). They extend to any size matrix the previous results for the 2 X 2, 3 X 3, and 4 X 4…

A permutation is said to be \emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on $n$ letters that avoid or contain…

We provide constructions of bent functions using triples of permutations. This approach is due to Mesnager. In general, involutions have been mostly considered in such a machinery; we provide some other suitable triples of permutations,…

This paper presents an approach for the development of a number theoretic discrete Hilbert transform. The forward transformation has been applied by taking the odd reciprocals that occur in the DHT matrix with respect to a power of 2.…