Related papers: An explicit parity theorem for multiple polylogari…
In this note we prove the optimality of a family of known coincidence theorems for absolutely summing multilinear operators. We connect our results with the theory of multiple summing multilinear operators and prove the sharpness of similar…
Parity games have been broadly studied in recent years for their applications to controller synthesis and verification. In practice, partial solvers for parity games that execute in polynomial time, while incomplete, can solve most games in…
In this paper, we introduce the method of adding additional factors and a parameter to multiple zeta values and prove some generalizations of the duality theorem and several relations among multiple zeta values. In particular, we are able…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…
In this paper, we give a proof of a conjecture made by Zagier about the inverse of some matrix related to double zeta values of parity $(\mathrm{even},\mathrm{odd})$. As a result, we obtain a family of Bernoulli number identities. We…
The cyclic relation obtained in a study by Hirose, Murakami, and the first-named author, is a wide class of relations, which includes the well-known cyclic sum formula for multiple zeta and zeta-star values, and the derivation relation for…
In this paper, we consider pairs of a prime and a prime power with a fixed difference. We prove an average result on the distribution of such pairs. This is a partial improvement of the result of Bauer (1998).
Recently, five quasi-polynomial-time algorithms solving parity games were proposed. We elaborate on one of the algorithms, by Lehtinen (2018). Czerwi\'nski et al. (2019) observe that four of the algorithms can be expressed as constructions…
The relationship between the Ohno relation and multiple polylogarithms are discussed. Using this relationship, the algebraic reduction of the Ohno relation is given.
The main aim of this article is to establish a sharp improvement of the classical Bohr inequality for bounded holomorphic mappings in the polydisk $\mathbb{P}\Delta(0;1_n)$. We also prove two other sharp versions of the Bohr inequality in…
We study relations between the multizeta values for function fields introduced by D. Thakur. The product \zeta(a)\zeta(b) is a linear combination of multizeta values. For q=2, a full conjectural description of how the product of two zeta…
Many $\mathbb{Q}$-linear relations exist between multiple zeta values, the most interesting of which are various weighted sum formulas. In this paper, we generalized these to Euler sums and some other variants of multiple zeta values by…
The M-convexity of dual Schubert polynomials was first proven by Huh, Matherne, M\'esz\'aros, and St. Dizier in 2022. We give a full characterization of the supports of dual Schubert polynomials, which yields an elementary alternative proof…
The goal of this expository article is to present a proof that is as direct and elementary as possible of the fundamental theorem of complex multiplication (Shimura, Taniyama, Langlands, Tate, Deligne et al.). The article is a revision of…
We show that (k,m)-linear mappings, introduced by I. Chernega and A. Zagorodnyuk in [3], are particular cases of polynomials. As corollaries, we expose some apparently overlooked properties in the literature. For instance, every multilinear…
In the present paper, we introduce a multibasic extension of the Ehrhart theory. We give a multibasic extension of Ehrhart polynomials and Ehrhart series. We also show that an analogue of Ehrhart reciprocity holds for multibasic Ehrhart…
We prove that every multiple zeta value is a $\mathbb{Z}$-linear combination of $\zeta(k_1,\dots, k_r)$ where $k_i\geq 2$. Our proof also yields an explicit algorithm for such an expansion. The key ingredient is to introduce modified…
Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity is exponential, while currently the state-of-the-art algorithms have…
We prove a new theorem of Tverberg type which confirms the conjecture of Blagojevic, Frick, and Ziegler about the existence of "balanced Tverberg partitions" (Conjecture 6.6 in, Tverberg plus constraints, Bull. London Math. Soc., 46 (2014)…