The Euler binary partition function and subdivision schemes

DOI10.1090/mcom/3128zbMath1358.05024OpenAlexW2259262029MaRDI QIDQ2967973

Vladimir Yu. Protasov

Publication date: 9 March 2017

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/mcom/3128

zbMATH Keywords

asymptoticsrefinement equationsubdivision schemepositive matrixcyclotomic polynomialbinary expansionbinary partition function

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Computer-aided design (modeling of curves and surfaces) (65D17) Difference equations (39A99) Additive number theory; partitions (11P99)

Related Items (4)

The Barabanov Norm is Generically Unique, Simple, and Easily Computed ⋮ Antinorms on cones: duality and applications ⋮ Elliptic polytopes and invariant norms of linear operators ⋮ Newman cyclotomic polynomials, refinable splines and the Euler binary partition function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotics of products of nonnegative random matrices
• Lower and upper bounds for the largest Lyapunov exponent of matrices
• Growth rate for beta-expansions
• Sur une courbe plane
• Sur les courbes limités de polygones obtenus par trisection
• Positivity of refinable functions defined by nonnegative finite masks
• Maximal Lyapunov exponents for random matrix products
• Uniform refinement of curves
• Descartes systems from corner cutting
• Bounded semigroups of matrices
• Spectral properties of two-slanted matrices
• Limit theorems for products of positive random matrices
• On the asymptotics of the binary partition function
• Generalized refinement equations and subdivision processes
• Subdivision algorithms with nonnegative masks generally converge
• Characterization of compactly supported refinable splines
• Exact computation of joint spectral characteristics of linear operators
• Congruence properties of binary partition functions
• Refinement equations with nonnegative coefficients
• Efficient algorithms for deciding the type of growth of products of integer matrices
• Analysis of uniform binary subdivision schemes for curve design
• On Mahler's partition problem
• Base-dExpansions with Digits 0 toq− 1
• REPRESENTATION OF A 2-POWER AS SUM OF k 2-POWERS: THE ASYMPTOTIC BEHAVIOR
• Piecewise-smooth refinable functions
• Subdivision schemes in geometric modelling
• Stationary subdivision
• Two-Scale Difference Equations II. Local Regularity, Infinite Products of Matrices and Fractals
• Accurate estimation of the number of binary partitions
• Number of representations related to a linear recurrent basis
• Partitions of an Integer into Powers
• Asymptotic behaviour of the partition function
• Subdivision schemes with nonnegative masks
• On Cyclotomic Polynomials with ± 1 Coefficients
• The refinability of step functions
• Spectral factorization of 2-block Toeplitz matrices and refinement equations
• On a Special Functional Equation
• Subdivision schemes and refinement equations with nonnegative masks

This page was built for publication: The Euler binary partition function and subdivision schemes