Search results for: prime order

Authors: Shai Sarussi

Abstract:

The union of a nonempty chain of prime ideals in a noncommutative ring is not necessarily a prime ideal. An ideal is called union-prime if it is a union of a nonempty chain of prime ideals but is not a prime. In this paper, some relations between chains of prime ideals and the induced chains of union-prime ideals are shown; in particular, the cardinality of such chains and the cardinality of the sets of cuts of such chains are discussed. For a ring R and a nonempty full chain of prime ideals C of R, several characterizations for the property of immediate neighbors in C are given.

Keywords: prime ideals, union-prime ideals, immediate neighbors, Kaplansky's conjecture

Procedia PDF Downloads 106

Authors: Ying Yi Wu

Abstract:

The study of finite groups is a central topic in algebraic structures, and one of the most fundamental questions in this field is the classification of finite groups up to isomorphism. In this paper, we investigate the cyclic property of groups of prime order, which is a crucial result in the classification of finite abelian groups. We prove the following statement: If p is a prime, then every group G of order p is cyclic. Our proof utilizes the properties of group actions and the class equation, which provide a powerful tool for studying the structure of finite groups. In particular, we first show that any non-identity element of G generates a cyclic subgroup of G. Then, we establish the existence of an element of order p, which implies that G is generated by a single element. Finally, we demonstrate that any two generators of G are conjugate, which shows that G is a cyclic group. Our result has significant implications in the classification of finite groups, as it implies that any group of prime order is isomorphic to the cyclic group of the same order. Moreover, it provides a useful tool for understanding the structure of more complicated finite groups, as any finite abelian group can be decomposed into a direct product of cyclic groups. Our proof technique can also be extended to other areas of group theory, such as the classification of finite p-groups, where p is a prime. Therefore, our work has implications beyond the specific result we prove and can contribute to further research in algebraic structures.

Keywords: group theory, finite groups, cyclic groups, prime order, classification.

Procedia PDF Downloads 50

Authors: Jerry Hu

Abstract:

Let G = (V, E) with V = {1, 2, ..., k} be a graph, the k positive integers a₁, a₂, ..., ak are G-wise relatively prime if (aᵢ, aⱼ ) = 1 for {i, j} ∈ E. We use an inductive approach to give an asymptotic formula for the number of k-tuples of integers that are G-wise relatively prime. An exact formula is obtained for the probability that k positive integers are G-wise relatively prime. As a corollary, we also provide an exact formula for the probability that k positive integers have exactly r relatively prime pairs.

Keywords: graph, independent set, G-wise relatively prime, probability

Procedia PDF Downloads 58

Authors: Yingxu Wang

Abstract:

This work presents basic research on the recursive structures and dual sequential patterns of primes for the formal proof of the Twin-Prime Conjecture (TPC). A rigorous methodology of Twin-Prime Decomposition (TPD) is developed in MATLAB to inductively verify potential twins in the dual sequences of primes. The key finding of this basic study confirms that the dual sequences of twin primes are not only symmetric but also infinitive in the unique base 6 cycle, except a limited subset of potential pairs is eliminated by the lack of dual primality. Both theory and experiments have formally proven that the infinity of twin primes stated in TPC holds in the P x P space.

Keywords: number theory, primes, twin-prime conjecture, dual primes (P x P), twin prime decomposition, formal proof, algorithm

Procedia PDF Downloads 26

Authors: Elvira Kusniyanti, Hanni Garminia, Pudji Astuti

Abstract:

This research studies an interconnection between finitely generated uniform modules and Dedekind prime rings. The characterization of modules over Dedekind prime rings that will be investigated is an adoption of Noetherian and hereditary concept. Dedekind prime rings are Noetherian and hereditary rings. This property of Dedekind prime rings is a background of the idea of adopting arises. In Noetherian area, it was known that a ring R is Noetherian ring if and only if every finitely generated R-module is a Noetherian module. Similar to that result, a characterization of the hereditary ring is related to its projective modules. That is, a ring R is hereditary ring if and only if every projective R-module is a hereditary module. Due to the above two results, we suppose that characterization of a Dedekind prime ring can be analyzed from finitely generated modules over it. We propose a conjecture: a ring R is a Dedekind prime ring if and only if every finitely generated uniform R-module is a Dedekind module. In this article, we will generalize a concept of the Dedekind module for non-commutative ring case and present a part of the above conjecture.

Keywords: dedekind domains, dedekind prime rings, dedekind modules, uniform modules

Procedia PDF Downloads 408

Authors: Anthony Overmars, Sitalakshmi Venkatraman

Abstract:

This paper presents a method for determining all of the co-prime right angle triangles in the Euclidean field by looking at the intersection of the Pythagorean and Platonic right angle triangles and the corresponding lattice that this produces. The co-prime properties of each lattice point representing a unique right angle triangle are then considered. This paper proposes a conjunction between these two ancient disparaging theorists. This work has wide applications in information security where cryptography involves improved ways of finding tuples of prime numbers for secure communication systems. In particular, this paper has direct impact in enhancing the encryption and decryption algorithms in cryptography.

Keywords: Pythagorean triples, platonic triples, right angle triangles, co-prime numbers, cryptography

Procedia PDF Downloads 194

Authors: Nidal Ali

Abstract:

Consider an algebraic number field K of degree n, A0 K is its ring of integers and a prime number p inert in K. Let F(u1, . . . , un, x) be the generic polynomial of integers of K. We will study in advance the stability of this polynomial and then, we will apply it in order to obtain all the monic irreducible polynomials in Fp[x] of degree d dividing n.

Keywords: generic polynomial, irreducibility, iteration, stability, inert prime, totally ramified

Procedia PDF Downloads 313

Authors: Hashem Sazegar

Abstract:

In 1937, Vinograd of Russian Mathematician proved that each odd large number can be shown by three primes. In 1973, Chen Jingrun proved that each odd number can be shown by one prime plus a number that has maximum two primes. In this article, we state one proof for Goldbach’conjecture. Introduction: Bertrand’s postulate state for every positive integer n, there is always at least one prime p, such that n < p < 2n. This was first proved by Chebyshev in 1850, which is why postulate is also called the Bertrand-Chebyshev theorem. Legendre’s conjecture states that there is a prime between n2 and (n+1)2 for every positive integer n, which is one of the four Landau’s problems. The rest of these four basic problems are; (i) Twin prime conjecture: There are infinitely many primes p such that p+2 is a prime. (ii) Goldbach’s conjecture: Every even integer n > 2 can be written asthe sum of two primes. (iii) Are there infinitely many primes p such that p−1 is a perfect square? Problems (i), (ii), and (iii) are open till date.

Keywords: Bertrand-Chebyshev theorem, Landau’s problems, twin prime, Legendre’s conjecture, Oppermann’s conjecture

Procedia PDF Downloads 361

Authors: Gurjit Kaur, Shashank Johri, Arpit Mehrotra

Abstract:

In this paper we have analyzed and compared the performance of various coding schemes. The basic ID prime sequence codes are unique in only dimension i.e. time slots whereas 2D coding techniques are not unique by their time slots but with their wavelengths also. In this research we have evaluated and compared the performance of 1D and 2D coding techniques constructed using prime sequence coding pattern for OCDMA system on a single platform. Results shows that 1D Extended Prime Code (EPC) can support more number of active users compared to other codes but at the expense of larger code length which further increases the complexity of the code. Modified Prime Code (MPC) supports lesser number of active users at λc=2 but it has a lesser code length as compared to 1D prime code. Analysis shows that 2D prime code supports lesser number of active users than 1D codes but they are having large code family and are the most secure codes compared to other codes. The performance of all these codes is analyzed on basis of number of active users supported at a Bit Error Rate (BER) of 10-9.

Keywords: CDMA, OCDMA, BER, OOC, PC, EPC, MPC, 2-D PC/PC, λc, λa

Procedia PDF Downloads 478

Authors: Abubakar Danbaba

Abstract:

Sudoku squares have been widely used to design an experiment where each treatment occurs exactly once in each row, column or sub-block. For some experiments, the size of row (or column or sub-block) may be larger than the number of treatments. Since each treatment appears only once in each row (column or sub-block) with an additional empty cell such designs are partially balanced Sudoku designs (PBSD) with NP-complete structures. This paper proposed methods for constructing PBSD of prime order of treatments by a modified Kronecker product and swap of matrix row (or column) in cyclic order. In addition, linear model and procedure for the analysis of data for PBSD are proposed.

Keywords: sudoku design, partial sudoku, NP-complete, Kronecker product, row and column swap

Procedia PDF Downloads 243

Authors: A. I. Augie, Y. Alhassan, U. Z. Magawata

Abstract:

Geophysical investigation was carried out at wacot rice factory Argungu north-western Nigeria, using the 2D electrical resistivity method. The area falls between latitude 12˚44′23ʺN to 12˚44′50ʺN and longitude 4032′18′′E to 4032′39′′E covering a total area of about 1.85 km. Two profiles were carried out with Wenner configuration using resistivity meter (Ohmega). The data obtained from the study area were modeled using RES2DIVN software which gave an automatic interpretation of the apparent resistivity data. The inverse resistivity models of the profiles show the high resistivity values ranging from 208 Ωm to 651 Ωm. These high resistivity values in the overburden were due to dryness and compactness of the strata that lead to consolidation, which is an indication that the area is free from leachate contaminations. However, from the inverse model, there are regions of low resistivity values (1 Ωm to 18 Ωm), these zones were observed and identified as clayey and the most contaminated zones. The regions of low resistivity thereby indicated the leachate plume or the highly leachate concentrated zones due to similar resistivity values in both clayey and leachate. The regions of leachate are mainly from the factory into the surrounding area and its groundwater. The maximum leachate infiltration was found at depths 1 m to 15.9 m (P1) and 6 m to 15.9 m (P2) vertically, as well as distance along the profiles from 67 m to 75 m (P1), 155 m to 180 m (P1), and 115 m to 192 m (P2) laterally.

Keywords: contaminant, leachate, soil, groundwater, electrical, resistivity

Procedia PDF Downloads 135

Authors: Abdelkarim Boua, Abdelhakim Chillali

Abstract:

The study of non-associative structures in algebraic structures has become a separate entity; for, in the case of groups, their corresponding non-associative structure i.e. loops is dealt with separately. Similarly there is vast amount of research on the nonassociative structures of semigroups i.e. groupoids and that of rings i.e. nonassociative rings. However it is unfortunate that we do not have a parallel notions or study of non-associative near-rings. In this work we shall attempt to generalize a few known results and study the commutativity of Jordan ideal in 3-prime near-rings satisfying certain identities involving the Jordan ideal. We study the derivations satisfying certain differential identities on Jordan ideals of 3-prime near-rings. Moreover, we provide examples to show that hypothesis of our results are necessary. We give some new results and examples concerning the existence of Jordan ideal and derivations in near-rings. These near-rings can be used to build a new codes.

Keywords: 3-prime near-rings, near-rings, Jordan ideal, derivations

Procedia PDF Downloads 274

Authors: S. Dey, P. Sibanda, S. Gupta, A. Chakraborty

Abstract:

The occurrence of high nocturnal surface ozone over a tropical urban area (23̊ 32′16.99″ N and 87̊ 17′ 38.95″ E) is analyzed in this paper. Five incidences of nocturnal ozone maxima are recorded during the observational span of two years (June, 2013 to May, 2015). The maximum and minimum values of the surface ozone during these five occasions are 337.630 μg/m³ and 13.034 μg/m³ respectively. HYSPLIT backward trajectory analyses and wind rose diagrams support the horizontal transport of ozone from distant polluted places. Planetary boundary layer characteristics, concentration of precursor (NO₂) and meteorology are found to play important role in the horizontal and vertical transport of surface ozone during nighttime.

Keywords: nocturnal ozone, planetary boundary layer, horizontal transport, meteorology, urban area

Procedia PDF Downloads 259

Authors: Gurjit Kaur, Neena Gupta

Abstract:

In this paper, we have analyzed and compared the performance of various coding schemes. The basic ID prime sequence codes are unique in only dimension, i.e. time slots, whereas 2D coding techniques are not unique by their time slots but with their wavelengths also. In this research, we have evaluated and compared the performance of 1D and 2D coding techniques constructed using prime sequence coding pattern for Optical Code Division Multiple Access (OCDMA) system on a single platform. Analysis shows that 2D prime code supports lesser number of active users than 1D codes, but they are having large code family and are the most secure codes compared to other codes. The performance of all these codes is analyzed on basis of number of active users supported at a Bit Error Rate (BER) of 10-9.

Keywords: CDMA, OCDMA, BER, OOC, PC, EPC, MPC, 2-D PC/PC, λc, λa

Procedia PDF Downloads 309

Authors: Aaminah Hassan

Abstract:

Advertisements carry a great potential to influence our lives because they are crafted to meet particular ends. Stereotypical representation in advertisements is capable of forming unconscious attitudes among people towards any gender and their abilities. This study focuses on gender representation in Pakistani prime time advertisements. For this purpose, 13 advertisements were selected from three different categories of foods and beverages, cosmetics, cell phones and cellular networks from the prime time slots of one of the leading Pakistani entertainment channel, ‘Urdu 1’. Both quantitative and qualitative analyses are carried out for range of variables like gender, age, roles, activities, setting, appearance and voice overs. The results revealed that gender representation in advertisements is stereotypical. Moreover, in few instances, the portrayal of women is not only culturally inappropriate but is demeaning to the image of women as well. Their bodily charm is used to promote products. Comparing different entertainment channels for their prime time advertisements and broadening the scope of this research will yield greater implications for the researchers who want to carry out the similar research. It is hoped that the current study would help in the promotion of media literacy among the viewers and media authorities in Pakistan.

Keywords: Advertisements, Content Analysis, Gender, Prime time

Procedia PDF Downloads 183

Authors: Hashem Sazegar

Abstract:

Legendre’s conjecture states that there is a prime number between n^2 and (n + 1)^2 for every positive integer n. In this paper we prove that every composite number between n2 and (n + 1)2 can be written u^2 − v^2 or u^2 − v^2 + u − v that u > 0 and v ≥ 0. Using these result as well as induction and residues (modq) we prove Legendre’s conjecture.

Keywords: bertrand-chebyshev theorem, landau’s problems, goldbach’s conjecture, twin prime, ramanujan proof

Procedia PDF Downloads 329

Authors: Tun Myat Aung, Ni Ni Hla

Abstract:

This paper begins by describing basic properties of finite field and elliptic curve cryptography over prime field and binary field. Then we discuss the discrete logarithm problem for elliptic curves and its properties. We study the general common attacks on elliptic curve discrete logarithm problem such as the Baby Step, Giant Step method, Pollard’s rho method and Pohlig-Hellman method, and describe in detail experiments of these attacks over prime field and binary field. The paper finishes by describing expected running time of the attacks and suggesting strong elliptic curves that are not susceptible to these attacks.c

Keywords: discrete logarithm problem, general attacks, elliptic curve, prime field, binary field

Procedia PDF Downloads 197

Authors: Saurabh Rawat, Anushree Sah

Abstract:

K Maps are generally and ideally, thought to be simplest form for obtaining solution of Boolean equations. Cubical Representation of Boolean equations is an alternate pick to incur a solution, otherwise to be meted out with Truth Tables, Boolean Laws, and different traits of Karnaugh Maps. Largest possible k- cubes that exist for a given function are equivalent to its prime implicants. A technique of minimization of Logic functions is tried to be achieved through cubical methods. The main purpose is to make aware and utilise the advantages of cubical techniques in minimization of Logic functions. All this is done with an aim to achieve minimal cost solution.r

Keywords: K-maps, don’t care conditions, Boolean equations, cubes

Procedia PDF Downloads 361

Authors: Djalal Boualili

Abstract:

This article considers the problem of sizing prime movers for combined heating and power (CHP) systems operating at full load to satisfy a fraction of a facility's electric load, i.e. a base load. Prime mover sizing is examined using three criteria: operational cost, carbon dioxide emissions (CDE), and primary energy consumption (PEC). The sizing process leads to consider ratios of conversion factors applied to imported electricity to conversion factors applied to fuel consumed. These ratios are labelled RCost, R CDE, R PEC depending on whether the conversion factors are associated with operational cost, CDE, or PEC, respectively. Analytical results show that in order to achieve savings in operational cost, CDE, or PEC, the ratios must be larger than a unique constant R Min that only depends on the CHP components efficiencies. Savings in operational cost, CDE, or PEC due to CHP operation are explicitly formulated using simple equations. This facilitates the process of comparing the tradeoffs of optimizing the savings of one criterion over the other two – a task that has traditionally been accomplished through computer simulations. A hospital building, located in Chlef, Algeria, was used as an example to apply the methodology presented in this article.

Keywords: sizing, heating and power, ratios, energy consumption, carbon dioxide emissions

Procedia PDF Downloads 201

Authors: Nikolai Krainiukov, Boris Melnikov

Abstract:

We study the properties of maximal prefix codes. The codes have many applications in computer science, theory of formal languages, data processing and data classification. Practical application is based on the representation of the maximal prefix codes as a sequence of words in a specific order. Our approach to study uses finite state automata (so-called flower automata) for the representation of prefix codes. An important task is the decomposition of prefix codes into prime prefix codes (factors). We discuss the properties of such prefix code decompositions. A linear time algorithm is designed which find the prime decomposition. To verify the correctness of the proposed algorithms, we implemented a system computer algebra GAP.

Keywords: maximal prefix code, regular languages, flower automata, prefix code decomposing

Procedia PDF Downloads 44

Authors: William Wong, Zakaria Alomari, Hon Ching Lai, Zhida Li

Abstract:

Modern-day information security depends on implementing Diffie-Hellman, which requires the generation of prime numbers. Because the number of primes is infinite, it is impractical to store prime numbers for use, and therefore, primality tests are indispensable in modern-day information security. A primality test is a test to determine whether a number is prime or composite. There are two types of primality tests, which are deterministic tests and probabilistic tests. Deterministic tests are adopting algorithms that provide a definite answer whether a given number is prime or composite. While in probabilistic tests, a probabilistic result would be provided, there is a degree of uncertainty. In this paper, we review three probabilistic tests: the Fermat Primality Test, the Miller-Rabin Test, and the Baillie-PSW Test, as well as one deterministic test, the Agrawal-Kayal-Saxena (AKS) Test. Furthermore, we do an analysis of these tests. All of the reviews discussed are not based on the Elliptic Curve. The analysis demonstrates that, in the majority of real-world scenarios, the Baillie- PSW test’s favorability stems from its typical operational complexity of O(log 3n) and its capacity to deliver accurate results for numbers below 2^64.

Keywords: primality tests, Fermat’s primality test, Miller-Rabin primality test, Baillie-PSW primality test, AKS primality test

Procedia PDF Downloads 51

Authors: Shai Sarussi

Abstract:

Suppose F is a field with valuation v and valuation domain Oᵥ, and R is an Oᵥ-algebra. It is known that there exists a filter quasi-valuation on R; the existence of a quasi-valuation yields several important connections between Oᵥ and R, in particular with respect to their prime spectra. In this paper, the notion of a module valuation is introduced. It is shown that any torsion-free module over Oᵥ has an induced module valuation. Moreover, several results connecting the filter quasi-valuation and module valuations are presented.

Keywords: valuations, quasi-valuations, prime spectrum, algebras over valuation domains

Procedia PDF Downloads 189

Authors: Mohammad Java Esmaeily

Abstract:

Background: We evaluate the effects of tissue and organ perfusion during and after coronary artery bypass graft surgery with either colloid (Voluven) or crystalloid (Lactated ringers) as a prime solution. Materials and Methods: In this prospective randomized-controlled trial study, 70 patients undergoing on-pump coronary artery bypass graft surgery were randomly assigned to receive either colloid (Voluven) or crystalloid (Lactated ringer's) as a prime solution for initiation of cardiopulmonary bypass machine procedure. Tissue and organ perfusion markers, including lactate, troponin I, liver and renal function tests and electrolytes, were measured sequentially before induction (T1) to the second days after surgery (T5). Results: With the exception of chloride and potassium levels, no significant differences were detected in other measurements, and laboratory results were identical entirely in the two groups. Conclusion: Voluven® (hydroxyethyl starch, HES 130/0.4) has a not significant difference in comparison with crystalloid (Lactated ringer's) as priming solution on the basis of organ and tissue perfusion tests assessment.

Keywords: prime, colloid, crystalloid, lactate, troponin, hydroxyethyl starch

Procedia PDF Downloads 55

Authors: Chanon Promsakon, Sayan Panma

Abstract:

Let S be a finite semigroup, A a subset of S and f an endomorphism on S. The endo-Cayley digraph of a semigroup S corresponding to a connecting set A and an endomorphism f, denoted by endo − Cayf (S, A) is a digraph whose vertex set is S and a vertex u is adjacent to a vertex v if and only if v = f(u)a for some a ∈ A. A digraph D is called undirected if any edge uv in D, there exists an edge vu in D. We consider the undirectedness of an endo-Cayley of a cyclic group of order prime, Zp. In this work, we investigate conditions for connecting sets and endomorphisms to make endo-Cayley digraphs of cyclic groups of order primes be undirected. Moreover, we give some conditions for an undirected endo-Cayley of cycle group of any order.

Keywords: endo-Cayley graph, undirected digraphs, cyclic groups, endomorphism

Procedia PDF Downloads 308

Authors: Bingqing Xu, Wenxing Shuai

Abstract:

This study investigates the priming effects of different Chinese compound words by native Mandarin speakers. There are lots of homonym, polysemy, and synonym in Chinese. However, it is unclear which kind of words have the biggest priming effect. Native Mandarin speakers were tested in a visual-word lexical decision experiment. The stimuli, which are all two-character compound words, consisted of two parts: primes and targets. Five types of relationships were used in all stimuli: morphologically related condition, in which the prime and the target contain the same morpheme; orthographically related condition, in which the target and the prime contain the different morpheme with the same form; phonologically related condition, in which the target and the prime contain the different morpheme with the same phonology; semantically related condition, in which the target and the prime contain the different morpheme with similar meanings; totally unrelated condition. The time since participants saw the target to respond was recorded. Analyses on reaction time showed that the average reaction time of morphologically related targets was much shorter than others, suggesting the morphological priming effect is the biggest. However, the reaction time of the phonologically related conditions was the longest, even longer than unrelated conditions. According to scatter plots analyses, 86.7% of participants had priming effects in morphologically related conditions, only 20% of participants had priming effects in phonologically related conditions. These results suggested that morphologically related conditions had the biggest priming effect. The orthographically and semantically related conditions also had priming effects, whereas the phonologically related conditions had few priming effects.

Keywords: priming effect, morphology, phonology, semantics, orthography

Procedia PDF Downloads 115

Authors: Juraj Belan, Lenka Hurtalová, Eva Tillová, Alan Vaško, Milan Uhríčik

Abstract:

High-pressure turbine (HPT) blades of DV–2 jet engines are made from Ni–base superalloy, a former Soviet Union production, specified as ŽS6K. For improving its high-temperature resistance are blades covered with Al–Si diffusion layer. A regular operation temperature of HPT blades vary from 705°C to 750°C depending on jet engine regime. An over-crossing working temperature range causes degradation of protective alitize layer as well as base material–gamma matrix and gamma prime particles what decreases turbine blade lifetime. High-temperature degradation has mainly diffusion mechanism and causes coarsening of strengthening phase gamma prime and protective alitize layer thickness growing. All changes have a significant influence on high-temperature properties of base material.

Keywords: alitize layer, gamma prime phase, high-temperature degradation, Ni–base superalloy ŽS6K, turbine blade

Procedia PDF Downloads 500

Authors: Jawad Abuhlail, Hamza Hroub

Abstract:

Let R be a commutative ring. Representation theory studies the representation of R-modules as (possibly finite) sums of special types of R-submodules. Here we are interested in a class of R-modules between the class of semisimple R-modules and the class of R-modules that can be written as (possibly finite) sums of secondary R-submodules (we know that every simple R-submodule is secondary). We investigate R-modules which can be written as (possibly finite) sums of second R-submodules (we call those modules second representable). Moreover, we investigate the class of (main) second attached prime ideals related to a module with such representation. We provide sufficient conditions for an R-module M to get a (minimal) second representation. We also found the collection of second attached prime ideals for some types of second representable R-modules, in particular within the class of injective R-modules. As we know that every simple R-submodule is second and every second R-submodule is secondary, we can see the importance of the second representable R-module.

Keywords: lifting modules, second attached prime ideals, second representations, secondary representations, semisimple modules, second submodules

Procedia PDF Downloads 155

Authors: Hossein Pourali

Abstract:

In this paper, we extend the concepts of primal and weakly primal ideals for posets. Further, the diameter of the zero divisor graph of a poset with respect to a non-primal ideal is determined. The relation between primary and primal ideals in posets is also studied.

Keywords: ‎associated prime ideal, ‎‎ideal, ‎‎primary ideal, primal ideal‎, prime‎ ‎ideal, semiprime ideal, ‎weakly primal ideal, zero divisors graph

Procedia PDF Downloads 229

Authors: Eric Bonetto, Anthony Piermatteo, Fabien Girandola, Gregory Lo Monaco

Abstract:

The present contribution focuses on the effect of the structure of social representations on group identification. A social representation (SR) is defined as an organized and structured set of cognitions, produced and shared by members of a same group about a same social object. Within this framework, the central core theory establishes a structural distinction between central cognitions – or 'core' – and peripheral ones: the former are theoretically considered as more connected than the later to group members’ social identity and may play a greater role in SRs’ ability to allow group identification by means of a common vision of the object of representation. Indeed, the central core provides a reference point for the in-group as it constitutes a consensual vision that gives meaning to a social object particularly important to individuals and to the group. However, while numerous contributions clearly refer to the underlying role of SRs in group identification, there are only few empirical evidences of this aspect. Thus, we hypothesize an effect of the structure of SRs on group identification. More precisely, central cognitions (vs. peripheral ones) will lead to a stronger group identification. In addition, we hypothesize that the refutation of a cognition will lead to a stronger group identification than its activation. The SR mobilized here is that of 'studying' among a population of first-year undergraduate psychology students. Thus, a pretest (N = 82), using an Attribute-Challenge Technique, was designed in order to identify the central and the peripheral cognitions to use in the primings of our main study. The results of this pretest are in line with previous studies. Then, the main study (online; N = 184), using a social priming methodology, was based on a 2 (Structural status of the cognitions belonging to the prime: central vs. peripheral) x 2 (Type of prime: activation vs. refutation) experimental design in order to test our hypotheses. Results revealed, as expected, the main effect of the structure of the SR on group identification. Indeed, central cognitions trigger a higher level of identification than the peripheral ones. However, we observe neither effect of the type of prime, nor interaction effect. These results experimentally demonstrate for the first time the effect of the structure of SRs on group identification and indicate that central cognitions are more connected than peripheral ones to group members’ social identity. These results will be discussed considering the importance of understanding identity as a function of SRs and on their ability to potentially solve the lack of consideration of the definition of the group in Social Representations Theory.

Keywords: group identification, social identity, social representations, structural approach

Procedia PDF Downloads 168

Authors: Khairil Ahmad, Jenny Gryzelius, Mohd Helmi Mohd Sobri

Abstract:

With the waning support for centrist ‘third-way’ politics across the Western world, there has been an increase in political parties and individual candidates relying on populist political discourse and rhetoric in order to capitalize on the sense of frustration apparent within the electorate. What is of note is the divergence in the discourses employed. On the one hand, there is a polarization between a growing wave of populist right-wing parties and politicians, employing a mixture of economic populism with divisive nationalistic ideals such as restricted immigration, for example, the UK’s UKIP and Donald Trump in the US. On the other hand, there are resurgent, often grassroots-led, left-wing movements and politicians, such as Podemos in Spain and Jeremy Corbyn in the UK, focusing on anti-austerity measures and inclusive policies. In general, the concept of populism is often ascribed in a pejorative way. This is despite the success of populist left-wing governments across Latin America in recent times, especially in terms of reducing poverty. Nonetheless, recently, scholars such as Ernesto Laclau have tried to rethink populism as a social scientific concept which is essential in helping us make sense of contemporary political articulations. Using Laclau’s framework, this paper seeks to analyze poverty reduction policies in different iterations in the context of the tenures of three Prime Ministers of Malaysia. The first is Abdul Razak Hussein’s New Economic Policy, which focused on uplifting the economic position of Malaysia’s majority Malay population. The second is Mahathir Mohamad’s state-led neo-liberalization of the Malaysian economy, which focused on the creation of a core group of crony elites in order to spearhead economic development. The third is current Prime Minister Najib Razak’s targeted poverty eradication strategy through a focused program which directly provides benefits to recipients such as through direct cash transfers. The paper employs a discursive approach to trace elements of populism in these cases and highlight instances of how their strategies are articulated in ways that seek to appeal towards particular visions of national unity.

Keywords: discourse analysis, Malaysia, populism, poverty eradication

Procedia PDF Downloads 285