#jsDisabledContent { display:none; } My Account |  Register |  Help

Search Results (70 titles)

Searched over 7.2 Billion pages in 0.61 seconds

Decomposition (X)

 1|2|3|4 Records: 1 - 20 of 70 - Pages:
 Book Id: WPLBN0002118301 ► Abstract Description DetailsPhoto gallery of the decomposition of a European mole (Talpa talpa) during two months in the open air (garden).
 Book Id: WPLBN0002118300 ► Abstract Description DetailsPhoto gallery of decomposition of a Parus major, Great tit during two months in a bottle in the garden.
 Book Id: WPLBN0002097043 Subjects: Non Fiction, Algebra, Smarandache Collections ► Abstract Excerpt Details...In this section we give the definition of linear algebra and just state the few important theorems like Cayley Hamilton theorem, Cyclic Decomposition Theorem, Generalized Cayley Hamilton Theorem and give some properties about linear algebra.... Full Text Search Details...just state the few important theorems like Cayley Hamilton theorem, Cyclic Decomposition Theorem, Generalized Cayley Hamilton Theorem and give some ... ...olynomial divides the characteristic polynomial for T. THEOREM: (CYCLIC DECOMPOSITION THEOREM): Let T be a linear operator on a finite dimensiona... ...vector spaces over finite rings Z n . Study of projections E i , primary decomposition theorem in case of S-finite vector spaces will yield severa... ...pen to be S-vector space over each of these P i then we can have several decomposition of V each of which will depend on the fields P i . Such mix... ... W 1 , …, W k and T i = c 1 E 1 + … + c k E k (we have several such decompositions depending on the number of finite fields in Z n over whic... ... V 1 ∪ V 2 once those properties are true on V 1 and V 2 . The primary decomposition theorem and spectral theorem are also true is case of bivec... ...l bivector space. 38. State and prove the modified form of the primary decomposition, theorem in case of a linear bioperator T = T 1 ∪ T 2 on ... ...of T-ad-missible subbispace of V. 40. Give the modified form of Cyclic Decomposition Theorem in case of a linear bioperator T on a finite dimen... ...99 Consumption vectors, 33-5 Cycle bimatrix birepresentation, 106 Cyclic Decomposition Theorem, 7, 9 D Diagonalizable operator, 45 Directed ...
 Date: 2013, Volume 2, July 2009 Book Id: WPLBN0002828340 ► Abstract Table of Contents Details...ic and Totally Cyclic Orientations with That of Spanning Trees of a Graph BY RODOLFO CONDE AND CRIEL MERINO . . . . . . . . . . . . . . . . . . 79 Decomposition of Graphs into Internally Disjoint Trees BY S.SOMASUNDARAM, A.NAGARAJAN AND G.MAHADEVAN . . . . . . . . 90 An Introduction to Combinatorial Geometry with Application to Field Theory . . 104 ...
 Date: 2013, Volume 2, July 2010 Book Id: WPLBN0002828342 ► Abstract Table of Contents Details... . . . . . 65 New Families of Mean Graphs BY SELVAM AVADAYAPPAN AND R. VASUKI . . . . . . . . . . . . . . . . . . 68 The (a, d)-Ascending Subgraph Decomposition BY A. NAGARAJAN, S. NAVANEETHA KRISHNAN AND R. KALA . . . . . . 81 Smarandachely Roman Edge s-Dominating Function BY KARAM EBADI AND L. PUSHPALATHA . . . . . . . . . . . . . . . . . . 95 Euler-Savary Formula...
 Date: 2013, Volume 1, April 2009 Book Id: WPLBN0002828332 ► Abstract Table of Contents Details.... . . 46 Smarandachely k -Constrained labeling of Graphs BY SHREEDHARK, B. SOORYANARAYANA AND RAGHUNATHP . . . . . . . . . . .50 Equiparity Path Decomposition Number of a Graph BY K. NAGARAJAN, A. NAGARAJAN AND I. SAHUL HAMID . . . . . . . . . . . . . 61 Edge Detour Graphs with Edge Detour Number 2 BY A.P. SANTHAKUMARAN AND S.S.ATHISAYANATHAN. . . . . . . . . . . ...
 Book Id: WPLBN0002097645 Subjects: Non-Fiction, Education, Smarandache Collections Collections: Literature, Education, Authors Community, Mathematics ► Abstract Full Text Search Details...cle in the representation of L n (m) and using this we find out the cycle decomposition of L n (m). Further, we prove that the number of different r... ... contain a k-cycle say (x 1 , x 2 , … , x k ) (as we are taking the cycle decomposition of elements other than a and e, x i ≠ e and x i ≠ a, for i... ...gth k. Using the theorem and corollaries already proved we find out the decomposition of L n (m) when n is a composite number. THEOREM [65]: L... ...ample. Example 2.7.2: Let L 45 (8) ∈ L 45 . We will find out the cycle decomposition in the representation of the loop L 45 (8). Here m = 8 and k... ...he same cycle class. Proof: As in theorems and results we see the cycle decomposition does not depend on the choice of a ∈ L n (m), that is it is ... ...ents in L 5 (2) such that the set with a specified subgroup A gives coset decomposition in a disjoint way which is a partition of L 5 (2). For exampl... ... 2}, 5A 1 = {5, 7}, 6A 1 = {6, 5} and 7A 1 = {7, 3}. S-right coset decomposition by A 1 is A 1 = {1, e}, A 1 2 = {2, 4}, A 1 3 = {3,7}, A ... ... 1 4 ∪ A 1 6 ∪ A 1 7 = {e, 1} ∪ {4, 3} ∪ {6, 2} ∪ {7, 5}. S-left coset decomposition by A 1 is A 1 = {1, e}, 2A 1 = {6, 3}, 3A 1 = {3, 4}, 4A 1... ... and S-right coset are the same. Consider A 2 = {e, 4}. S-right coset decomposition by A 2 . A 2 = {e, 4}, A 2 • 1 = {1, 2}, A 2 • 2 = {2, 5}...
 Book Id: WPLBN0002118115 Subjects: Fiction, Drama and Literature, Literary fiction Collections: Literature, Authors Community, Biographies ► Abstract Full Text Search Details...ed how much of his parents' bodies would have been consumed by bacteria in decomposition if they had not been cremated. He wondered if things were so ...
 Date: 2013, Volume: Second Edition Book Id: WPLBN0002828178 Subjects: Non Fiction, Education, Geometry ► Abstract Table of Contents Details...binatorial Euclidean space . . . . . . . . . . . . . . . . 163 4.1.2 Combinatorial fan-space . . . . . . . . . . . . . . . . . . . . . . .173 4.1.3 Decomposition space into combinatorial one . . . . . . . . . . 176 4.2 Combinatorial manifolds . . . . . . . . . . . . . . . . . . . . 179 4.2.1 Combinatorial manifold . . . . . . . . . . . . . . . . 179 4.2.2 Combinatoria...
 Date: 2013, Volume 3 Book Id: WPLBN0002828228 ► Abstract Table of Contents Details...P transformation . . . 60 1.9 Belief Conditioning Rules . . . . . . . 62 1.9.1 Shafer’s Conditioning Rule (SCR) . . . . . 62 1.9.2 Hyper-Power Set Decomposition (HPSD) . . . 63 1.9.3 Quantitative belief conditioning rules (BCR) . . . 63 1.9.4 Qualitative belief conditioning rules . . . . . 66 1.10 Conclusion . . . . . . . . . . 68 1.11 References . . . . . . . . . ....
 Book Id: WPLBN0002097100 ► Abstract Full Text Search Details...EOREM 2.6.2: A connected graph is Eulerian if and only if it admits a cycle decomposition. The following example gives a Eulerian graph with edge... ...REM 2.6.4: A graph is Eulerian if and only if it has an odd number of cycle decompositions. Now we just recall the definition of Eulerian digraph.... ...eutrosophic graph is neutrosophic Eulerian if and only if it admits a cycle decomposition?” o r “A connected neutrosophic graph is neutrosophic ... ...utrosophic Eulerian if and only it has an odd number of neutrosophic cycle decomposition – Justify your claim. 14. A weak neutrosophic digraph D ...
 Book Id: WPLBN0002118113 Subjects: Fiction, Drama and Literature, Literary fiction Collections: Literature, Law, Sociology, Authors Community, United States ► Abstract Full Text Search Details...ns, the product of two bodies that could never be altered until death and decomposition. As family was a chosen commitment, a contract signed not b... ...hought, this enlargement was the fog's rigor mortis, and evaporation its decomposition. But, whatever the degree of her awareness, there was some ... ...cage of her own, and it was indeed odd and a source of consternation. The decompositions beneath the etchings of tombstones had once been individuals... ... of her body notwithstanding how filthy and fetid the mental and physical decomposition was. Any miniscule interaction, any words that might slightl...
 Book Id: WPLBN0002097136 Subjects: Non Fiction, Education, Smarandache Collections Collections: Math, Literature, Education, Authors Community, Mathematics ► Abstract Full Text Search Details...      ≤ ≤ L where ) ! ( 2 p e is the exponent of 2 in the prime number decomposition of ! p . E(x) is the greatest integer less than or equal... ... p e p p e p p p p L ⋅ = where i p is the th i − prime of the prime number decomposition of ! p . It is clear that , 2 1 = p p p s = , 1 ) ! ( = ... ... Proof: Having = ) (k e p exponent of the prime number p in the prime decomposition of k. We get: ()        ...
 Book Id: WPLBN0002097095 ► Abstract Full Text Search Details...r of the map theory with other mathematics. In fact, maps as a kind of the decomposition of surfaces, should be given more attention to its role in su... ...m Lemma 2.4.1 Let N = k i=1 p r i i ,p 1
 Book Id: WPLBN0002096589 Subjects: Non Fiction, Education, Algebra Collections: Math, Literature, Education, Algebra, Authors Community, Mathematics ► Abstract Full Text Search Details... distinct equivalence classes of an equivalence relation on A provide us with a decomposition of A as a union of mutually disjoint subsets. Conversel... ...decomposition of A as a union of mutually disjoint subsets. Conversely, given a decomposition of A as a union of mutually disjoint, nonempty subsets,... ... isomorphic to G i . Moreover G = 1 G 2 G ... n G and every g ∈ G has a unique decomposition; g = 1 g 2 g ... n g where 1 g ∈ 1 G , 2 g ∈ 2 G ,... ...che symmetric semigroup for the group A 5 and S 5 , find the Smarandache coset decomposition of S(5) relative to A 5 and S 5 . 48 PROBLEM 44... ... and x ∉ S 6 such that xS 6 = S 6 x. PROBLEM 47: Does the Smarandache coset decomposition of S(6) by S 6 divide S(6) into equivalence classes o... ...ement in S 2×2 . 7. Find a subgroup A of order 3 and find the Smarandache coset decomposition of S 2×2 . PROBLEM 29: Find all Smarandache non p-S... ... is x = aya -1 . Then all the three elements a, x, y ∈ S n have the same cycle decomposition. Proof: Now to show x is Smarandache conjugate with ... ...in S n are Smarandache conjugate if and only if x, y and a have the same cycle decomposition. that is if x = aya -1 then x is Smarandache conjugat... ...f and only if all the three permutations x, y and a in S n have the same cycle decomposition. To prove this first we prove the permutations x an...
 Book Id: WPLBN0002096588 Subjects: Non Fiction, Science, Number Theory ► Abstract Full Text Search Details... than . That is, is a multiplicative function. Therefore, if is the prime decomposition of , then the following identity is obviously: (1) The arith... ...s a prime and denotes the least integer greater than . So, if is the prime decomposition of , then the followinig identity is obviously: (1) In this ... ...reatest integer less than or equal to . Therefore, if is the prime powers decomposition of , then we have 116 RESEARCH ON SMARANDACHE PROBLEMS IN N... ...mber dividing . That is, for any positive integer , if has the prime power decomposition , and are presented in the following where It is obvious to ...
 Book Id: WPLBN0002097092 ► Abstract Full Text Search Details...manifolds. These correspond to the triangulations of 2-manifolds, which are the decompositions of 2-manifolds into triangular disks (not necessarily ...
 Book Id: WPLBN0002097044 Collections: Math, Literature, Algebra, Authors Community, Mathematics ► Abstract Full Text Search Details...= V 1 ∪ V 2 once those properties are true on V 1 and V 2 . The primary decomposition theorem and spectral theorem are also true is case of bive... ...rong bimatrices instead bimatrices the very concept of bidiagonalization or decomposition as submatrices becomes entirely different. Now we give s... ...or a linear bioperator T = T 1 ∪ T 2 prove a theorem analogous to primary decomposition theorem. Hence or otherwise prove that any linear bioperat... ...ble? Find B = B 1 ∪ B 2 such that B is similar to A. 30. Prove primary decomposition theorem in case of finite dimensional neutrosophic bivecto...
 Book Id: WPLBN0002097108 Subjects: Non Fiction, Education, Smarandache Collections ► Abstract Full Text Search Details...determining P (or alternatively Q ) from R to Q (or alternatively R and P) as a decomposition of R with respect to Q (or alternatively with respect ... ...o P). Since many problems in various contexts can be formulated as problems of decomposition, the utility of any method for solving P ° Q = R is qu... ...ustrated. Assume that we have a method for solving P ° Q = R only for the first decomposition problem (given Q and R). Then we can directly utilize... ...ven Q and R). Then we can directly utilize this method for solving the second decomposition problem as well. We simply write P ° Q = R in the form... ...nknown) when its solution set is nonempty and b has an irredundant finite join- decomposition. By the way, we give the method to solve A ʘ X = b in ... ...p 1 , p 2 ,…, p n such that a i n i p V 1 = , we say that a has a finite join-decomposition. 163 Further, if for any j ∈ {1, 2,…,n}, we ha... ... for any j ∈ {1, 2,…,n}, we have moreover a ≠ n j i i V ≠ = , 1 p i , then the decomposition is called irredundant, and we say that a has an irred... ...sition is called irredundant, and we say that a has an irredundant finite join-decomposition. DEFINITION 1.27.3 [5]: A Brouwerian lattice is a la... ... Let J be a finite index set. If ℵ 2 ≠ φ, and b has an irredundant finite join-decomposition, then for each X ∈ ℵ 2 , there exists a minimal elemen...
 Book Id: WPLBN0002097105 ► Abstract Full Text Search Details...determining P (or alternatively Q ) from R to Q (or alternatively R and P) as a decomposition of R with respect to Q (or alternatively with respect ... ...o P). Since many problems in various contexts can be formulated as problems of decomposition, the utility of any method for solving P ° Q = R is qu... ...ustrated. Assume that we have a method for solving P ° Q = R only for the first decomposition problem (given Q and R). Then we can directly utilize... ...ven Q and R). Then we can directly utilize this method for solving the second decomposition problem as well. We simply write P ° Q = R in the form... ...nknown) when its solution set is nonempty and b has an irredundant finite join- decomposition. By the way, we give the method to solve A ʘ X = b in ... ...p 1 , p 2 ,…, p n such that a i n i p V 1 = , we say that a has a finite join-decomposition. 163 Further, if for any j ∈ {1, 2,…,n}, we ha... ... for any j ∈ {1, 2,…,n}, we have moreover a ≠ n j i i V ≠ = , 1 p i , then the decomposition is called irredundant, and we say that a has an irred... ...sition is called irredundant, and we say that a has an irredundant finite join-decomposition. DEFINITION 1.27.3 [5]: A Brouwerian lattice is a la... ... Let J be a finite index set. If ℵ 2 ≠ φ, and b has an irredundant finite join-decomposition, then for each X ∈ ℵ 2 , there exists a minimal elemen...
 1|2|3|4 Records: 1 - 20 of 70 - Pages: