scientific article; zbMATH DE number 3047573

From MaRDI portal
Revision as of 06:18, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5786798

zbMath0030.34502MaRDI QIDQ5786798

No author found.

Publication date: 1948


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.





Related Items (30)

On a general class of non-squashing partitionsCompositions into powers of \(b\): asymptotic enumeration and parametersTranscendence tests for Mahler functionsAsymptotics of Mahler recurrences: The cyclotomic caseAlmost all entries in the character table of the symmetric group are multiples of any given primeN. G. de Bruijn (1918--2012) and his road to Automath, the earliest proof checkerA height gap theorem for coefficients of Mahler functionsThe Euler binary partition function and subdivision schemesNew bounds on antipowers in wordsCombinatorics of periods in strings.Periodic oscillations of coefficients of power series that satisfy functional equationsNewman cyclotomic polynomials, refinable splines and the Euler binary partition functionDEGREE-ONE MAHLER FUNCTIONS: ASYMPTOTICS, APPLICATIONS AND SPECULATIONSMellin transforms and asymptotics: Harmonic sumsThe ring of \(k\)-regular sequencesArithmetic properties of coefficients of power series expansion of \(\prod _{n=0}^{\infty }\left( 1-x^{2^{n}}\right) ^{t}\) (with an appendix by Andrzej Schinzel)On the asymptotic properties of solutions of one functional-differential equation with linearly transformed argumentRecurrence relations based on minimizationLimit theorems for the number of summands in integer partitionsPartitions into powers of an algebraic numberAccurate estimation of the number of binary partitionsGeneric multiplicity for a scalar field equation on compact surfacesThe average number of registers needed to evaluate a binary tree optimallyEarly work of N. G. (Dick) de Bruijn in analysis and some of my ownNicolaas Govert de Bruijn, the enchanter of friable integersPiecewise-smooth refinable functionsA diffraction abstractionAnalytic combinatorics, proof-theoretic ordinals, and phase transitions for independence resultsOn the sets represented by the partitions of an integer \(n\)An inequality and its application to Mahler's partition function







This page was built for publication: