Related papers: The iterated integrals of ln(1 + x^2)
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
This paper studies non-autonomous Lyness type recurrences of the form $x_{n+2}=(a_n+x_{n+1})/x_{n}$, where $\{a_n\}$ is a $k$-periodic sequence of positive numbers with primitive period $k$. We show that for the cases $k\in\{1,2,3,6\}$ the…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
The notion of binomial coefficients $T \choose S$ of finite planar, reduced rooted trees $T, S$ is defined and a recursive formula for its computation is shown. The nonassociative binomial formula $$(1 + x)^T = \displaystyle \sum_S {T…
Relations among integrals of logarithms, polylogarithms and Euler sums are presented. A unifying element being the introduction of Nielsen's generalized polylogarithms.
We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…
If $R=k[x_1,\ldots,x_n]/I$ is a graded artinian algebra, then the length of $k[x_1,\ldots,x_n]/I^s$ becomes a polynomial in $s$ of degree $n$ for large $s$. If we write this polynomial as $\sum_{i=0}^n(-1)^ie_i{s+n-i-1\choose n-i}$, then…
Mixed trigonometric-polynomials frequently occur in applications in physics, numerical analysis and engineering, the algorithm has been already proposed to determine its sign on (0,{pi}/2]. This paper proposes a procedure to extend the…
Let (x_n; n\in Z) be a bisequence of elements x_n in the 1-dimensional torus R/Z, which is called a stream over R/Z. Let P(z)=a_k z^k+...+a_1 z+a_0 be a polynomial with integer coefficients. Define the set of streams over R/Z such that the…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
We introduce a multivariate analogue of Bernoulli polynomials and give their fundamental properties: difference and differential relations, symmetry, explicit formula, inversion formula, multiplication theorem, and binomial type formula.…
Intersective polynomials are polynomials in $\Z[x]$ having roots every modulus. For example, $P_1(n)=n^2$ and $P_2(n)=n^2-1$ are intersective polynomials, but $P_3(n)=n^2+1$ is not. The purpose of this note is to deduce, using results of…
A systematic framework is presented for the construction of hierarchies of soliton equations. This is realised by considering scalar linear integral equations and their representations in terms of infinite matrices, which give rise to all…
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.
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…
In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…
A polynomial-time algorithm for 0-1 integer linear programmings has been proposed. This method continues the classic idea of solving ILP with its LP relaxation. The innovation is that every constraint in the LP is reconstructed into a…
Let f(x) be a polynomial with integer coefficients, let n be a positive integer, and let p be an odd prime. Then the mapping x-->f(x) sends Z/p^n into Z/p^n. We study the topological structure of this mapping.
The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…