Multiple Product Modulo Arbitrary Numbers

AbstractLetnbinary numbers of lengthnbe given. The Boolean function “Multiple Product”MPnasks for (some binary representation of ) the value of their product. It has been shown (K.-Y. Siu and V. Roychowdhury, On optimal depth threshold circuits for multiplication and related problems,SIAM J. Discrete Math.7, 285–292 (1994)) that this function can be computed in polynomial-size threshold circuits of depth 4. For many other arithmetic functions, circuits of depth 3 are known. They are mostly based on the fact that the value of the considered function modulo some prime numbers p can be computed easily in threshold circuits of depth 2. In this paper, we investigate the complexity of computingMPnmodulomby depth-2 threshold circuits. It turns out that for all but a few integersm, exponential size is required. In particular, it is shown that form∈{2, 4, 8}, polynomial-size circuits exist, form∈{3, 6, 12, 24}, the question remains open and in all other cases, exponential-size circuits are required. The result still holds if we allowmto grow withn

Algebraic Aspects of Abelian Sandpile Models

The abelian sandpile models feature a finite abelian group G generated by the operators corresponding to particle addition at various sites. We study the canonical decomposition of G as a product of cyclic groups G = Z_{d_1} X Z_{d_2} X Z_{d_3}...X Z_{d_g}, where g is the least number of generators of G, and d_i is a multiple of d_{i+1}. The structure of G is determined in terms of toppling matrix. We construct scalar functions, linear in height variables of the pile, that are invariant toppling at any site. These invariants provide convenient coordinates to label the recurrent configurations of the sandpile. For an L X L square lattice, we show that g = L. In this case, we observe that the system has nontrivial symmetries coming from the action of the cyclotomic Galois group of the (2L+2)th roots of unity which operates on the set of eigenvalues of the toppling matrix. These eigenvalues are algebraic integers, whose product is the order |G|. With the help of this Galois group, we obtain an explicit factorizaration of |G|. We also use it to define other simpler, though under-complete, sets of toppling invariants.Comment: 39 pages, TIFR/TH/94-3

Distribution of Eigenvalues for the Modular Group

The two-point correlation function of energy levels for free motion on the modular domain, both with periodic and Dirichlet boundary conditions, are explicitly computed using a generalization of the Hardy-Littlewood method. It is shown that ion the limit of small separations they show an uncorrelated behaviour and agree with the Poisson distribution but they have prominent number-theoretical oscillations at larger scale. The results agree well with numerical simulations.Comment: 72 pages, Latex, the fiogures mentioned in the text are not vital, but can be obtained upon request from the first Autho