for many linguists and scholars, the criterion of eloquence in arabic language is based upon the two elements of language and place and they have ignored internal criteria of words, internal order, kinds of letters, collocations, assonance, dissonance and the power of their impact. the fact is that, linguists and the scholars of eloquence were of different opinions about words. it means that li...

We look at genera of even unimodular lattices rank 12 over the ring integers $${{\mathbb {Q}}}(\sqrt{5})$$ and 8 {Q}}}(\sqrt{3})$$ , using Kneser neighbours to diagonalise spaces scalar-valued algebraic modular forms. conjecture most global Arthur parameters, prove several them theta series, in manner Ikeda Yamana. find instances congruences for non-parallel weight Hilbert Turning genus Hermiti...

To say that n is the rank of Q is to assert that Q : An → A. So suppose that n and m are natural numbers and Q has rank m as well as rank n. We need to prove that n = m. It follows that An = Am since both An and Am turn out to be the domain of Q. Now in general AX is the set of all functions from X into A. Recalling that n = {0, 1, . . . , n−1} and m = {0, 1, . . . ,m−1} we can understand more ...

For a property P and a sub-property P , we say that P is P -partially testable with q queries if there exists an algorithm that distinguishes, with high probability, inputs in P ′ from inputs ǫ-far from P by using q queries. There are natural properties that require many queries to test, but can be partitioned into a small number of subsets for which they are partially testable with very few qu...

prophet mohammad (p) was at the peak of eloquence and rhetoric at the height of the comprehensively statement and spoke with every tribe in their language. to express the whole of word, we review the metaphor of prophet’s words in order to demonstrate a piece of his rhetoric and eloquence. this paper seeks to examine the art of metaphor and expressions of the holy prophet (p). our method of dis...

It is a well known fact that if C is an [n, k, d] formally self-dual even code with n > 30, then d ≤ 2[n/8]. A formally self-dual even code with d = 2[n/8] is called nearextremal. Kim and Pless [9] conjecture that there does not exist a near-extremal formally self dual even (not Type II) code of length n ≥ 48 with 8|n. In this paper, we prove that if n ≥ 72 and 8|n, then there is no near-extrem...

A detailed discussion of the point in polygon problem for arbitrary polygons is given. Two concepts for solving this problem are known in literature: the even-odd rule and the winding number, the former leading to ray-crossing, the latter to angle summation algorithms. First we show by mathematical means that both concepts are very closely related, thereby developing a first version of an algor...