<?xml version="1.0"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Character correspondences in finite groups</dc:title>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Ladisch, Frieder , 1977-</dc:contributor>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">theses</dc:type>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Hochschulschrift</dc:type>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2009</dc:date>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2009</dc:date>
  <dc:language xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">eng</dc:language>
  <dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">electronic resource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">remote</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Computermedien</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Online-Ressource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">text/html</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">application/pdf</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Online-Ressource (129 S., 1,09 MB)</dc:format>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">We consider character correspondences between the characters of a group lying over a fixed character of a normal subgroup, and a similar defined set of characters of a subgroup. This situation occurs in many applications, for example in the proof of important character correspondences found by Glauberman, Dade and Isaacs. With our methods we can give more transparent proofs of the results of Dade and Isaacs. We also consider rationality questions and generalizations to modular representation theory. We show that the Isaacs part of the Glauberman-Isaacs correspondence preserves Schur indices.</dc:description>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">vorgelegt von Frieder Ladisch</dc:description>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Rostock, Univ., Mathematisch-Naturwiss. Fak., Diss., 2009</dc:description>
  <dc:subject xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">510</dc:subject>
  <dc:subject xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">17,1</dc:subject>
  <dc:subject xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">31.21</dc:subject>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">http://rosdok.uni-rostock.de/resolve?urn=urn:nbn:de:gbv:28-diss2009-0106-4</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">http://rosdok.uni-rostock.de/resolve?urn=urn:nbn:de:gbv:28-diss2009-0106-4&amp;pdf</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">http://nbn-resolving.de/urn:nbn:de:gbv:28-diss2009-0106-4</dc:identifier>
  <dc:relation xmlns:dc="http://purl.org/dc/elements/1.1/">Character correspondences in finite groups--(DE-627)605999236</dc:relation>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">urn:nbn:de:gbv:28-diss2009-0106-4</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">oclc: 455634592</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">ppn:
				(DE-627)60769789X</dc:identifier>
</oai_dc:dc>
