default search action
Arnold Knopfmacher
Person information
- affiliation: University of Witwatersrand, Johannesburg, South Africa
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j50]Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
Pushes in words-a primitive sorting algorithm. Contributions Discret. Math. 17(1): 56-69 (2022) - [j49]Aubrey Blecher
, Arnold Knopfmacher, Toufik Mansour
Alphabetic points in restricted growth functions. Discret. Appl. Math. 309: 130-137 (2022) - [j48]Margaret Archibald
Protected Cells in Compositions. Math. Comput. Sci. 16(1): 1 (2022) - 2021
- [j47]Margaret Archibald
Impulse Propagation in Compositions and Words. Int. J. Math. Math. Sci. 2021: 8811261:1-8811261:6 (2021) - 2020
- [j46]Aubrey Blecher
Water capacity of Dyck paths. Adv. Appl. Math. 112 (2020) - [j45]Aubrey Blecher
A simple sorting algorithm for compositions. Discret. Math. Algorithms Appl. 12(6): 2050079:1-2050079:23 (2020) - [j44]Margaret Archibald
The number of distinct adjacent pairs in geometrically distributed words. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j43]Aubrey Blecher
Counting Permutations by the Number of Vertical Edges in Their Bargraphs. J. Autom. Lang. Comb. 25(4): 279-290 (2020) - [j42]Aubrey Blecher
The Depth of Compositions. Math. Comput. Sci. 14(1): 69-76 (2020)
2010 – 2019
- 2017
- [j41]Aubrey Blecher
The perimeter of words. Discret. Math. 340(10): 2456-2465 (2017) - 2016
- [j40]Margaret Archibald, Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour:
Partitions according to multiplicities and part sizes. Australas. J Comb. 66: 104-119 (2016) - 2015
- [j39]Aubrey Blecher
Levels in bargraphs. Ars Math. Contemp. 9(2): 287-300 (2015) - [j38]Margaret Archibald, Aubrey Blecher
Greatest Descents after any Maxima in Compositions. Electron. J. Comb. 22(4): 4 (2015) - [j37]Aubrey Blecher
The height and width of bargraphs. Discret. Appl. Math. 180: 36-44 (2015) - 2014
- [j36]Margaret Archibald
The Largest Missing Value in a Sample of Geometric Random Variables. Comb. Probab. Comput. 23(5): 670-685 (2014) - [j35]Peter J. Grabner
A General Asymptotic Scheme for the Analysis of Partition Statistics. Comb. Probab. Comput. 23(6): 1057-1086 (2014) - [j34]Aubrey Blecher
Descents after maxima in compositions. Discret. Math. Theor. Comput. Sci. 16(1): 61-72 (2014) - 2013
- [j33]Charlotte A. C. Brennan, Arnold Knopfmacher
Descent variation of samples of geometric variables. Discret. Math. Theor. Comput. Sci. 15(2): 1-12 (2013) - 2012
- [j32]Arnold Knopfmacher, Augustine O. Munagi:
Permutations with interval cycles. Ars Comb. 105: 273-288 (2012) - [j31]Arnold Knopfmacher
Record statistics in a random composition. Discret. Appl. Math. 160(4-5): 593-603 (2012) - [j30]Margaret Archibald
Variation Statistics on Compositions. Fundam. Informaticae 117(1-4): 1-17 (2012) - 2011
- [j29]Margaret Archibald
The largest missing value in a composition of an integer. Discret. Math. 311(8-9): 723-731 (2011) - 2010
- [j28]Arnold Knopfmacher, Toufik Mansour
Records in Set Partitions. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j27]Charlotte A. C. Brennan, Arnold Knopfmacher
The distribution of ascents of size d or more in compositions. Discret. Math. Theor. Comput. Sci. 11(1): 1-10 (2009) - 2008
- [j26]Arnold Knopfmacher, Neville Robbins:
On Multi-Color Partitions with Distinct Parts. Ars Comb. 89 (2008) - [j25]Charlotte A. C. Brennan, Arnold Knopfmacher
The Distribution of Ascents of Size d or More in Partitions of n. Comb. Probab. Comput. 17(4): 495-509 (2008) - 2007
- [j24]Arnold Knopfmacher, Helmut Prodinger:
The Last Descent In Samples Of Geometric Random Variables And Permutations. Ars Comb. 83 (2007) - [j23]Arnold Knopfmacher
Graphs, partitions and Fibonacci numbers. Discret. Appl. Math. 155(10): 1175-1187 (2007) - 2006
- [j22]Arnold Knopfmacher
The first descent in samples of geometric random variables and permutations. Discret. Math. Theor. Comput. Sci. 8(1): 215-234 (2006) - [j21]Margaret Archibald
The number of distinct values in a geometrically distributed sample. Eur. J. Comb. 27(7): 1059-1081 (2006) - 2005
- [j20]Arnold Knopfmacher, Neville Robbins:
with parts constrained by the leading summand. Ars Comb. 76 (2005) - [j19]Pawel Hitczenko
Gap-free compositions and gap-free samples of geometric random variables. Discret. Math. 294(3): 225-239 (2005) - 2004
- [c2]Pawel Hitczenko, Arnold Knopfmacher:
Gap-Free Samples of Geometric Random Variables. ALENEX/ANALC 2004: 194-198 - 2003
- [j18]Peter J. Grabner
Combinatorics of geometrically distributed random variables: run statistics. Theor. Comput. Sci. 297(1-3): 261-270 (2003) - 2002
- [j17]Arnold Knopfmacher
Mathematica evidence that Ramanujan kills Baker-Gammel-Wills. Appl. Math. Comput. 128(2-3): 289-302 (2002) - 2001
- [j16]George E. Andrews, Arnold Knopfmacher:
An Algorithmic Approach to Discovering and Proving q-Series Identities. Algorithmica 29(1): 34-43 (2001) - [j15]Arnold Knopfmacher, Helmut Prodinger:
A Simple Card Guessing Game Revisited. Electron. J. Comb. 8(2) (2001) - [j14]Arnold Knopfmacher, Helmut Prodinger:
Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum. Discret. Math. 226(1-3): 255-267 (2001) - 2000
- [j13]George E. Andrews, Arnold Knopfmacher, Peter Paule:
An Infinite Family of Engel Expansions of Rogers-Ramanujan Type. Adv. Appl. Math. 25(1): 2-11 (2000) - [c1]Peter J. Grabner
Run Statistics for Geometrically Distributed Random Variables (Extended Abstract). LATIN 2000: 457-462
1990 – 1999
- 1999
- [j12]Arnold Knopfmacher, Michael E. Mays:
Compositions With m Distinct Parts. Ars Comb. 53 (1999) - [j11]Arnold Knopfmacher, Andrew M. Odlyzko, Boris G. Pittel, L. Bruce Richmond, Dudley Stark, George Szekeres, Nicholas C. Wormald:
The Asymptotic Number of Set Partitions with Unequal Block Sizes. Electron. J. Comb. 6 (1999) - [j10]Arnold Knopfmacher:
On the degrees of irreducible factors of polynomials over a finite field. Discret. Math. 196(1-3): 197-206 (1999) - [j9]Arnold Knopfmacher
Arithmetical Semigroups Related to Trees and Polyhedra. J. Comb. Theory A 86(1): 85-102 (1999) - 1998
- [j8]Arnold Knopfmacher, J. N. Ridley, Gary L. Mullen:
Nets and Sequences Obtained from Irreducible Polynomials Over Finite Fields. Appl. Algebra Eng. Commun. Comput. 9(3): 265-269 (1998) - [j7]Arnold Knopfmacher, Helmut Prodinger:
On Carlitz Compositions. Eur. J. Comb. 19(5): 579-589 (1998) - 1997
- [j6]Arnold Knopfmacher:
Distinct degree factorizations for polynomials over a finite field. SIGSAM Bull. 31(3): 38-39 (1997) - 1996
- [j5]Arnold Knopfmacher, Richard Warlimont:
Counting permutations and polynomials with a restricted factorization pattern. Australas. J Comb. 13: 151-162 (1996) - [j4]Arnold Knopfmacher, Richard Warlimont:
Covers of finite sets with distinct block sizes. Ars Comb. 44 (1996) - 1993
- [j3]Hollie L. Buchanan, Arnold Knopfmacher, Michael E. Mays:
On the cyclotomic identity and related product expansions. Australas. J Comb. 8: 233-246 (1993) - [j2]Arnold Knopfmacher
Counting irreducible factors of polynomials over a finite field. Discret. Math. 112(1-3): 103-118 (1993) - [j1]Arnold Knopfmacher, J. N. Ridley:
Reciprocal Sums over Partitions and Compositions. SIAM J. Discret. Math. 6(3): 388-399 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: