Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Asymptotic behavior of functions, asymptotic series and related topics
15
votes
Accepted
Cubic-exponential enumerative combinatorics
Since you mentioned Cayley's theorem for spanning trees, I believe one important example is its higher dimensional analogue due to Kalai. Indeed the number of simplicial spanning trees of the k-skelet …
4
votes
Accepted
complete estimates of the error for a well-known asymptotic expression of partition p(n,m)
I'm not entirely sure of what you are asking, but note that Erdos and Lehner proved here that
$$p(n,m)\sim \frac{n^{m-1}}{m!(m-1)!}$$ holds for $m=o(n^{1/3})$. In generality for any finite set $A$, wi …
5
votes
Are cyclic codes bounded by a continuous function?
To answer the question on the origin of $\alpha_q$. The original proof goes back to Manin's article "What is the maximum number of points on a curve over $\mathbb F_2$", J. Fac. Sci. Univ. Tokyo, 198 …
14
votes
Accepted
What is the series expression for (1+1/x)^x about x = \infty?
Markus Brede proves the following formula in the paper "On the convergence of the sequence defining Euler’s number". Let $$\left(1+\frac{1}{z}\right)^z=\sum_{n\geq 0} \frac{a_n}{z^n}$$
then we have
$$ …
9
votes
Accepted
Asymptotics of the $q$-harmonic series as $q\to1$
Andrew is right, the following limit seems to be what you are looking for
$$\lim_{q\uparrow 1}\left(\log(1-q)-\log q \sum_{n\geq 0}\frac{q^{n+1}}{1-q^{n+1}}\right)=\gamma$$
See , for example theorem 1 …
9
votes
Accepted
Repetitions of the totient
This is a result of Pillai. Indeed we have $\text{rphi}(n)=\frac{\log n}{\log 2}$ when $n$ is a power of 2, and we have $\text{rphi}(n)=\lceil\frac{\log n}{\log 3}\rceil$ when $n$ is twice a power of …
7
votes
Accepted
Limits (growth rates) of power series coefficients
Yes, the conjectured limit is true. Let $d=\gcd (m,n)$ and $m=m_1d, n=n_1d$. Suppose $a_k$ denotes the number of solutions to $k=m_1r+n_1s$ with $r,s\geq 0$, so that
$$a_0+a_1x+a_2x^2+\cdots =\frac{1} …
9
votes
Plane partitions with equal margins
I don't know if this is optimal, but here is a pair of plane partitions of $n=53$ with no symmetries that have equal projections on each individual axis:
$$A=\begin{matrix} 5 4 4 4 4 \\ 5 4 1 1 \ \ \ …
17
votes
Accepted
How does the number of trees on $n$ vertices *up to isomorphism* grow as $n \to \infty$?
These were enumerated by Harary and Prins in
Frank Harary and Geert Prins, "The number of homeomorphically irreducible trees and other species" Acta Math., 101 (1959), 141-162
and for the asymptotics …
10
votes
Accepted
What is the growth rate of the number of unoriented cobordism classes?
See for example Nathanson's paper: "Asymptotic density and the asymptotics of partition functions". …