Please see [1] for background on MV-algebras. We address the question, which MV-algebras have finite automorphism group. The automorphism group of the free MV-algebra on 1 generator is just the group of order 2 (folklore). In contrast, it is known that the automorphism group of the free MV-algebra on 2 generators is not even locally finite [4, 2]. Not much else seems to be known. Let us restric...

We give an example of a finitely presented group G with two non-π 1-equivalent asymptotic cones.

background: premenstrual syndrome (pms) is a condition characterized by a number of behavioral, psychological and physical symptoms recurring cyclically during the luteal phase of the menstrual cycle. the uncertainty in the pathogenesis of pms has led to many treatment protocols being suggested as possible therapies. the present study was carried out to compare the effects of echinophora-platyl...

Maximal length Feedback with Carry Shift Register sequences have several remarkable statistical properties. Among them is the property that the arithmetic correlations between any two cyclically distinct decimations are precisely zero. It is open, however, whether all such pairs of decimations are indeed cyclically distinct. In this paper we show that the set of distinct decimations is large an...

We have performed the first study of neuronal activity in freely-moving reptiles. 23 brainstem units were recorded from areas throughout the reticular formation, during wakefulness and quiescence in the box turtle. These units responded to various sensory stimuli and increased firing rates in relation to motor activity during wakefulness. All but one unit showed significant decreases in dischar...

A cubic graph G is uniquely edge-3-colorable if G has precisely one 1-factorization. It is proved in this paper, if a uniquely edge-3-colorable, cubic graph G is cyclically 4-edgeconnected, but not cyclically 5-edge-connected, then G must contain a snark as a minor. This is an approach to a conjecture that every triangle free uniquely edge-3-colorable cubic graph must have the Petersen graph as...

If G is a 4-connected maximal planar graph, then G is hamiltonian (by a theorem of Whitney), implying that its dual graph G∗ is a cyclically 4-edge connected 3regular planar graph admitting a partition of the vertex set into two parts, each inducing a tree in G∗, a so-called tree-partition. It is a natural question whether each cyclically 4-edge connected 3-regular graph admits such a tree-part...

It has long been open whether all pairs of proper decimations of l-sequences based on primes are cyclically distinct. By determining the nontrivial maximal autocorrelation of l-sequences, this paper presents a partial proof of the distinctness problem. Since the proof idea is completely different from former ones, the set of decimations that are known to be cyclically distinct is further enlarg...