We present a tight bound on the exact maximum complexity of Minkowski sums of polytopes in R. In particular, we prove that the maximum number of facets of the Minkowski sum of k polytopes with m1,m2, . . . ,mk facets respectively is bounded from above by

The subject of this thesis is the theory of nonholomorphic modular forms of non-integral weight, and its applications to arithmetical functions involving Dedekind sums and Kloosterman sums. As was discovered by Andre Weil, automorphic forms of non-integral weight correspond to invariant funtions on Metaplectic groups. We thus give an explicit description of Meptaplectic groups corresponding to ...

Scattering forces in focused light beams push away metallic particles. Thus, trapping metallic particles with conventional optical tweezers, especially those of Mie particle size, is difficult. Here we investigate a mechanism by which metallic particles are attracted and trapped by plasmonic tweezers when surface plasmons are excited and focused by a radially polarized beam in a high-numerical-...

in this paper, we obtain the general solution and the generalized  hyers--ulam--rassias stability in random normed spaces, in non-archimedean spacesand also in $p$-banach spaces and finally the stability viafixed point method for a functional equationbegin{align*}&d_f(x_{1},.., x_{m}):= sum^{m}_{k=2}(sum^{k}_{i_{1}=2}sum^{k+1}_{i_{2}=i_{1}+1}... sum^{m}_{i_{m-k+1}=i_{m-k}+1}) f(sum^{m}_{i=1...

Let A be a finite, nonempty subset of an abelian group. We show that if every element is sum two other elements, then has zero-sum subset. That is, (finite, nonempty) sum-full group not zero-sum-free.

Visual responses are known to depend on stimulus contrast and not simply on the absolute levels of retinal illumination. Here, we have determined the contrasts that mammalian retinal ganglion cells and lateral geniculate neurones (LGN) are likely to encounter in real world scenes. Local contrasts were calculated in 135 calibrated images of a variety of real world scenes using contrast operators...

It is shown that complexity of implementation of prefix sums of m variables (i.e. functions x1 ◦ . . . ◦ xi, 1 ≤ i ≤ m) by circuits of depth dlog2 me in the case m = 2n is exactly 3.5 · 2 − (8.5 + 3.5(n mod 2))2bn/2c + n + 5. As a consequence, for an arbitrary m an upper bound (3.5 − o(1))m holds. In addition, an upper bound ( 3 3 11 − o(1) ) m for complexity of the minimal depth prefix circuit...

Let z be a real quadratic irrational. We compare the asymptotic behavior of Dedekind sums S(pk, qk) belonging to convergents pk/qk of the regular continued fraction expansion of z with that of Dedekind sums S(sj/tj) belonging to convergents sj/tj of the negative regular continued fraction expansion of z. Whereas the three main cases of this behavior are closely related, a more detailed study of...