Various combinatorial problems on graphs can be approached by reducing the size of the graph according to certain rules. Given an instance of a graph problem, it is desirable to apply a sequence of self-reductions that is as long as possible so that the remaining graph is as small as possible. We show that computing maximum reduction sequences for two self-reduction operations | two-pair reduct...

This experiment examined six short texts for their effectiveness in inducing positive or negative mood in an online environment. Compared to two control groups, the texts successfully changed mood in the desired direction for mood measured on a single-item self-report scale. In accordance with previous research, negative mood was induced more effectively than positive mood. In addition to the s...

We prove that any sufficiently small perturbation of an isosceles triangle has a periodic billiard path. Our proof involves the analysis of certain infinite families of Fourier series that arise in connection with triangular billiards, and reveals some self-similarity phenomena in irrational triangular billiards. Our analysis illustrates the surprising fact that billiards on a triangle near a V...

We derive a self-similar solution which describes the asymptotic behavior of a jet of a Giesekus fluid as the breakup point is approached.

We study a randomfield obtained by counting the number of balls containing a given point when overlapping balls are thrown at random according to a Poisson random measure. We describe a microscopic process which exhibits multifractional behavior. We are particularly interested in the local asymptotic self-similarity (LASS) properties of the field, as well as in its X-ray transform. We obtain tw...

In this paper, we study self-dual codes over Z2× (Z2+uZ2), where u 2 = 0. Three types of self-dual codes are defined. For each type, the possible values α, β such that there exists a code C ⊆ Z2×(Z2+uZ2) β are established. We also present several approaches to construct self-dual codes over Z2 × (Z2 + uZ2). Moreover, the structure of two-weight self-dual codes is completely obtained for α · β 6...

An important aspect that must be considered when studying opinion formation phenomena is the different social attitude of the agents taking part in the process. Different kinds of interconnections and of interacting behaviours should be associated to the agents depending on their opinion: radicals tend to self-segregate but, on the other hand, have a stronger capacity to convince neutral agents...

The scale-invariant spacings lemma due to Arratia, Barbour and Tavaré establishes the distributional identity of a self-similar Poisson process and the set of spacings between the points of this process. In this note we connect this result with properties of a certain set of extreme points of the unit Poisson process in the positive quadrant.

Recent studies of high-quality, highresolution traffic have demonstrated these traffics exhibit self-similarity, which has implications for design, control and analysis of high-speed networks. Merging and splitting are basic networking operations and should be studied before we analyze the performance of the whole high speed networks. In this paper, we give the necessary and sufficient conditio...