Dynkin’s classification of maximal subalgebras of simple finite dimensional complex Lie algebras is generalized to matrix Lie superalgebras, i.e., the Lie subsuperalgebras of gl(p|q).

The trace of a family of sets A on a set X is A|X = {A ∩ X : A ∈ A}. If A is a family of k-sets from an n-set such that for any r-subset X the trace A|X does not contain a maximal chain, then how large can A be? Patkós conjectured that, for n sufficiently large, the size of A is at most ( n−k+r−1 r−1 ) . Our aim in this paper is to prove this conjecture.

The effect of intravenous clonidine on pentagastrin-induced gastric acid secretion has been studied in conscious dogs with Heidenhain pouches. Dose-dependent enhancement of secretion was found in response to clonidine (5-20 mu/kg). Clonidine (20 mug/kg) increased the maximal secretory rate to pentagastrin to a value not significantly different from the maximal response to histamine.

OBJECTIVE To evaluate the contribution of ultrasonography in the diagnosis of neurilemmoma and to establish if a round or round-like shape adds useful information for ultrasonographic diagnosis. METHODS Archives of ultrasound findings in 203 patients (127 males and 76 females, aged 14 -72 years old, mean 32.1 +/- 25.8) with limb mass were reviewed. The maximal and minimal diameter of the lesi...

in this note we review a simple criterion, due to ekedahl, for superspecial curves defined over finite fields.using this we generalize and give some simple proofs for some well-known superspecial curves.

The maximal rate of progression of ST segment depression relative to increases in heart rate (maximal ST/HR slope) has recently been shown to be an accurate index of the presence and the severity of coronary heart disease in patients with angina. The value of this new exercise test was assessed in patients undergoing aortocoronary bypass. The maximal ST/HR slope and the results of coronary angi...

The trace of a set F on a another set X is F |X = F ∩ X and the trace of a family F of sets on X is FX = {F |X : F ∈ F}. In this note we prove that if a k-uniform family F ⊂ ([n] k ) has the property that for any k-subset X the trace F|X does not contain a maximal chain (a family C0 ⊂ C1 ⊂ ... ⊂ Ck with |Ci| = i), then |F| ≤ ( n−1 k−1 ) . This bound is sharp as shown by {F ∈ ([n] k ) , 1 ∈ F}. ...

A substring w[i..j] in w is called a repetition of period p if s[k] = s[k + p] for any i ≤ k ≤ j − p. Especially, a maximal repetition, which cannot be extended neither to left nor to right, is called a run. The ratio of the length of the run to its period, i.e. j−i+1 p , is called an exponent. The sum of exponents of runs in a string is of interest. The maximal value of the sum is still unknow...