Related papers: A review of Dan's reduction method for multiple po…
For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…
Block-structured integer linear programs (ILPs) play an important role in various application fields. We address $n$-fold ILPs where the matrix $\mathcal{A}$ has a specific structure, i.e., where the blocks in the lower part of…
We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1) First we show that…
This paper presents RevOrder, a novel technique aimed at improving arithmetic operations in large language models (LLMs) by reversing the output digits in addition, subtraction, and n-digit by 1-digit (nD by 1D) multiplication tasks. Our…
We present a generalization of the symbol calculus from ordinary multiple polylogarithms to their elliptic counterparts. Our formalism is based on a special case of a coaction on large classes of periods that is applied in particular to…
This paper studies the limitations of the generic approaches to solving cryptographic problems in classical and quantum settings in various models. - In the classical generic group model (GGM), we find simple alternative proofs for the…
We present a new systematic method for evaluating generalized log-sine integrals in terms of polylogarithms. Our approach is based on an identity connecting ordinary generating functions of polylogarithms to integrals involving the sine…
A method for reducing Feynman integrals, depending on several kinematic variables and masses, to a combination of integrals with fewer variables is proposed. The method is based on iterative application of functional equations proposed by…
We propose a method and algorithm for computing the weighted Moore-Penrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial…
In the present paper, we provide an algebraic and geometric proof of the Landen formula for complex multiple polylogarithms originally established by Okuda and Ueno. Our approach employs a chain rule of complex KZ solutions arising from the…
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…
We establish a tannakian formalism of $p$-adic multiple polylogarithms and $p$-adic multiple zeta values introduced in our previous paper via a comparison isomorphism between a de Rham fundamental torsor and a rigid fundamental torsor of…
The two-dimensional harmonic polylogarithms $\G(\vec{a}(z);y)$, a generalization of the harmonic polylogarithms, themselves a generalization of Nielsen's polylogarithms, appear in analytic calculations of multi-loop radiative corrections in…
Encoding the electronic structure of molecules using 2-electron reduced density matrices (2RDMs) as opposed to many-body wave functions has been a decades-long quest as the 2RDM contains sufficient information to compute the exact molecular…
We present a near-linear time algorithm that approximates the edit distance between two strings within a polylogarithmic factor; specifically, for strings of length n and every fixed epsilon>0, it can compute a (log n)^O(1/epsilon)…
In an important paper, Zagier proved that certain half-integral weight modular forms are generating functions for traces of polynomials in the $j$-function. It turns out that Zagier's work makes it possible to algorithmically compute…
We continue the study of constructing explicit extractors for independent general weak random sources. The ultimate goal is to give a construction that matches what is given by the probabilistic method --- an extractor for two independent…
Let $I(n):=\int_0^1 [x^n+(1-x)^n]^\frac1n dx.$ In this paper, we show that $I(n)= \sum_0^\infty \frac{I_i}{n^i},n\rightarrow \infty$ and we compute $I_i, i =0..5$, obtained by polylog functions and Euler sums. As a corollary, we obtain…
Unitarity cut method has been proved to be very useful in the computation of one-loop integrals. In this paper, we generalize the method to the situation where the powers of propagators in the denominator are larger than one in general. We…
New approach to systems of polynomial recursions is developed based on the Carleman linearization procedure. The article is divided into two main sections: firstly, we focus on the case of uni-variable depth-one polynomial recurrences.…