[引用][C] Analytic Combinatorics

P Flajolet - 2009 - books.google.com
Analytic combinatorics aims to enable precise quantitative predictions of the properties of
large combinatorial structures. The theory has emerged over recent decades as essential …

Euler's constant: Euler's work and modern developments

J Lagarias - Bulletin of the American Mathematical Society, 2013 - ams.org
This paper has two parts. The first part surveys Euler's work on the constant $\gamma=
0.57721\cdots $ bearing his name, together with some of his related work on the gamma …

[HTML][HTML] The standard factorization of Lyndon words: an average point of view

F Bassino, J Clément, C Nicaud - Discrete Mathematics, 2005 - Elsevier
A non-empty word w is a Lyndon word if and only if it is strictly smaller for the lexicographical
order than any of its proper suffixes. Such a word w is either a letter or admits a standard …

A survey on iterations of mappings over finite fields

R Martins, D Panario, C Qureshi… - … and Finite Fields …, 2019 - degruyter.com
We survey iterations of polynomials and rational functions over finite fields. We show precise
information on periodicity and permutational properties for some classical functions over …

[PDF][PDF] The anatomy of integers and permutations

A Granville - preprint.[Ack], 2008 - dms.umontreal.ca
THE ANATOMY OF INTEGERS AND PERMUTATIONS Andrew Granville Preface We begin,
as in any mathematical paper, with definitions: Anat Page 1 THE ANATOMY OF INTEGERS …

Exact largest and smallest size of components

D Panario, B Richmond - Algorithmica, 2001 - Springer
Golomb and Gaal 15 study the number of permutations on n objects with largest cycle length
equal to k. They give explicit expressions on ranges n/(i+ 1)< k≤ n/i for i= 1, 2, ..., derive a …

Asymptotics of combinatorial structures with large smallest component

EA Bender, A Mashatan, D Panario… - Journal of Combinatorial …, 2004 - Elsevier
Asymptotics of combinatorial structures with large smallest component Page 1 Journal of
Combinatorial Theory, Series A 107 (2004) 117–125 Asymptotics of combinatorial structures …

Second best, Third worst, Fourth in line

S Finch - arXiv preprint arXiv:2202.07621, 2022 - arxiv.org
We investigate decomposable combinatorial labeled structures more fully, focusing on the
exp-log class of type a= 1 or 1/2. For instance, the modal length of the second longest cycle …

Permute, graph, map, derange

S Finch - arXiv preprint arXiv:2111.05720, 2021 - arxiv.org
We study decomposable combinatorial labeled structures in the exp-log class, specifically,
two examples of type a= 1 and two examples of type a= 1/2. Our approach is to establish …

[PDF][PDF] Tauberian theorems with applications to arithmetical semigroups and probabilistic combinatorics

KH Indlekofer - Ann. Univ. Sci. Budapest. Sect. Comput, 2011 - ac.inf.elte.hu
TAUBERIAN THEOREMS WITH APPLICATIONS TO ARITHMETICAL SEMIGROUPS AND
PROBABILISTIC COMBINATORICS Page 1 Annales Univ. Sci. Budapest., Sect. Comp. 34 (2011) …