Skip to main content

2015 | OriginalPaper | Buchkapitel

4. Counting with Nonstandard Bases

verfasst von : Anthony Mendes, Jeffrey Remmel

Erschienen in: Counting with Symmetric Functions

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Generalizing the relationship between the elementary and power symmetric functions, we define a new basis for the ring of symmetric functions which has an expansion in terms of specially weighted brick tabloids. This allows us even more versatility when using symmetric functions in enumerating permutations and words. We show how this new basis can be used to find generating functions for various refinements of permutations and words, recurrence relations, and objects counted by the exponential formula.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Aigner, M., Ziegler, G.M.: Proofs from the Book, 5th edn. Springer, Berlin (2014) [Including illustrations by Karl H. Hofmann]MATH Aigner, M., Ziegler, G.M.: Proofs from the Book, 5th edn. Springer, Berlin (2014) [Including illustrations by Karl H. Hofmann]MATH
10.
Zurück zum Zitat Beissinger, J.S.: Factorization and enumeration of labeled combinatorial objects. Ph.D. thesis, University of Pennsylvania (1981) Beissinger, J.S.: Factorization and enumeration of labeled combinatorial objects. Ph.D. thesis, University of Pennsylvania (1981)
11.
Zurück zum Zitat Bender, E.A., Goldman, J.R.: Enumerative uses of generating functions. Indiana Univ. Math. J. 20, 753–765 (1970/1971) Bender, E.A., Goldman, J.R.: Enumerative uses of generating functions. Indiana Univ. Math. J. 20, 753–765 (1970/1971)
12.
Zurück zum Zitat Benjamin, A.T., Quinn, J.J.: Proofs That Really Count: The Art of Combinatorial Proof. The Dolciani Mathematical Expositions, vol. 27. Mathematical Association of America, Washington, DC (2003) Benjamin, A.T., Quinn, J.J.: Proofs That Really Count: The Art of Combinatorial Proof. The Dolciani Mathematical Expositions, vol. 27. Mathematical Association of America, Washington, DC (2003)
13.
Zurück zum Zitat Bergeron, F., Labelle, G., Leroux, P.: Combinatorial Species and Tree-Like Structures. Encyclopedia of Mathematics and Its Applications, vol. 67. Cambridge University Press, Cambridge (1998) [Translated from the 1994 French original by Margaret Readdy, With a foreword by Gian-Carlo Rota] Bergeron, F., Labelle, G., Leroux, P.: Combinatorial Species and Tree-Like Structures. Encyclopedia of Mathematics and Its Applications, vol. 67. Cambridge University Press, Cambridge (1998) [Translated from the 1994 French original by Margaret Readdy, With a foreword by Gian-Carlo Rota]
20.
Zurück zum Zitat Carlitz, L., Scoville, R.: Enumeration of permutations by rises, falls, rising maxima and falling maxima. Acta Math. Acad. Sci. Hungar. 25, 269–277 (1974)CrossRefMathSciNetMATH Carlitz, L., Scoville, R.: Enumeration of permutations by rises, falls, rising maxima and falling maxima. Acta Math. Acad. Sci. Hungar. 25, 269–277 (1974)CrossRefMathSciNetMATH
21.
Zurück zum Zitat Carlitz, L., Scoville, R.: Generalized Eulerian numbers: combinatorial applications. J. Reine Angew. Math. 265, 110–137 (1974)MathSciNetMATH Carlitz, L., Scoville, R.: Generalized Eulerian numbers: combinatorial applications. J. Reine Angew. Math. 265, 110–137 (1974)MathSciNetMATH
30.
Zurück zum Zitat Doubilet, P., Rota, G.C., Stanley, R.: On the foundations of combinatorial theory, VI. The idea of generating function. In: Proceedings of the 6th Berkeley Symposium on Mathematical Statistics and Probability, University of California, Berkeley, 1970/1971. Probability Theory, vol. II, pp. 267–318. University of California Press, Berkeley (1972) Doubilet, P., Rota, G.C., Stanley, R.: On the foundations of combinatorial theory, VI. The idea of generating function. In: Proceedings of the 6th Berkeley Symposium on Mathematical Statistics and Probability, University of California, Berkeley, 1970/1971. Probability Theory, vol. II, pp. 267–318. University of California Press, Berkeley (1972)
38.
45.
Zurück zum Zitat Foata, D., Schützenberger, M.P.: Théorie Géométrique des Polynômes Eulériens. Lecture Notes in Mathematics, vol. 138. Springer, Berlin (1970) Foata, D., Schützenberger, M.P.: Théorie Géométrique des Polynômes Eulériens. Lecture Notes in Mathematics, vol. 138. Springer, Berlin (1970)
51.
Zurück zum Zitat Gessel, I.: Generating functions and enumeration of sequences. Ph.D. thesis, Massachusetts Institute of Technology (1977) Gessel, I.: Generating functions and enumeration of sequences. Ph.D. thesis, Massachusetts Institute of Technology (1977)
68.
Zurück zum Zitat Jones, M.E., Remmel, J.B.: A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern. Discret. Math. 313(23), 2712–2729 (2013)CrossRefMathSciNetMATH Jones, M.E., Remmel, J.B.: A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern. Discret. Math. 313(23), 2712–2729 (2013)CrossRefMathSciNetMATH
76.
Zurück zum Zitat Langley, T.: Alternate transition matrices for Brenti’s q-symmetric functions and a class of (q, t)-symmetric functions on the hyperoctahedral group. In: Proceedings of Formal Power Series and Algebraic Combinatorics (FPSAC), Melbourne (2002) Langley, T.: Alternate transition matrices for Brenti’s q-symmetric functions and a class of (q, t)-symmetric functions on the hyperoctahedral group. In: Proceedings of Formal Power Series and Algebraic Combinatorics (FPSAC), Melbourne (2002)
87.
Zurück zum Zitat Mansour, T., West, J.: Avoiding 2-letter signed patterns. Sém. Lothar. Comb. 49, Art. B49a, 11 (2002/2004) Mansour, T., West, J.: Avoiding 2-letter signed patterns. Sém. Lothar. Comb. 49, Art. B49a, 11 (2002/2004)
90.
Zurück zum Zitat Mendes, A., Remmel, J.: Descents, inversions, and major indices in permutation groups. Discret. Math. 308(12), 2509–2524 (2008)CrossRefMathSciNetMATH Mendes, A., Remmel, J.: Descents, inversions, and major indices in permutation groups. Discret. Math. 308(12), 2509–2524 (2008)CrossRefMathSciNetMATH
101.
Zurück zum Zitat Remmel, J.B.: Consecutive up-down patterns in up-down permutations. Electron. J. Comb. 21(3), Paper 3.2, 35 (2014) Remmel, J.B.: Consecutive up-down patterns in up-down permutations. Electron. J. Comb. 21(3), Paper 3.2, 35 (2014)
111.
Zurück zum Zitat Sylvester, J.J.: Note on the numbers of Bernoulli and Euler and a new theorem concerning prime numbers. In: The Collected Mathematical Papers of James Joseph Sylvester, vol. 2. Chelsea, New York (1973) Sylvester, J.J.: Note on the numbers of Bernoulli and Euler and a new theorem concerning prime numbers. In: The Collected Mathematical Papers of James Joseph Sylvester, vol. 2. Chelsea, New York (1973)
Metadaten
Titel
Counting with Nonstandard Bases
verfasst von
Anthony Mendes
Jeffrey Remmel
Copyright-Jahr
2015
DOI
https://doi.org/10.1007/978-3-319-23618-6_4