Quelle paper.bib Sprache: Latech

@ARTICLE{deklerk:2007,
    author="de Klerk, Etienne and Pasechnik, Dmitrii V. and Schrijver, Alexander",
    title="Reduction of symmetric semidefinite programs using the regular $\ast$-representation",
    journal="Mathematical Programming",
    year="2007",
    month="Mar",
    day="01",
    volume="109",
    number="2",
    pages="613--624",
    issn="1436-4646",
    doi="10.1007/s10107-006-0039-7",
    url="https://doi.org/10.1007/s10107-006-0039-7"
}

@ARTICLE{kanno:1970,
    author = {Y. Kanno and M. Ohsaki and K. Murota and N. Katoh},
    title = {Group symmetry in interior-point methods for semidefinite programming},
    journal = {Optimization and Engineering},
    year = {1970},
    pages = {293--320},
    doi = {10.1023/A:1015366416311}
}

@ARTICLE{hymabaccus:2019,
    author = {Hymabaccus, Kaashif},
    title = {Decomposing Linear Representations of Finite Groups},
    journal = {Unpublished master's thesis},
    publisher = {University of Oxford},
    organization = {University of Oxford},
    year = {2019},
}

@book {serre:1977,
    AUTHOR = {Serre, Jean-Pierre},
     TITLE = {Linear representations of finite groups},
      NOTE = {Translated from the second French edition by Leonard L. Scott,
              Graduate Texts in Mathematics, Vol. 42},
PUBLISHER = {Springer-Verlag, New York-Heidelberg},
      YEAR = {1977},
     PAGES = {x+170},
      ISBN = {0-387-90190-6},
   MRCLASS = {20CXX},
  MRNUMBER = {0450380},
MRREVIEWER = {W. Feit},
}

@article{dixon:1970,
ISSN = {00255718, 10886842},
doi = {10.2307/2004848},
abstract = {How can you find a complete set of inequivalent irreducible (ordinary) representations of a finite group? The theory is classical but, except when the group was very small or had a rather special structure, the actual computations were prohibitive before the advent of high-speed computers; and there remain practical difficulties even for groups of relatively small orders (≤ 100). The present paper describes three techniques to help solve this problem. These are: the reduction of a reducible unitary representation into its irreducible components; the construction of a complete set of irreducible components; the construction of a complete set of irreducible unitary representations from a single faithful representation; and the calculation of the precise values of a group character from values which have only been computed approximately.},
author = {John D. Dixon},
journal = {Mathematics of Computation},
number = {111},
pages = {707--712},
publisher = {American Mathematical Society},
title = {Computing Irreducible Representations of Groups},
volume = {24},
year = {1970}
}

@manual{gap:2020,
    key          = "GAP",
    organization = "The GAP~Group",
    title        = "{GAP -- Groups, Algorithms, and Programming,
                    Version 4.11.0}",
    year         = 2020,
    url          = "https://www.gap-system.org",
}

quality92%

¤ Dauer der Verarbeitung: 0.15 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.