Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Zapiski Nauchnykh Seminarov POMI, 1997, Volume 240, Pages 82–95 (Mi znsl468)  

This article is cited in 10 scientific papers (total in 10 papers)

Two inequalities for parameters of a cellular algebra

S. A. Evdokimova, I. N. Ponomarenkob

a St. Petersburg Institute for Informatics and Automation of RAS
b St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
Abstract: Two inequalities are proved. The first one generalizes for cellular algebras a well-known theorem about coincidence of the degree and the multiplicity of an irreducible representation of a finite group in the regular representation of it. The second inequality which is proved for primitive cellular algebras, gives an upper bound for the minimum subdegree of a primitive permutation group in terms of the degrees of its irreducible representations in the permuation representation.
Received: 02.09.1996
English version:
Journal of Mathematical Sciences (New York), 1999, Volume 96, Issue 5, Pages 3496–3504
DOI: https://doi.org/10.1007/BF02175828
Bibliographic databases:
UDC: 517.896
Language: Russian
Citation: S. A. Evdokimov, I. N. Ponomarenko, “Two inequalities for parameters of a cellular algebra”, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part II, Zap. Nauchn. Sem. POMI, 240, POMI, St. Petersburg, 1997, 82–95; J. Math. Sci. (New York), 96:5 (1999), 3496–3504
Citation in format AMSBIB
\Bibitem{EvdPon97}
\by S.~A.~Evdokimov, I.~N.~Ponomarenko
\paper Two inequalities for parameters of a cellular algebra
\inbook Representation theory, dynamical systems, combinatorial and algoritmic methods. Part~II
\serial Zap. Nauchn. Sem. POMI
\yr 1997
\vol 240
\pages 82--95
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl468}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1691640}
\zmath{https://zbmath.org/?q=an:0960.20006}
\transl
\jour J. Math. Sci. (New York)
\yr 1999
\vol 96
\issue 5
\pages 3496--3504
\crossref{https://doi.org/10.1007/BF02175828}
Linking options:
  • https://www.mathnet.ru/eng/znsl468
  • https://www.mathnet.ru/eng/znsl/v240/p82
  • This publication is cited in the following 10 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:229
    Full-text PDF :74
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024