Related papers: An explicit parity theorem for multiple polylogari…

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

A divide-and-conquer cryptanalysis can often be mounted against some keystream generators composed of several (nonlinear) independent devices combined by a Boolean function. In particular, any parity-check relation derived from the periods…

We present a new geometric proof of Pieri's formula, exhibiting an explicit chain of rational equivalences from a suitable sum of distinct Schubert varieties to the intersection of a Schubert variety with a special Schubert variety. The…

A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…

By using the method of iterated integral representations of series, we establish some explicit relationships between multiple zeta values and Integrals of logarithmic functions. As applications of these relations, we show that multiple zeta…

The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…

We prove three theorems on finite real multiple zeta values: the symmetric formula, the sum formula and the height-one duality theorem. These are analogues of their counterparts on finite multiple zeta values.

The sum formula is one of the most well-known relations among multiple zeta values. This paper proves a conjecture of Kaneko predicting that an analogous formula holds for finite multiple zeta values.

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their…

In this paper we prove some new identities for multiple zeta values and multiple zeta star values of arbitrary depth by using the methods of integral computations of logarithm function and iterated integral representations of series. By…

In the present paper a new mean value theorem for polynomials of special form is obtained. The case of sums on vertices of a regular polygon is studied. A criterion for a certain equation to be satisfied is obtained.

This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…

We develop a new approach to the study of the functional equations satisfied by classical polylogarithms, inspired by Goncharov's conjectures. We prove a sharpened version of Zagier's criterion for such an equation and explain, how our…

The ``impossibility theorem'' -- which is considered foundational in algorithmic fairness literature -- asserts that there must be trade-offs between common notions of fairness and performance when fitting statistical models, except in two…

Carlitz proved a few generalizations of Mehler's formula. Later, Srivastava et al. gave a new proof for some extensions of Carlitz's formula. Here, a direct proof of the further generalization is given.

Recently Tao, Croot and Helfgott invented an algorithm to determine the parity of the number of primes in a given interval in O(x^{1/2-c+\eps}) steps for some absolute constant c. We propose a slightly different approach, which leads to the…

Characteristic p multizeta values were initially studied by Thakur, who defined them as analogues of classical multiple zeta values of Euler. In the present paper we establish an effective criterion for Eulerian multizeta values, which…

Explicit formulas involving a generalized Ramanujan sum are derived. An analogue of the prime number theorem is obtained and equivalences of the Riemann hypothesis are shown. Finally, explicit formulas of Bartz are generalized.

We prove a new linear relation for multiple zeta values. This is a natural generalization of the restricted sum formula proved by Eie, Liaw and Ong. We also present an analogous result for finite multiple zeta values.

We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…