Gotowe bibliografie tematyczne / Solvable groups / Rozprawy doktorskie
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Solvable groups.

Rozprawy doktorskie na temat „Solvable groups”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Solvable groups”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.

1

Bissler, Mark W. "Character degree graphs of solvable groups." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1497368851849153.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Wetherell, Chris. "Subnormal structure of finite soluble groups." View thesis entry in Australian Digital Theses Program, 2001. http://thesis.anu.edu.au/public/adt-ANU20020607.121248/index.html.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Sale, Andrew W. "The length of conjugators in solvable groups and lattices of semisimple Lie groups." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:ea21dab2-2da1-406a-bd4f-5457ab02a011.

Pełny tekst źródła
Streszczenie:
The conjugacy length function of a group Γ determines, for a given a pair of conjugate elements u,v ∈ Γ, an upper bound for the shortest γ in Γ such that uγ = γv, relative to the lengths of u and v. This thesis focuses on estimating the conjugacy length function in certain finitely generated groups. We first look at a collection of solvable groups. We see how the lamplighter groups have a linear conjugacy length function; we find a cubic upper bound for free solvable groups; for solvable Baumslag--Solitar groups it is linear, while for a larger family of abelian-by-cyclic groups we get either
Style APA, Harvard, Vancouver, ISO itp.
4

Bleak, Collin. "Solvability in groups of piecewise-linear homeomorphisms of the unit interval." Diss., Online access via UMI:, 2005.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Vershik, A. M., and Andreas Cap@esi ac at. "Geometry and Dynamics on the Free Solvable Groups." ESI preprints, 2000. ftp://ftp.esi.ac.at/pub/Preprints/esi899.ps.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Roth, Calvin L. (Calvin Lee). "Example of solvable quantum groups and their representations." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/28104.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Yang, Yong. "Orbits of the actions of finite solvable groups." [Gainesville, Fla.] : University of Florida, 2009. http://purl.fcla.edu/fcla/etd/UFE0024783.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Dugan, Carrie T. "Solvable Groups Whose Character Degree Graphs Have Diameter Three." Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1185299573.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Vassileva, Svetla. "The word and conjugacy problems in classes of solvable groups." Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66827.

Pełny tekst źródła
Streszczenie:
This thesis is a survey of certain algorithmic problems in group theory and their computational complexities. In particular, it consists of a detailed review of the decidability and complexity of the word and conjugacy problems in several classes of solvable groups, followed by two original results. The first result states that the Conjugacy Problem in wreath products which satisfy certain elementary conditions is decidable in polynomial time. It is largely based on work by Jane Matthews, published in 1969. The second result, based on ideas of Remeslennikov and Sokolov (1970)
Style APA, Harvard, Vancouver, ISO itp.
10

Sass, Catherine Bray. "Prime Character Degree Graphs of Solvable Groups having Diameter Three." Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1398110266.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
11

Psaras, Emanuel S. "A Study of Fixed-Point-Free Automorphisms and Solvable Groups." Youngstown State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1588762170044899.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
12

Decker, Erin. "On the construction of groups with prescribed properties." Diss., Online access via UMI:, 2008.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
13

Thomas, Teri M. "A generalization of Sylow's theorem /." Connect to resource online, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1256911896.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
14

Torres, Bisquertt María de la Luz. "Symmetric generation of finite groups." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2625.

Pełny tekst źródła
Streszczenie:
Advantages of the double coset enumeration technique include its use to represent group elements in a convenient shorter form than their usual permutation representations and to find nice permutation representations for groups. In this thesis we construct, by hand, several groups, including U₃(3) : 2, L₂(13), PGL₂(11), and PGL₂(7), represent their elements in the short form (symmetric representation) and produce their permutation representations.
Style APA, Harvard, Vancouver, ISO itp.
15

Mebane, Palmer. "Uniquely Solvable Puzzles and Fast Matrix Multiplication." Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/37.

Pełny tekst źródła
Streszczenie:
In 2003 Cohn and Umans introduced a new group-theoretic framework for doing fast matrix multiplications, with several conjectures that would imply the matrix multiplication exponent $\omega$ is 2. Their methods have been used to match one of the fastest known algorithms by Coppersmith and Winograd, which runs in $O(n^{2.376})$ time and implies that $\omega \leq 2.376$. This thesis discusses the framework that Cohn and Umans came up with and presents some new results in constructing combinatorial objects called uniquely solvable puzzles that were introduced in a 2005 follow-up paper, and which
Style APA, Harvard, Vancouver, ISO itp.
16

Wood, Lisa M. "ON THE SOLVABLE LENGTH OF ASSOCIATIVE ALGEBRAS, MATRIX GROUPS, AND LIE ALGEBRAS." NCSU, 2004. http://www.lib.ncsu.edu/theses/available/etd-10272004-164622/.

Pełny tekst źródła
Streszczenie:
Let A be an algebraic system with product a*b between elements a and b in A. It is of interest to compare the solvable length t with other invariants, for instance size, order, or dimension of A. Thus we ask, for a given t what is the smallest n such that there is an A of length t and invariant n. It is this problem that we consider for associative algebras, matrix groups, and Lie algebras. We consider A in each case to be subsets of (strictly) upper triangular n by n matrices. Then the invariant is n. We do these for the associative (Lie) algebras of all strictly upper triangular n by n matri
Style APA, Harvard, Vancouver, ISO itp.
17

Mohammed, Zakiyah. "Carter Subgroups and Carter's Theorem." Youngstown State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1310158687.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
18

ELSHARIF, RAMADAN. "The Average of Some Irreducible Character Degrees." Kent State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=kent1616410634054592.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
19

Santos, Edson Carlos Licurgo. "Estruturas complexas comauto-espaços nilpotentes e soluveis." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/305823.

Pełny tekst źródła
Streszczenie:
Orientador: Luiz Antonio Barrera San Martin<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica<br>Made available in DSpace on 2018-08-10T11:48:47Z (GMT). No. of bitstreams: 1 Santos_EdsonCarlosLicurgo_D.pdf: 405695 bytes, checksum: 334d5172d85f7bc35539dbd900fbef67 (MD5) Previous issue date: 2007<br>Resumo: Seja (g; [·,·]) uma álgebra de Lie com uma estrutura complexa integrável J. Os ± i-auto-espaços de J são subálgebras complexas de gC isomorfas a álgebra (g; [*]J ) com colchete [X * Y ]J = ½ ([X, Y ] - [JX, JY ]). Considera
Style APA, Harvard, Vancouver, ISO itp.
20

Qi, Dongwen. "On irreducible, infinite, non-affine coxeter groups." Columbus, Ohio : Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1185463175.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
21

Zergane, Amel. "Séparation des représentations des groupes de Lie par des ensembles moments." Thesis, Dijon, 2011. http://www.theses.fr/2011DIJOS086/document.

Pełny tekst źródła
Streszczenie:
Si (π, H) est une représentation unitaire irréductible d'un groupe de Lie G, on sait lui associer son application moment Ψπ. La fermeture de l'image de Ψπ s'appelle l'ensemble moment de π. Généralement, cet ensemble est Conv(Oπ), si Oπ est l'orbite coadjointe associée à π. Mais il ne caractérise pas π : deux orbites distinctes peuvent avoir la même enveloppe convexe fermée. On peut contourner cette non séparation en considérant un surgroupe G+ de G et une application non linéaire ø de g* dans (g+)* telle que, pour les orbites générique, ø(O) est une orbite et Conv (ø(O)) caractérise O. Dans ce
Style APA, Harvard, Vancouver, ISO itp.
22

Manríquez, Peñafiel Ronald. "Local approximation by linear systems and Almost-Riemannian Structures on Lie groups and Continuation method in rolling problem with obstacles." Electronic Thesis or Diss., université Paris-Saclay, 2022. https://theses.hal.science/tel-03716186.

Pełny tekst źródła
Streszczenie:
L'objectif de cette thèse est d'étudier deux sujets en géométrie sub-Riemannienne. D'une part, l'approximation locale d'une structure presque riemannienne aux points singuliers, et d'autre part, le système cinématique d’une variété à 2 dimensions roulant (sans torsion ni glissement) sur le plan euclidien avec des régions interdites. Une structure presque riemannienne de dimension n peut être définie localement par n champs vectoriels satisfaisant la condition de rang de l'algèbre de Lie, jouant le rôle d'un cadre orthonormé. L'ensemble des points où ces champs vectoriels sont colinéaires est a
Style APA, Harvard, Vancouver, ISO itp.
23

Zelaya, Carlos A. "6,6’-Dimethoxygossypol: Molecular Structure, Crystal Polymorphism, and Solvate Formation." ScholarWorks@UNO, 2011. http://scholarworks.uno.edu/td/136.

Pełny tekst źródła
Streszczenie:
6,6’-Dimethoxygossypol (DMG) is a natural product of the cotton variety Gossypium barbadense and a derivative of gossypol. Gossypol has been shown to form an abundant number of clathrates with a large variety of compounds. One of the primary reasons why gossypol can form clathrates has been because of its ability to from extensive hydrogen bonding networks due to its hydroxyl and aldehyde functional groups. Prior to this work, the only known solvate that DMG formed was with acetic acid. DMG has methoxy groups substituted at two hydroxyl positions, and consequently there is a decrease in its ab
Style APA, Harvard, Vancouver, ISO itp.
24

Sircana, Carlo [Verfasser], and Claus [Akademischer Betreuer] Fieker. "On the construction of number fields with solvable Galois group / Carlo Sircana ; Betreuer: Claus Fieker." Kaiserslautern : Technische Universität Kaiserslautern, 2021. http://d-nb.info/1236571916/34.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
25

Aziziheris, Kamal. "Determining Group Structure From the Sets of Character Degrees." Kent State University / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=kent1292619355.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
26

Gutierrez, Renan Campos. "O teorema da alternativa de Tits." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-05092012-113104/.

Pełny tekst źródła
Streszczenie:
Este projeto de mestrado tem por objetivo dar uma prova elementar do seguinte teorema de Tits, conhecido como Teorema da Alternativa de Tits: Seja G um grupo linear finitamente gerado sobre um corpo. Então G é solúvel por finito ou G contém um grupo livre não cíclico. Este teorema, que foi provado por J. Tits em 1972 [4], foi considerado pelo matemático J.P. Serre como um dos mais importantes resultados de álgebra do século XX. Quando dizemos uma prova elementar, não queremos absolutamente te dizer uma prova simples. Seguiremos a prova simplificada de John D. Dixon<br>This masters project aims
Style APA, Harvard, Vancouver, ISO itp.
27

Turkan, Erkan Murat. "On The Index Of Fixed Point Subgroup." Phd thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613522/index.pdf.

Pełny tekst źródła
Streszczenie:
Let G be a finite group and A be a subgroup of Aut(G). In this work, we studied the influence of the index of fixed point subgroup of A in G on the structure of G. When A is cyclic, we proved the following: (1) [G,A] is solvable if this index is squarefree and the orders of G and A are coprime. (2) G is solvable if the index of the centralizer of each x in H-G is squarefree where H denotes the semidirect product of G by A. Moreover, for an arbitrary subgroup A of Aut(G) whose order is coprime to the order of G, we showed that when G is solvable, then the Fitting length f([G,A]) of [G,A] is
Style APA, Harvard, Vancouver, ISO itp.
28

Kouki, Sami. "Étude des restrictions des séries discrètes de certains groupes résolubles et algébriques." Thesis, Poitiers, 2014. http://www.theses.fr/2014POIT2257/document.

Pełny tekst źródła
Streszczenie:
Soit G un groupe de Lie résoluble connexe et H un de ses sous-groupes fermés connexes d'algèbres de Lie g et h respectivement. On note g* (resp. h*) le dual linéaire de g (resp. h) ). Le sujet de ma thèse consiste à étudier la restriction d'une série discrète π de G, associée à une orbite coadjointe Ω C g*, à H. Si la restriction de π à H se décompose en somme directe de représentations de H avec multiplicités finies, on dit que π est H-admissible. Notons Pg,n : Ω → h* l'application restriction. Il s'agit de démontrer la conjecture suivante due à Michel Duflo : 1. La représentation π est H-adm
Style APA, Harvard, Vancouver, ISO itp.
29

Lyons, Corey Francis. "INDUCED CHARACTERS WITH EQUAL DEGREE CONSTITUENTS." Kent State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=kent1461594819.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
30

Thiery, Thimothée. "Analytical methods and field theory for disordered systems." Thesis, Paris Sciences et Lettres (ComUE), 2016. http://www.theses.fr/2016PSLEE017/document.

Pełny tekst źródła
Streszczenie:
Cette thèse présente plusieurs aspects de la physique des systèmes élastiques désordonnés et des méthodes analytiques utilisées pour les étudier. On s’intéressera d’une part aux propriétés universelles des processus d’avalanches statiques et dynamiques (à la transition de dépiégeage) d’interfaces élastiques de dimension arbitraire en milieu aléatoire à température nulle. Pour étudier ces questions nous utiliserons le groupe de renormalisation fonctionnel. Après une revue de ces aspects,nous présenterons plus particulièrement les résultats obtenus pendant la thèse sur (i) la structure spatiale
Style APA, Harvard, Vancouver, ISO itp.
31

Benjamin, Diane Mullan. "Character degrees and structure of solvable and p-solvable groups." 1997. http://catalog.hathitrust.org/api/volumes/oclc/37959599.html.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.)--University of Wisconsin--Madison, 1997.<br>Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 54-55).
Style APA, Harvard, Vancouver, ISO itp.
32

Lewis, Mark Lanning. "A new character correspondence for solvable groups." 1995. http://catalog.hathitrust.org/api/volumes/oclc/33663656.html.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.)--University of Wisconsin--Madison, 1995.<br>Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaf 131).
Style APA, Harvard, Vancouver, ISO itp.
33

Hamblin, James. "On solvable groups satisfying the two-prime hypothesis." 2002. http://www.library.wisc.edu/databases/connect/dissertations.html.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
34

Newton, Benjamin Willard. "Complex p-solvable linear groups of finite order." 2006. http://catalog.hathitrust.org/api/volumes/oclc/83777251.html.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
35

Ali, Asif. "Supersoluble groups of Wielandt length two." Phd thesis, 1997. http://hdl.handle.net/1885/145328.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
36

Short, M. W. "The primitive soluble permutation groups of degree less than 256." Phd thesis, 1990. http://hdl.handle.net/1885/139503.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
37

Wängefors, Magnus. "Estimates for Riesz operators on some solvable lie groups." 2000. http://catalog.hathitrust.org/api/volumes/oclc/48798876.html.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
38

Marshall, Mary K. "Derived lengths of solvable groups with abelian Sylow subgroups." 1993. http://catalog.hathitrust.org/api/volumes/oclc/30117461.html.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.)--University of Wisconsin--Madison, 1993.<br>Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaf 44).
Style APA, Harvard, Vancouver, ISO itp.
39

Riedl, Jeffrey Mark. "Fitting heights of solvable groups with few irreducible character degrees." 1998. http://catalog.hathitrust.org/api/volumes/oclc/40810140.html.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.)--University of Wisconsin--Madison, 1998.<br>Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaf 61).
Style APA, Harvard, Vancouver, ISO itp.
40

Smith, Michael J. "Computing automorphisms of finite soluble groups." Phd thesis, 1994. http://hdl.handle.net/1885/133102.

Pełny tekst źródła
Streszczenie:
There is a large collection of effective algorithms for computing information about finite soluble groups. The success in computation with these groups is primarily due to a computationally convenient representation of them by means of (special forms of) power conjugate presentations. A notable omission from this collection of algorithms is an effective algorithm for computing the automorphism group of a finite soluble group. An algorithm designed for finite groups in general provides only a partial answer to this deficiency. In this thesis an effective algorithm for computing the autom
Style APA, Harvard, Vancouver, ISO itp.
41

Chen, Ingrid. "Partial complements in finite soluble groups." Phd thesis, 2012. http://hdl.handle.net/1885/149677.

Pełny tekst źródła
Streszczenie:
Let G be a finite group with normal subgroup N. Let K be a subgroup of G. We say that K is a partial complement of N in G if N and K intersect trivially. There are two main results in this work. The first main result arises from analysing when each partial complement of N in G is contained in a complement of N in G when G is a finite soluble group, N is the product of minimal normal subgroups, N is complemented and all the complements of N in G are conjugate. We show that each partial complement of N in G is contained in a complement of N in G if and only if N is projective. The next natural q
Style APA, Harvard, Vancouver, ISO itp.
42

Niemeyer, Alice C. "Computing presentations for finite soluble groups." Phd thesis, 1993. http://hdl.handle.net/1885/133191.

Pełny tekst źródła
Streszczenie:
The work in this thesis was carried out in the area of computational group theory. The latter is concerned with designing algorithm s and developing their practical implementations for investigating problem s regarding groups. An important class of groups are finite soluble groups. These can be described in a computationally convenient way by power conjugate presentations. In practice, however, they are usually supplied differently. The aim of this thesis is to propose algorithm s for computing power conjugate presentations for finite soluble groups. This is achieved in two different way
Style APA, Harvard, Vancouver, ISO itp.
43

Jarso, Tamiru. "Automorphisms fixing subnormal subgroups of certain infinite soluble groups." Phd thesis, 2003. http://hdl.handle.net/1885/148800.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
44

Lin, Cheng-Chieh, and 林正傑. "Irreducible Characters and Taketa's Inequality for Finite Solvable PC-Groups of First Type." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/67973923203328288235.

Pełny tekst źródła
Streszczenie:
碩士<br>國立高雄師範大學<br>數學系<br>93<br>A finite group is said to be power-commutative ($PC$) if the commutativity of nontrivial powers of two elements implies the commutativity of the two elements. We study irreducible characters of finite solvable $PC$-groups of first type and related problems to the Taketa's inequality in this article.
Style APA, Harvard, Vancouver, ISO itp.
45

Grittini, Nicola. "Properties of characters of π-separable groups". Doctoral thesis, 2020. http://hdl.handle.net/2158/1278339.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
46

Tolcachier, Alejandro. "Grupos de Bieberbach y holonomía de solvariedades planas." Bachelor's thesis, 2018. http://hdl.handle.net/11086/11323.

Pełny tekst źródła
Streszczenie:
Tesis (Lic. en Matemática)--Universidad Nacional de Córdoba, Facultad de Matemática, Astronomía, Física y Computación, 2018.<br>Una solvariedad es una variedad compacta de la forma L/G donde G es un grupo de Lie soluble simplemente conexo y L es un retículo de G. En este trabajo estudiamos solvariedades equipadas con una métrica riemanniana plana, a partir de la caracterización dada por Milnor de los grupos de Lie que admiten una métrica riemanniana invariante a izquierda plana. Las solvariedades planas son ejemplos de variedades compactas planas, por lo cual podemos aplicar los teoremas clá
Style APA, Harvard, Vancouver, ISO itp.
47

Gallo, Andrea Lilén. "Análisis armónico en nilvariedades." Doctoral thesis, 2020. http://hdl.handle.net/11086/15949.

Pełny tekst źródła
Streszczenie:
Tesis (Doctor en Matemática)--Universidad Nacional de Córdoba, Facultad de Matemática, Astronomía, Física y Computación, 2020.<br>Esta tesis se encuadra en el estudio del análisis armónico en pares de Gelfand de la forma (K,N), donde N es un grupo de Lie nilpotente y K es un subgrupo de automorfismos de N. En una primera parte trabajamos con una familia de pares de Gelfand (K,N) definida previamente por Jorge Lauret. Descomponemos la acción del producto semidirecto de K y N, sobre el espacio de funciones definidas sobre N de cuadrado integrable. Para estas familias, encontramos además la medi
Style APA, Harvard, Vancouver, ISO itp.
48

Origlia, Marcos Miguel. "Estructuras localmente conformes Kähler y localmente conformes simplécticas en solvariedades compacta." Doctoral thesis, 2017. http://hdl.handle.net/11086/5837.

Pełny tekst źródła
Streszczenie:
Tesis (Doctor en Matemática)--Universidad Nacional de Córdoba, Facultad de Matemática, Astronomía, Física y Computación, 2017.<br>En esta tesis estudiamos las estructuras localmente conformes Kähler (LCK) y localmente conformes simplécticas (LCS) invariantes a izquierda en grupos de Lie, o equivalentemente tales estructuras en álgebras de Lie. Luego se buscan retículos (subgrupos discretos co-compactos) en dichos grupos. De esta manera obtenemos estructuras LCK o LCS en las solvariedades compactas (cociente de un grupo de Lie por un retículo). Específicamente estudiamos las estructuras LCK e
Style APA, Harvard, Vancouver, ISO itp.
49

"The (n)-Solvable Filtration of the Link Concordance Group and Milnor's mu-Invariaants." Thesis, 2011. http://hdl.handle.net/1911/70379.

Pełny tekst źródła
Streszczenie:
We establish several new results about the ( n )-solvable filtration, [Special characters omitted.] , of the string link concordance group [Special characters omitted.] . We first establish a relationship between ( n )-solvability of a link and its Milnor's μ-invariants. We study the effects of the Bing doubling operator on ( n )-solvability. Using this results, we show that the "other half" of the filtration, namely [Special characters omitted.] , is nontrivial and contains an infinite cyclic subgroup for links with sufficiently many components. We will also show that links modulo (1)-solvabi
Style APA, Harvard, Vancouver, ISO itp.
50

Schneider, Jakob. "On the length of group laws." 2016. https://tud.qucosa.de/id/qucosa%3A36487.

Pełny tekst źródła
Streszczenie:
Let C be the class of finite nilpotent, solvable, symmetric, simple or semi-simple groups and n be a positive integer. We discuss the following question on group laws: What is the length of the shortest non-trivial law holding for all finite groups from the class C of order less than or equal to n?:Introduction 0 Essentials from group theory 1 The two main tools 1.1 The commutator lemma 1.2 The extension lemma 2 Nilpotent and solvable groups 2.1 Definitions and basic properties 2.2 Short non-trivial words in the derived series of F_2 2.3 Short non-trivial words in the lower central series of F
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany bibliografiami na temat „Solvable groups” dla innych typów źródeł:
Artykuły w czasopismach Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii