-auflösbare Gruppen
Page 1 Next
Siegmar Stöppler (1970)
Rendiconti del Seminario Matematico della Università di Padova
Jindřich Bečvář (1976)
Commentationes Mathematicae Universitatis Carolinae
Jindřich Bečvář (1976)
Commentationes Mathematicae Universitatis Carolinae
Jindřich Bečvář (1977)
Commentationes Mathematicae Universitatis Carolinae
Mauro Costantini, Giovanni Zacher (2005)
Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni
We give criteria for a wreath product to have complemented subgroup-lattice.
Karaduman, Erdal, Deveci, Ömür (2009)
Discrete Dynamics in Nature and Society
Hyman Bass (1964)
Publications Mathématiques de l'IHÉS
Roushon, S. K. (2003)
Algebraic & Geometric Topology
Luis Paris (2014)
Annales de la faculté des sciences de Toulouse Mathématiques
The purpose of this paper is to put together a large amount of results on the conjecture for Artin groups, and to make them accessible to non-experts. Firstly, this is a survey, containing basic definitions, the main results, examples and an historical overview of the subject. But, it is also a reference text on the topic that contains proofs of a large part of the results on this question. Some proofs as well as few results are new. Furthermore, the text, being addressed to non-experts, is as...
Robert Oliver (1987)
Mathematische Zeitschrift
Igor Dolgachev, JongHae Keum (2009)
Journal of the European Mathematical Society
Stéphane Gaussent, Guy Rousseau (2008)
Annales de l’institut Fourier
We give the definition of a kind of building for a symmetrizable Kac-Moody group over a field endowed with a discrete valuation and with a residue field containing . Due to the lack of some important property of buildings, we call it a hovel. Nevertheless, some good ones remain, for example, the existence of retractions with center a sector-germ. This enables us to generalize many results proved in the semisimple case by S. Gaussent and P. Littelmann. In particular, if , the geodesic segments...
Radoslav Dimitric (2020)
Communications in Mathematics
For an arbitrary infinite cardinal , we define classes of -cslender and -tslender modules as well as related classes of -hmodules and initiate a study of these classes.
R. Göbel (1969)
M. Burger (1991)
Journal für die reine und angewandte Mathematik
Nanhua Xi (2011)
Journal of the European Mathematical Society
An affine Hecke algebras can be realized as an equivariant -group of the corresponding Steinberg variety. This gives rise naturally to some two-sided ideals of the affine Hecke algebra by means of the closures of nilpotent orbits of the corresponding Lie algebra. In this paper we will show that the two-sided ideals are in fact the two-sided ideals of the affine Hecke algebra defined through two-sided cells of the corresponding affine Weyl group after the two-sided ideals are tensored by . This...
Brenti, Francesco (2002)
Séminaire Lotharingien de Combinatoire [electronic only]
Joël Allred, Ulrich Ultes-Nitsche (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
In this paper, we define k-counting automata as recognizers for ω-languages, i.e. languages of infinite words. We prove that the class of ω-languages they recognize is a proper extension of the ω-regular languages. In addition we prove that languages recognized by k-counting automata are closed under Boolean operations. It remains an open problem whether or not emptiness is decidable for k-counting automata. However, we conjecture strongly that it is decidable and give formal reasons why we believe...
Joël Allred, Ulrich Ultes-Nitsche (2012)
RAIRO - Theoretical Informatics and Applications
In this paper, we define k-counting automata as recognizers for ω-languages, i.e. languages of infinite words. We prove that the class of ω-languages they recognize is a proper extension of the ω-regular languages. In addition we prove that languages recognized by k-counting automata are closed under Boolean operations. It remains an open problem whether or not emptiness is decidable for k-counting automata. However, we conjecture strongly...
William M. Kantor (1972)
Mathematische Zeitschrift
Page 1 Next