It is proved that blow-up solutions toN coupled Schrödinger equations iφjt + φjxx + μj |φj |φj + N X k 6=j, k=1 βkj |φk|k |φj |jφj = 0 exist only under the condition that the initial data have strictly negative energy.

Pretty printers are tools for formatting structured text. A recently taken algebraic approach has lead to a systematic design of pretty printers. Wadler has proposed such an algebraic pretty printer together with an implementation for the lazy functional language Haskell. The original design causes exponential complexity when literally used in a strict language. This note recalls some propertie...

It is shown that for any expansive, integer valued 2×2 matrix, there exists a (multi-)wavelet whose Fourier transform is compactly supported and smooth. A key step is showing that for almost every equivalence class of integrally similar matrices there is a representative A which is strictly expansive in the sense that there is a compact set K which tiles the plane by integer translations and su...

Abstract. If f(t) = ∑∞ k=0 akt k converges for all t ∈ IR with all coefficients ak ≥ 0, then the function f(< x,y >) is positive definite on H ×H for any inner product space H. Set K = {k : ak > 0}. We show that f(< x,y >) is strictly positive definite if and only if K contains the index 0 plus an infinite number of even integers and an infinite number of odd integers.

It is shown that for any expansive, integer valued 2×2 matrix, there exists a (multi-)wavelet whose Fourier transform is compactly supported and smooth. A key step is showing that for almost every equivalence class of integrally similar matrices there is a representative A which is strictly expansive in the sense that there is a compact set K which tiles the plane by integer translations and su...

We prove that Best Fit bin packing has linear waste on the discrete distributionU{j, k} (where items are drawn uniformly from the set {1/k, 2/k, · · · , j/k}) for sufficiently large k when j = αk and 0.66 ≤ α < 2/3. Our results extend to continuous skewed distributions, where items are drawn uniformly on [0, a], for 0.66 ≤ a < 2/3. This implies that the expected asymptotic performance ratio of ...

Anthropological interest in secrecy and silence – related aspects such as lying, knowledge, memory, forgetting has been long precarious. Through what may be called personal anthropology, this article, I describe both private professional anthropological experiences including family memories, fieldwork sites, academic practices. By recalling state socialist ideology, censorship, secrets, illustr...

While the very first consensus protocols for the synchronous model were designed to match the worst-case lower bound, deciding in exactly t + 1 rounds in all runs, it was soon realized that they could be strictly improved upon by early stopping protocols. These dominate the first ones, by always deciding in at most t + 1 rounds, but often much faster. A protocol is unbeatable if it can’t be str...

We present a new lower bound technique for two types of restricted Branching Programs (BPs), namely for read-once BPs (BP1s) with restricted amount of nondeterminism and for (1,+k)-BPs. For this technique, we introduce the notion of (strictly) k-wise l-mixed Boolean functions, which generalizes the concept of l-mixedness defined by Jukna in 1988 [3]. We prove that if a Boolean function f ∈ Bn i...