Related papers: Iterated primitives of logarithmic powers

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

We introduce an iterated integral version of (generalized) log-sine integrals (iterated log-sine integrals) and prove a relation between a multiple polylogarithm and iterated log-sine integrals. We also give a new method for obtaining…

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

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…

Linear forms in logarithms over connected commutative algebraic groups over the algebraic numbers field have been studied widely. However, the theory of linear forms in logarithms over noncommutative algebraic groups have not been developed…

As is well-known, poly-Bernoulli polynomials are defined in terms of polylogarithm functions. Recently, as degenerate version of such functions and polynomials, degenerate polylogarithm functions were introduced and degenertae…

We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…

We study logarithmic integrals of the form $\int_0^1 x^i\ln^n(x)\ln^m(1-x)dx$. They are expressed as a rational linear combination of certain rational numbers $(n,m)_i$, which we call tiered binomial coefficients, and products of the zeta…

In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…

Inductive proofs can be represented as proof schemata, i.e. as parameterized sequences of proofs defined in a primitive recursive way. Applications of proof schemata can be found in the area of automated proof analysis where the schemata…

We define {\bf primitive derivations} for Coxeter arrangements which may not be irreducible. Using those derivations, we introduce the {\bf primitive filtrations} of the module of invariant logarithmic differential forms for an arbitrary…

It is a basic property of the entropy in statistical physics that is concave as a function of energy. The analog of this in representation theory would be the concavity of the logarithm of the multiplicity of an irreducible representation…

In a recent work, Girard proposed a new and innovative approach to computational complexity based on the proofs-as-programs correspondence. In a previous paper, the authors showed how Girard proposal succeeds in obtaining a new…

Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…

We offer new proofs, refinements as well as new results related to classical means of two variables, including the identric and logarithmic means.

In this paper we generalize the notion of logarithmic vector-valued modular form in order to give a general definition of matrix-valued Hilbert modular forms. We prove that they admit unique polynomial Fourier expansions and we build…

We use the methods of empirical mathematics to show that iterative logarithmic operations will result in an attractor point on the complex plane. Moreover, we demonstrate that different bases converge onto different attractors. Finally, we…

Closed form expressions for a logarithm of general multivector (MV) in base-free form in real geometric algebras (GAs) Cl(p,q) are presented for all n=p+q=3. In contrast to logarithm of complex numbers (isomorphic to Cl(0,1), 3D logarithmic…

We prove a recursive identity involving formal iterated logarithms and formal iterated exponentials. These iterated logarithms and exponentials appear in a natural extension of the logarithmic formal calculus used in the study of…