No abstract uploaded!

No abstract uploaded!

In two earlier papers with the same title, we studied connections between Voronoi’s formula in the divisor problem and Atkinson’s formula for the mean square of Riemann’s zeta-function. Now we consider this correspondence in terms of segments of sums appearing in these formulae and show that a certain arithmetic conjecture concerning the divisor function implies best possible bounds for the classical error terms Δ($x$) and$E$($T$).

In this paper, we introduce a motivic version of To¨en’s derived Hall algebra. Then we point out that the two kinds of Hall algebras in the sense of To¨en and Kontsevich–Soibelman, respectively, are Drinfeld dual pairs, not only in the classical case (by counting over finite fields) but also in the motivic version. Consequently they are canonically isomorphic. All proofs, including that for the most important associative property, are deduced in a self-contained way by analyzing the symmetry properties around the octahedral axiom, a method we used previously

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and algorithms for various settings of this problem. In particular, we show that if there is only one machine with an arbitrary number of linear constraints, or there is an arbitrary number of machines with no more than two linear constraints, or both the number of machines and the number of linear constraints are fixed constants, then the problem is polynomial-time solvable via solving a series of linear programming problems. If both the number of machines and the number of constraints are inputs of the problem instance, then the problem is NP-Hard. We further propose several approximation algorithms for the latter case.