After introducing double derivations of $n$-Lie algebra $L$ we‎ ‎describe the relationship between the algebra $mathcal D(L)$ of double derivations and the usual‎ ‎derivation Lie algebra $mathcal Der(L)$‎. ‎In particular‎, ‎we prove that the inner derivation algebra $ad(L)$‎ ‎is an ideal of the double derivation algebra $mathcal D(L)$; we also show that if $L$ is a perfect $n$-Lie algebra‎ ‎wit...

In this work, we introduce $H^*$-condition on the set of submodules of a module. Let $M$ be a module. We say $M$ satisfies $H^*$ provided that for every submodule $N$ of $M$, there is a direct summand$D$ of $M$ such that $(N+D)/N$ and $(N+D)/D$ are cosingular. We show that over a right perfect right $GV$-ring,a homomorphic image of a $H^*$ duo module satisfies $H^*$.

A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 6= 1 + 2 + 3 + 4 + 6 is not perfect. An ACL2 theory of perfect numbers is developed and used to prove, in ACL2(r), this bit of mathematical folklore: Even if there...

A new technique is proposed for N-gram language model (LM) retrieval based on minimum perfect hashing (MPH). A hierarchical data structure is used to store N-gram scores in hash tables according to the order of N-grams, and a LM score is retrieved by probing the appropriate hash table slot without collision. Both integer key and character-string key based MPH functions are studied. The proposed...

A ring is called n-perfect (n ≥ 0), if every flat module has projective dimension less or equal than n. In this paper, we show that the n-perfectness relate, via homological approach, some homological dimension of rings. We study n-perfectness in some known ring constructions. Finally, several examples of n-perfect rings satisfying special conditions are given.

The structural theory of matchings is used to establish lower bounds on the number of perfect matchings in n-extendable graphs. It is shown that any such graph on p vertices and q edges contains at least (n + 1)!/4[q − p − (n − 1)(2 − 3) + 4] different perfect matchings, where is the maximum degree of a vertex in G. © 2007 Elsevier B.V. All rights reserved. MSC: 05C70; 05C40; 05C75