875 resultados para Factorizations of Groups
Resumo:
Еленка Генчева, Цанко Генчев В настоящата работа се разглеждат крайни прости групи G , които могат да се представят като произведение на две свои собствени неабелеви прости подгрупи A и B. Всяко такова представяне G = AB е прието да се нарича факторизация на G, а тъй като множителите A и B са избрани да бъдат прости подгрупи на G, то разглежданите факторизации са известни още като прости факторизации на G. Тук се предполага, че G е проста група от лиев тип и лиев ранг 4 над крайно поле GF (q). Ключови думи: крайни прости групи, групи от лиев тип, факторизации на групи.
Resumo:
The layered chalcogenides, having structures analogous to graphite, are known to be unstable toward bending and show high propensity to form curved structures, thus eliminating dangling bonds at the edges. Since the discovery of fullerene and nanotube structures of WS2 and MoS2 by Tenne et al. [1-3], there have been attempts to prepare and characterize nanotubes of other layered dichalcogenides with structures analogous to MoS2. Nanotubes of MoS2 and WS2 were prepared by Tenne et al. by reducing the corresponding oxides to the suboxides followed by heating in an atmosphere of forming gas (5 % H-2 + 95 % N-2) and H2S at 700-900 degreesC [1-3]. Alternative methods of synthesis of MoS2 and WS2 nanotubes have since been proposed by employing the decomposition of the ammonium thiometallates or the corresponding trisulfide precursors. This alternative procedure was based on the observation that the trisulfide seems to be formed as an intermediate in the synthesis of the MoS2 and WS2 nanotubes [4]. Accordingly, the decomposition of the trisulfides of MoS2 and W in a reducing atmosphere directly yielded nanotubes of the disulfides MoS2 and WS2 [5]. In this article, we describe the synthesis, structure, and characterization of a few novel nanotubes of the disulfides of groups 4 and 5 metals. These include nanotubes of NbS2, TaS2, ZrS2, and HfS2. The study enlarges the scope of the inorganic nanotubes significantly and promises other interesting possibilities, including the synthesis of the diselenide nanotubes of these metals.
Resumo:
This paper extends the standard network centrality measures of degree, closeness and betweenness to apply to groups and classes as well as individuals. The group centrality measures will enable researchers to answer such questions as ‘how central is the engineering department in the informal influence network of this company?’ or ‘among middle managers in a given organization, which are more central, the men or the women?’ With these measures we can also solve the inverse problem: given the network of ties among organization members, how can we form a team that is maximally central? The measures are illustrated using two classic network data sets. We also formalize a measure of group centrality efficiency, which indicates the extent to which a group's centrality is principally due to a small subset of its members.
Resumo:
Agglomerative cluster analyses encompass many techniques, which have been widely used in various fields of science. In biology, and specifically ecology, datasets are generally highly variable and may contain outliers, which increase the difficulty to identify the number of clusters. Here we present a new criterion to determine statistically the optimal level of partition in a classification tree. The criterion robustness is tested against perturbated data (outliers) using an observation or variable with values randomly generated. The technique, called Random Simulation Test (RST), is tested on (1) the well-known Iris dataset [Fisher, R.A., 1936. The use of multiple measurements in taxonomic problems. Ann. Eugenic. 7, 179–188], (2) simulated data with predetermined numbers of clusters following Milligan and Cooper [Milligan, G.W., Cooper, M.C., 1985. An examination of procedures for determining the number of clusters in a data set. Psychometrika 50, 159–179] and finally (3) is applied on real copepod communities data previously analyzed in Beaugrand et al. [Beaugrand, G., Ibanez, F., Lindley, J.A., Reid, P.C., 2002. Diversity of calanoid copepods in the North Atlantic and adjacent seas: species associations and biogeography. Mar. Ecol. Prog. Ser. 232, 179–195]. The technique is compared to several standard techniques. RST performed generally better than existing algorithms on simulated data and proved to be especially efficient with highly variable datasets.
Resumo:
Tese de Doutoramento em Psicologia na área de especialização de Psicologia das Organizações apresentada ao ISPA - Instituto Universitário
Resumo:
Pardo, Patie, and Savov derived, under mild conditions, a Wiener-Hopf type factorization for the exponential functional of proper Lévy processes. In this paper, we extend this factorization by relaxing a finite moment assumption as well as by considering the exponential functional for killed Lévy processes. As a by-product, we derive some interesting fine distributional properties enjoyed by a large class of this random variable, such as the absolute continuity of its distribution and the smoothness, boundedness or complete monotonicity of its density. This type of results is then used to derive similar properties for the law of maxima and first passage time of some stable Lévy processes. Thus, for example, we show that for any stable process with $\rho\in(0,\frac{1}{\alpha}-1]$, where $\rho\in[0,1]$ is the positivity parameter and $\alpha$ is the stable index, then the first passage time has a bounded and non-increasing density on $\mathbb{R}_+$. We also generate many instances of integral or power series representations for the law of the exponential functional of Lévy processes with one or two-sided jumps. The proof of our main results requires different devices from the one developed by Pardo, Patie, Savov. It relies in particular on a generalization of a transform recently introduced by Chazal et al together with some extensions to killed Lévy process of Wiener-Hopf techniques. The factorizations developed here also allow for further applications which we only indicate here also allow for further applications which we only indicate here.
Resumo:
Estimating the sizes of hard-to-count populations is a challenging and important problem that occurs frequently in social science, public health, and public policy. This problem is particularly pressing in HIV/AIDS research because estimates of the sizes of the most at-risk populations-illicit drug users, men who have sex with men, and sex workers-are needed for designing, evaluating, and funding programs to curb the spread of the disease. A promising new approach in this area is the network scale-up method, which uses information about the personal networks of respondents to make population size estimates. However, if the target population has low social visibility, as is likely to be the case in HIV/AIDS research, scale-up estimates will be too low. In this paper we develop a game-like activity that we call the game of contacts in order to estimate the social visibility of groups, and report results from a study of heavy drug users in Curitiba, Brazil (n = 294). The game produced estimates of social visibility that were consistent with qualitative expectations but of surprising magnitude. Further, a number of checks suggest that the data are high-quality. While motivated by the specific problem of population size estimation, our method could be used by researchers more broadly and adds to long-standing efforts to combine the richness of social network analysis with the power and scale of sample surveys. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
Let G be a group, let S be a subgroup with infinite index in G and let FSG be a certain Z2G-module. In this paper, using the cohomological invariant E(G, S, FSG) or simply E˜(G, S) (defined in [2]), we analyze some results about splittings of group G over a commensurable with S subgroup which are related with the algebraic obstruction “singG(S)" defined by Kropholler and Roller ([8]. We conclude that E˜(G, S) can substitute the obstruction “singG(S)" in more general way. We also analyze splittings of groups in the case, when G and S satisfy certain duality conditions.
Resumo:
In the present paper we generalize the concept of groups with triality and apply it to the theory of the Moufang, Bol and Bruck loops. Such generalizations allow us to reduce certain problems from the loop theory to problems in the theory of groups.