نتایج جستجو برای: maximal n prime of 0
تعداد نتایج: 21396174 فیلتر نتایج به سال:
We establish an analogue of the classical Polya–Vinogradov inequality for $$GL(2, {\mathbbm {F}}_p)$$ , where p is a prime. In process, we compute ‘singular’ Gauss sums . As application, show that collection elements in $$GL(2,{\mathbbm {Z}})$$ whose reduction modulo are maximal order and matrix entries bounded by x has expected size as soon $$x\gg p^{1/2+\varepsilon }$$ any $$\varepsilon >0$$
The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors of n in such a way that they have vertex set Zn and edge set {{a, b} : a, b ∈ Zn, gcd(a− b, n) ∈ D}. Using tools from convex optimization, we study the maxim...
we state several conditions under which comultiplication and weak comultiplication modulesare cyclic and study strong comultiplication modules and comultiplication rings. in particular,we will show that every faithful weak comultiplication module having a maximal submoduleover a reduced ring with a finite indecomposable decomposition is cyclic. also we show that if m is an strong comultiplicati...
Let p be a prime, k be a field of characteristic 6= p and N be the normalizer of the maximal torus in the projective linear group PGLn. We compute the exact value of the essential dimension edk(N ; p) of N at p for every n ≥ 1.
Let $G$ be a finite group. The prime graph of $G$ is a graph $Gamma(G)$ with vertex set $pi(G)$, the set of all prime divisors of $|G|$, and two distinct vertices $p$ and $q$ are adjacent by an edge if $G$ has an element of order $pq$. In this paper we prove that if $Gamma(G)=Gamma(G_2(5))$, then $G$ has a normal subgroup $N$ such that $pi(N)subseteq{2,3,5}$ and $G/Nequiv G_2(5)$.
let $g$ be a finite group. in [ghasemabadi et al., characterizations of the simple group ${}^2d_n(3)$ by prime graph and spectrum, monatsh math., 2011] it is proved that if $n$ is odd, then ${}^2d _n(3)$ is recognizable by prime graph and also by element orders. in this paper we prove that if $n$ is even, then $d={}^2d_{n}(3)$ is quasirecognizable by prime graph, i.e...
In this paper, first we study the semi maximal filters in linear $BL$-algebras and we prove that any semi maximal filter is a primary filter. Then, we investigate the radical of semi maximal filters in $BL$-algebras. Moreover, we determine the relationship between this filters and other types of filters in $BL$-algebras and G"{o} del algebra. Specially, we prove that in a G"{o}del algebra, any ...
l k=0 (−1) m−k l k m − k n 2k k − 2l + m = l k=0 l k 2k n n − l m + n − 3k − l. On the basis of this identity, for d ∈ {0, 1, 2,. .. } and ε ∈ {0, ±1} we construct explicit f ε (d) and g ε (d) such that for any prime p > d we have p−1 k=1 k ε C k+d ≡ f ε (d) if p ≡ 1 (mod 3), g ε (d) if p ≡ 2 (mod 3), where C n denotes the Catalan number 1 n+1 2n n ; for example, if p 5 is a prime then 0<k<p−4 ...
Abstract: Mutually unbiased bases generalize the X, Y and Z qubit bases. They possess numerous applications in quantum cryptography and quantum information. It is well-known that in prime power dimensions N = p (with p prime and m a positive integer) there exists a maximal set of N + 1 mutually unbiased bases. In the present paper, we derive a new, simple and compact expression for those bases,...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید