A Remark on Stirling's Formula
From MaRDI portal
Publication:3229522
DOI10.2307/2308012zbMath0068.05404WikidataQ56139018 ScholiaQ56139018MaRDI QIDQ3229522
Publication date: 1955
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2308012
Related Items
Almost all Cayley graphs are hamiltonian, Measuring the problem-relevant information in input, Set systems without a simplex or a cluster, A new approach for determining the time step when propagating with the Lanczos algorithm, Tight bounds for online stable sorting, Improved sorting networks with O(log N) depth, A tour of \(M\)-part \(L\)-Sperner families, A new Stirling series as continued fraction, Analysis of local search landscapes for \(k\)-SAT instances, A generalized Grothendieck inequality and nonlocal correlations that require high entanglement, Expert rule versus majority rule under partial information, On deterministic finite automata and syntactic monoid size, Extensions of Schur's irreducibility results, Square-free words as products of commutators., Domination analysis for minimum multiprocessor scheduling, Lowest Landau level functional and Bargmann spaces for Bose-Einstein condensates, Algebras with intermediate growth of the codimensions., Stochastic local search for the FEATURE SET problem, with applications to microarray data, The resolvent algebra: A new approach to canonical quantum systems, Probabilistic generation of finite simple groups. II., Proper identities, Lie identities and exponential codimension growth., Irreducibility of generalized Hermite-Laguerre polynomials. II., Uniformly cross intersecting families, Graded polynomial identities and codimensions: computing the exponential growth., An explicit height bound for the classical modular polynomial, An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution, On two random search problems, On using deterministic functions to reduce randomness in probabilistic algorithms, Sums of certain series of the Riemann zeta function, Random triangulations of the plane, A note on Stirling's expansion for factorial n, Some inequalities based on inverse factorial series, Gibbs states of the Hopfield model in the regime of perfect memory, Geometric thickness in a grid, Typical configurations for one-dimensional random field Kac model, Analysis of blockwise shrinkage wavelet estimates via lower bounds for no-signal setting, Vector packing in finite dimensional vector spaces, Probability distribution for simple tautologies, Codimensions of algebras and growth functions, Approximation to the mean curve in the LCS problem, Perturbation bounds for polynomials, Optimally adaptive integration of univariate Lipschitz functions, A new asymptotic series for the gamma function, Group rings over Dedekind domains, The superconvergence of the composite trapezoidal rule for Hadamard finite part integrals, First order absolute moment of Meyer-König and Zeller operators and their approximation for some absolutely continuous functions, Graded polynomial identities and exponential growth, On Nonisomorphic Room Squares, Reuse of standard preconditioners for higher-order time discretizations of parabolic PDEs, The Longest Minimum-Weight Path in a Complete Graph, Stirling's Formula and Its Extensions: Heuristic Approaches, THE BURNSIDE APPROXIMATION OF GAMMA FUNCTION, On a Sturm Liouville periodic boundary values problem, On the density of truth of implicational parts of intuitionistic and classical logics, Introducing Quasirandomness to Computer Science, Heat equation on a hemisphere, Markov chains on hypercubes: Spectral representations and several majorization relations
