نتایج جستجو برای: rational character table
تعداد نتایج: 251555 فیلتر نتایج به سال:
It is well known that the adjacency algebra of an association scheme has the standard character. In this paper we first define the concept of standard character for C-algebras and we say that a C-algebra has the standard character condition if it has the standard character. Then we investigate some properties of C-algebras which have the standard character condition and prove that under some co...
Example 1.2. The trivial character of G is the homomorphism 1G defined by 1G(g) = 1 for all g ∈ G. Example 1.3. Let G be cyclic of order 4 with generator γ. Since γ4 = 1, a character χ of G has χ(γ)4 = 1, so χ takes only four possible values at γ, namely 1, −1, i, or −i. Once χ(γ) is known, the value of χ elsewhere is determined by multiplicativity: χ(γj) = χ(γ)j . So we get four characters, wh...
Example 1.2. The trivial character of G is the homomorphism 1G defined by 1G(g) = 1 for all g ∈ G. Example 1.3. Let G be cyclic of order 4 with generator γ. Since γ4 = 1, a character χ of G has χ(γ)4 = 1, so χ takes only four possible values at γ, namely 1, −1, i, or −i. Once χ(γ) is known, the value of χ elsewhere is determined by multiplicativity: χ(γj) = χ(γ)j . So we get four characters, wh...
In this paper we study the asymptotic behavior of the solution of the new class of the nonlinear rational Difference Equations. Namely, we consider the stability, boundedness, and periodicity of the solution. Moreover we give the periodic character of solutions of these equations, which is not familiar. We do not know a similar feature for other class of the nonlinear rational Difference Equati...
the full automorphism group of $u_6(2)$ is a group of the form $u_6(2){:}s_3$. the group $u_6(2){:}s_3$ has a maximal subgroup $2^9{:}(l_3(4){:}s_3)$ of order 61931520. in the present paper, we determine the fischer-clifford matrices (which are not known yet) and hence compute the character table of the split extension $2^9{:}(l_3(4){:}s_3)$.
Recently there has been a great deal of interest in studying the behaviour of rational difference equations. One of the properties which has attracted considerable attention from the experts in the research field is the boundedness character (see, e.g. [1–32] and the related references therein). This paper studies the boundedness character of positive solutions of the recursive equation yn = A+...
We call a finite group metabelian if its commutator subgroup is abelian. Thus a split metabelian group is a split extension of one abelian group by a second (possibly trivial) abelian group. In this paper we devise an algorithm for the construction of the character table of any split metabelian group G. The only requisites are that the reader be capable of deriving the character table for an ab...
Let q be a power of an odd prime number and Fq be the finite field with q elements. We will construct a binary spherical code from an algebraic curve C defined over Fq and a rational divisor G on C, as the twist by the quadratic character 11 of the Goppa code L(G). The computation of the parameters of this code is based on the study of some character sums. 0. Introduction. In a previous paper (...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید