نتایج جستجو برای: commensurable
تعداد نتایج: 362 فیلتر نتایج به سال:
COMMENSURATORS OF RIGHT-ANGLED ARTIN GROUPS AND MAPPING CLASS GROUPS MATT CLAY, CHRISTOPHER J. LEININGER, AND DAN MARGALIT Abstract. We prove that, aside from the obvious exceptions, the mapping class We prove that, aside from the obvious exceptions, the mapping class group of a compact orientable surface is not abstractly commensurable with any right-angled Artin group. Our argument applies to...
The goal of this work was to optimize the combination natural dyes producing panchromatic absorption matched AM1.5 solar spectrum for use in dye sensitized cells (DSSCs). Six classes (Anthocyanins, Betalins, Chlorophyll, Xanthonoids, Curcuminoids and Phycobilins) were explored. UV-Vis data radial basis function interpolation used model absorbance 2568 combinations, three objective functions det...
A generalized Baumslag-Solitar group (GBS group) is a finitely generated group G which acts on a tree with all edge and vertex stabilizers infinite cyclic. We show that Out(G) either contains non-abelian free groups or is virtually nilpotent of class ≤ 2. It has torsion only at finitely many primes. One may decide algorithmically whether Out(G) is virtually nilpotent or not. If it is, one may d...
This article develops the concept ‘economies of affect’ to argue for increased anthropological attention to the roles of affect in facilitating economic transformations. The article draws on evidence from two ethnographic field projects, one in Mexico and the other in Indonesia, to show how affect was mobilized to create subjects commensurable with neoliberal norms. We show how embracing and cr...
A numerical method is presented which allows to compute the spectrum of the Schroedinger operator for a particle constrained on a two dimensional flat torus under the combined action of a transverse magnetic field and any conservative force. The method employs a fast Fourier transform to accurately represent the momentum variables and takes into account the twisted boundary conditions required ...
Learning is currently the focus of much research activity in cognitive science. But, typically, this research is oriented towards either the symbol-processing paradigm or the connectionist paradigm and therefore tends to generate models of two quite diierent types. A satisfactory theory of learning will, presumably, deal with the phenomenon in general terms rather than in terms of two special c...
This essay examines the history of European empire building and health work in sub-Saharan Africa, focusing on four patterns that shed light on the ethics of outside interventions: (1) the epidemiological and bodily harms caused by conquest and economic development; (2) the uneven and inadequate health infrastructures established during the colonial era, including certain iatrogenic consequence...
WikiSilo is a tool for theorizing across interdisciplinary fields such as Cognitive Science using a specific vocabulary and structure. It is designed to show if a particular cognitive theory is complete and coherent at multiple levels of discourse, and commensurable with and relevant to a wider domain of cognition. WikiSilo is also a minimalist theory and methodology about effectively doing sci...
Let G be a group and H a subgroup. It is shown that the set of indices {[H:HngHg~] | geG) has a finite upper bound n if and only if there is a normal subgroup N < G which is commensurable with //; i.e., such that [H:Nr\H] and [N:Nr>H] are finite; moreover, the latter indices admit bounds depending only on n. If the bounded index hypothesis is assumed only for g running over some subgroup K<G, t...
In this paper, we study approximate and exact controllability of the linear difference equation x(t) = ∑Nj=1A jx(t −Λ j) +Bu(t) in L2, with x(t) ∈ C and u(t) ∈ C, using as a basic tool a representation formula for its solution in terms of the initial condition, the control u, and some suitable matrix coefficients. When Λ1, . . . ,ΛN are commensurable, approximate and exact controllability are e...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید