The Euler binary partition function and subdivision schemes
From MaRDI portal
Publication:2967973
Recommendations
Cites work
- scientific article; zbMATH DE number 3155071 (Why is no real title available?)
- scientific article; zbMATH DE number 3953956 (Why is no real title available?)
- scientific article; zbMATH DE number 1185289 (Why is no real title available?)
- scientific article; zbMATH DE number 1083128 (Why is no real title available?)
- scientific article; zbMATH DE number 5252533 (Why is no real title available?)
- scientific article; zbMATH DE number 3229510 (Why is no real title available?)
- scientific article; zbMATH DE number 3232846 (Why is no real title available?)
- scientific article; zbMATH DE number 3289585 (Why is no real title available?)
- scientific article; zbMATH DE number 957414 (Why is no real title available?)
- scientific article; zbMATH DE number 4187932 (Why is no real title available?)
- scientific article; zbMATH DE number 3047573 (Why is no real title available?)
- Accurate estimation of the number of binary partitions
- Analysis of uniform binary subdivision schemes for curve design
- Asymptotic behaviour of the partition function
- Asymptotics of products of nonnegative random matrices
- Base-\(d\) expansions with digits 0 to \(q-1\)
- Bounded semigroups of matrices
- Characterization of compactly supported refinable splines
- Congruence properties of binary partition functions
- Convergence of subdivision versus solvability of refinement equations.
- Descartes systems from corner cutting
- Efficient algorithms for deciding the type of growth of products of integer matrices
- Exact computation of joint spectral characteristics of linear operators
- Generalized refinement equations and subdivision processes
- Growth rate for beta-expansions
- Limit theorems for products of positive random matrices
- Lower and upper bounds for the largest Lyapunov exponent of matrices
- Maximal Lyapunov exponents for random matrix products
- Number of representations related to a linear recurrent basis
- On Cyclotomic Polynomials with ± 1 Coefficients
- On Mahler's partition problem
- On a Special Functional Equation
- On the asymptotics of the binary partition function
- Partition functions in numeration systems with bounded multiplicity
- Partitions of an Integer into Powers
- Piecewise-smooth refinable functions
- Positivity of refinable functions defined by nonnegative finite masks
- REPRESENTATION OF A 2-POWER AS SUM OF k 2-POWERS: THE ASYMPTOTIC BEHAVIOR
- Refinement equations with nonnegative coefficients
- Spectral factorization of 2-block Toeplitz matrices and refinement equations
- Spectral properties of two-slanted matrices
- Stationary subdivision
- Subdivision algorithms with nonnegative masks generally converge
- Subdivision schemes and refinement equations with nonnegative masks
- Subdivision schemes in geometric modelling
- Subdivision schemes with nonnegative masks
- Sur les courbes limités de polygones obtenus par trisection
- Sur une courbe plane
- The refinability of step functions
- Two-Scale Difference Equations II. Local Regularity, Infinite Products of Matrices and Fractals
- Uniform refinement of curves
- Wavelet theory. Transl. from the Russian by Evgenia Sorokina
Cited in
(8)- Newman cyclotomic polynomials, refinable splines and the Euler binary partition function
- Euler partition rule
- Elliptic polytopes and invariant norms of linear operators
- Antinorms on cones: duality and applications
- scientific article; zbMATH DE number 4187932 (Why is no real title available?)
- Gibbs phenomenon for \(p\)-ary subdivision schemes
- Anisotropic refinable functions and the tile B-splines
- The Barabanov norm is generically unique, simple, and easily computed
This page was built for publication: The Euler binary partition function and subdivision schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967973)
