𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Generating Function for the Number of Roots of a Coxeter Group

✍ Scribed by Ronald de Man

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
320 KB
Volume
27
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Group of Generalized Stirling Number
The Group of Generalized Stirling Numbers
✍ Thomas Bickel πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 140 KB

In this paper we provide an algebraic approach to the generalized Stirling numbers (GSN). By defining a group that contains the GSN, we obtain a unified interpretation for important combinatorial functions like the binomials, Stirling numbers, Gaussian polynomials. In particular we show that many GS

On the Number of Homomorphisms from a Fi
On the Number of Homomorphisms from a Finite Group to a General Linear Group
✍ Naoki Chigira; Yugen Takegahara; Tomoyuki Yoshida πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 144 KB

We study the number of homomorphisms from a finite group to a general linear group over a finite field. In particular, we give a generating function of such numbers. Then the Rogers-Ramanujan identities are applicable.

A better bound for the cop number of gen
A better bound for the cop number of general graphs
✍ Ehsan Chiniforooshan πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 85 KB

## Abstract In this note, we prove that the cop number of any __n__‐vertex graph __G__, denoted by ${{c}}({{G}})$, is at most ${{O}}\big({{{n}}\over {{\rm lg}} {{n}}}\big)$. Meyniel conjectured ${{c}}({{G}})={{O}}(\sqrt{{{n}}})$. It appears that the best previously known sublinear upper‐bound is du