997 resultados para Finite Group


Relevância:

100.00% 100.00%

Publicador:

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this work we make some contributions to the theory of actions of finite groups on products of spheres. Suppose that the group Z(q)(tau) acts freely on the product of k copies of spheres. Question: Is r less than or equal to k? We solve this question for several values of r and k.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Date of Acceptance: 09/06/2015

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Date of Acceptance: 09/06/2015

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Date of Acceptance: 09/06/2015

Relevância:

70.00% 70.00%

Publicador:

Resumo:

Network information theory and channels with memory are two important but difficult frontiers of information theory. In this two-parted dissertation, we study these two areas, each comprising one part. For the first area we study the so-called entropy vectors via finite group theory, and the network codes constructed from finite groups. In particular, we identify the smallest finite group that violates the Ingleton inequality, an inequality respected by all linear network codes, but not satisfied by all entropy vectors. Based on the analysis of this group we generalize it to several families of Ingleton-violating groups, which may be used to design good network codes. Regarding that aspect, we study the network codes constructed with finite groups, and especially show that linear network codes are embedded in the group network codes constructed with these Ingleton-violating families. Furthermore, such codes are strictly more powerful than linear network codes, as they are able to violate the Ingleton inequality while linear network codes cannot. For the second area, we study the impact of memory to the channel capacity through a novel communication system: the energy harvesting channel. Different from traditional communication systems, the transmitter of an energy harvesting channel is powered by an exogenous energy harvesting device and a finite-sized battery. As a consequence, each time the system can only transmit a symbol whose energy consumption is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is random, instantaneous, and has memory. Furthermore, naturally, the energy harvesting process is observed causally at the transmitter, but no such information is provided to the receiver. Both of these features pose great challenges for the analysis of the channel capacity. In this work we use techniques from channels with side information, and finite state channels, to obtain lower and upper bounds of the energy harvesting channel. In particular, we study the stationarity and ergodicity conditions of a surrogate channel to compute and optimize the achievable rates for the original channel. In addition, for practical code design of the system we study the pairwise error probabilities of the input sequences.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

Gowers, dans son article sur les matrices quasi-aléatoires, étudie la question, posée par Babai et Sos, de l'existence d'une constante $c>0$ telle que tout groupe fini possède un sous-ensemble sans produit de taille supérieure ou égale a $c|G|$. En prouvant que, pour tout nombre premier $p$ assez grand, le groupe $PSL_2(\mathbb{F}_p)$ (d'ordre noté $n$) ne posséde aucun sous-ensemble sans produit de taille $c n^{8/9}$, il y répond par la négative. Nous allons considérer le probléme dans le cas des groupes compacts finis, et plus particuliérement des groupes profinis $SL_k(\mathbb{Z}_p)$ et $Sp_{2k}(\mathbb{Z}_p)$. La premiére partie de cette thése est dédiée à l'obtention de bornes inférieures et supérieures exponentielles pour la mesure suprémale des ensembles sans produit. La preuve nécessite d'établir préalablement une borne inférieure sur la dimension des représentations non-triviales des groupes finis $SL_k(\mathbb{Z}/(p^n\mathbb{Z}))$ et $Sp_{2k}(\mathbb{Z}/(p^n\mathbb{Z}))$. Notre théoréme prolonge le travail de Landazuri et Seitz, qui considérent le degré minimal des représentations pour les groupes de Chevalley sur les corps finis, tout en offrant une preuve plus simple que la leur. La seconde partie de la thése à trait à la théorie algébrique des nombres. Un polynome monogéne $f$ est un polynome unitaire irréductible à coefficients entiers qui endengre un corps de nombres monogéne. Pour un nombre premier $q$ donné, nous allons montrer, en utilisant le théoréme de densité de Tchebotariov, que la densité des nombres premiers $p$ tels que $t^q -p$ soit monogéne est supérieure ou égale à $(q-1)/q$. Nous allons également démontrer que, quand $q=3$, la densité des nombres premiers $p$ tels que $\mathbb{Q}(\sqrt[3]{p})$ soit non monogéne est supérieure ou égale à $1/9$.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

Marciniak and Sehgal showed that if u is a non-trivial bicyclic unit of an integral group ring then there is a bicyclic unit v such that u and v generate a non-abelian free group. A similar result does not hold for Bass cyclic units of infinite order based on non-central elements as some of them have finite order modulo the center. We prove a theorem that suggests that this is the only limitation to obtain a non-abelian free group from a given Bass cyclic unit. More precisely, we prove that if u is a Bass cyclic unit of an integral group ring ZG of a solvable and finite group G, such that u has infinite order modulo the center of U(ZG) and it is based on an element of prime order, then there is a non-abelian free group generated by a power of u and a power of a unit in ZG which is either a Bass cyclic unit or a bicyclic unit.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

If * : G -> G is an involution on the finite group G, then * extends to an involution on the integral group ring Z[G] . In this paper, we consider whether bicyclic units u is an element of Z[G] exist with the property that the group < u, u*> generated by u and u* is free on the two generators. If this occurs, we say that (u, u*)is a free bicyclic pair. It turns out that the existence of u depends strongly upon the structure of G and on the nature of the involution. One positive result here is that if G is a nonabelian group with all Sylow subgroups abelian, then for any involution *, Z[G] contains a free bicyclic pair.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

A simple procedure to obtain complete, closed expressions for Lie algebra invariants is presented. The invariants are ultimately polynomials in the group parameters. The construction of finite group elements requires the use of projectors, whose coefficients are invariant polynomials. The detailed general forms of these projectors are given. Closed expressions for finite Lorentz transformations, both homogeneous and inhomogeneous, as well as for Galilei transformations, are found as examples.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

Let G be a locally finite group satisfying the condition given in the title and suppose that G is not nilpotent-by-Chernikov. It is shown that G has a section S that is not nilpotent-by-Chernikov, where S is either a p-group or a semi-direct product of the additive group A of a locally finite field F by a subgroup K of the multiplicative group of F, where K acts by multiplication on A and generates F as a ring. Non-(nilpotent-by-Chernikov) extensions of this latter kind exist and are described in detail.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

We characterize the groups which do not have non-trivial perfect sections and such that any strictly descending chain of non-“nilpotent-by-finite” subgroups is finite.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 20D60,20E15.

Relevância:

70.00% 70.00%

Publicador:

Resumo:

We give a new proof that for a finite group G, the category of rational G-equivariant spectra is Quillen equivalent to the product of the model categories of chain complexes of modules over the rational group ring of the Weyl group of H in G, as H runs over the conjugacy classes of subgroups of G. Furthermore, the Quillen equivalences of our proof are all symmetric monoidal. Thus we can understand categories of algebras or modules over a ring spectrum in terms of the algebraic model.