The Role of Neoliberal Ideology and Globalization in Limiting Citizen Access to a Quality Education in Mexico

The aim of this study is to apply a content analysis to both ‘Keeping Kids in School’ (KKIS) and ‘The Youth Connection’ (TYC), grass-roots charities that fundraise educational resources and encourage Mexican students to stay in school, in order to identify recurring themes and collectivities of the Mexican education system. This study poses the question, “How has neoliberal globalization played a role in devaluing and minimizing citizenry access to a quality education in Mexico”? The two charities were chosen because their specific coordinating efforts—on behalf of shared interests to improve education in Mexico—reveals discursive constructions grounded on experiential knowledge from volunteering in Mexican schools. This study argues that Mexico’s insufficiencies in education cannot be analyzed in isolation from superior political and economic transformations within the state and, in turn, are a result of neoliberal globalization. Nonetheless, this approach goes beyond Marxian analysis. Instead it takes a modernist skeptical approach and utilizes post-structural feminist analysis to understand how intersectional subjective identities are constituted and produce collectivities. These collectivities formed specifically by KKIS and TYC, but also the communities they aid, and scholarship focused around them, reveal collective opinions regarding perceived classed, gendered and racialized subjective identities, institutionalizations and standpoints in the Mexican education system. This research paper argues that the normalization of inexperienced cheap labor is a main reason young Mexicans choose employment over school, a finding that is corroborated from an analysis of the media accounts of the KKIS and the TYC

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree.

A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its restriction to the neighborhood of every vertex of G is bijective, surjective, or injective, respectively. We prove that the problems of testing whether a given graph G allows a homomorphism to a given graph H that is locally bijective, surjective, or injective, respectively, are NP-complete, even when G has pathwidth at most 5, 4 or 2, respectively, or when both G and H have maximum degree 3. We complement these hardness results by showing that the three problems are polynomial-time solvable if G has bounded treewidth and in addition G or H has bounded maximum degree

Cluster Approximation for the Farey Fraction Spin Chain

We consider the Farey fraction spin chain in an external field $h$. Utilising ideas from dynamical systems, the free energy of the model is derived by means of an effective cluster energy approximation. This approximation is valid for divergent cluster sizes, and hence appropriate for the discussion of the magnetizing transition. We calculate the phase boundaries and the scaling of the free energy. At $h=0$ we reproduce the rigorously known asymptotic temperature dependence of the free energy. For $h \ne 0$, our results are largely consistent with those found previously using mean field theory and renormalization group arguments.Comment: 17 pages, 3 figure

Parameterizing by the Number of Numbers

The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization". In this paper we introduce and explore a novel but general form of parameterization: the number of numbers. Several classic numerical problems, such as Subset Sum, Partition, 3-Partition, Numerical 3-Dimensional Matching, and Numerical Matching with Target Sums, have multisets of integers as input. We initiate the study of parameterizing these problems by the number of distinct integers in the input. We rely on an FPT result for ILPF to show that all the above-mentioned problems are fixed-parameter tractable when parameterized in this way. In various applied settings, problem inputs often consist in part of multisets of integers or multisets of weighted objects (such as edges in a graph, or jobs to be scheduled). Such number-of-numbers parameterized problems often reduce to subproblems about transition systems of various kinds, parameterized by the size of the system description. We consider several core problems of this kind relevant to number-of-numbers parameterization. Our main hardness result considers the problem: given a non-deterministic Mealy machine M (a finite state automaton outputting a letter on each transition), an input word x, and a census requirement c for the output word specifying how many times each letter of the output alphabet should be written, decide whether there exists a computation of M reading x that outputs a word y that meets the requirement c. We show that this problem is hard for W[1]. If the question is whether there exists an input word x such that a computation of M on x outputs a word that meets c, the problem becomes fixed-parameter tractable

On vertex coloring without monochromatic triangles

We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. We give the first classification of the problem in terms of classic and parametrized algorithms. Several computational complexity results are also presented, which improve on the previous results found in the literature. We propose the new structural parameter for undirected, simple graphs -- the triangle-free chromatic number $\chi_3$. We bound $\chi_3$ by other known structural parameters. We also present two classes of graphs with interesting coloring properties, that play pivotal role in proving useful observation about our problem. We give/ask several conjectures/questions throughout this paper to encourage new research in the area of graph coloring.Comment: Extended abstrac

Sulforaphane, a cancer chemopreventive agent, induces pathways associated with membrane biosynthesis in response to tissue damage by aflatoxin B1

Aflatoxin B[subscript 1] (AFB[subscript 1]) is one of the major risk factors for liver cancer globally. A recent study showed that sulforaphane (SF), a potent inducer of phase II enzymes that occurs naturally in widely consumed vegetables, effectively induces hepatic glutathione S-transferases (GSTs) and reduces levels of hepatic AFB[subscript 1]-DNA adducts in AFB[subscript 1]-exposed Sprague Dawley rats. The present study characterized the effects of SF pre-treatment on global gene expression in the livers of similarly treated male rats. Combined treatment with AFB[subscript 1] and SF caused reprogramming of a network of genes involved in signal transduction and transcription. Changes in gene regulation were observable 4 h after AFB[subscript 1] administration in SF-pretreated animals and may reflect regeneration of cells in the wake of AFB[subscript 1]-induced hepatotoxicity. At 24 h after AFB[subscript 1] administration, significant induction of genes that play roles in cellular lipid metabolism and acetyl-CoA biosynthesis was detected in SF-pretreated AFB[subscript 1]-dosed rats. Induction of this group of genes may indicate a metabolic shift toward glycolysis and fatty acid synthesis to generate and maintain pools of intermediate molecules required for tissue repair, cell growth and compensatory hepatic cell proliferation. Collectively, gene expression data from this study provide insights into molecular mechanisms underlying the protective effects of SF against AFB[subscript 1] hepatotoxicity and hepatocarcinogenicity, in addition to the chemopreventive activity of this compound as a GST inducer.National Institutes of Health (U.S.) (Grants ES016313, P30-ES002109, P01 ES006052, P30 ES003819, and P30 CA006973