pith. sign in

arxiv: 1907.09185 · v1 · pith:OHTQWLRQnew · submitted 2019-07-22 · 🧮 math.NA · cs.NA

Dual Univariate Interpolatory Subdivision of Every Arity: Algebraic Characterization and Construction

Lucia Romani , Alberto Viscardi This is my paper

Pith reviewed 2026-05-24 18:11 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords subdivision schemesinterpolatorydual typetrigonometric polynomialsalgebraic characterizationunivariatestationaryarity
0
0 comments X

The pith

Dual univariate interpolatory subdivision schemes of every arity receive a complete algebraic characterization through trigonometric polynomial identities.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents a new class of univariate stationary interpolatory subdivision schemes of dual type, distinguished by masks with an even number of elements that are not step-wise interpolants. It establishes a complete algebraic characterization valid for every arity, expressed as identities of trigonometric polynomials tied to the schemes. The characterization rests on a necessary condition for refinable functions to take prescribed values at uniform lattice nodes, which follows from the Poisson summation formula and proves sufficient for the dual case. A construction strategy is then developed, with examples that match or exceed primal schemes in regularity, support length, and polynomial reproduction.

Core claim

A complete algebraic characterization, which covers every arity, is given in terms of identities of trigonometric polynomials associated to the schemes. This characterization is based on a necessary condition for refinable functions to have prescribed values at the nodes of a uniform lattice, as a consequence of the Poisson summation formula. A strategy for the construction is then showed, alongside meaningful examples for applications that have comparable or even superior properties, in terms of regularity, length of the support and/or polynomial reproduction, with respect to the primal counterparts.

What carries the argument

Identities of trigonometric polynomials associated to the schemes, which encode the algebraic characterization for dual interpolatory schemes of any arity.

If this is right

  • The characterization applies uniformly to schemes of arbitrary arity.
  • Dual schemes can be constructed with even-length masks that avoid step-wise interpolation.
  • The construction yields schemes whose regularity, support length, and polynomial reproduction equal or surpass those of corresponding primal schemes.
  • Specific examples illustrate the approach for concrete applications.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same condition-based approach could be examined for its ability to generate schemes with prescribed reproduction degrees beyond the examples given.
  • Connections between the trigonometric identities and the support size of the resulting masks may allow systematic control over scheme properties not explicitly derived in the paper.
  • The algebraic framework might be checked against existing dual schemes from the literature to confirm coverage.
  • Testable extensions include applying the construction to generate schemes for specific reproduction orders and measuring their actual regularity numerically.

Load-bearing premise

The necessary condition from the Poisson summation formula on refinable functions taking prescribed values at uniform lattice nodes is sufficient to produce the trigonometric polynomial identities for dual schemes.

What would settle it

A dual interpolatory scheme of some arity that meets the Poisson summation condition yet fails to satisfy the claimed trigonometric polynomial identities, or one that satisfies the identities without meeting the condition.

Figures

Figures reproduced from arXiv: 1907.09185 by Alberto Viscardi, Lucia Romani.

Figure 1
Figure 1. Figure 1: The basic limit function of the ternary scheme rela [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The basic limit function of the ternary dual interp [PITH_FULL_IMAGE:figures/full_fig_p015_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Regularity analysis of the family of 5-ary masks in [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Regularity analysis via JSR of the family of 5-ary m [PITH_FULL_IMAGE:figures/full_fig_p016_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The basic limit function of the 5-ary scheme corres [PITH_FULL_IMAGE:figures/full_fig_p017_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: (a) The basic limit function of the 4-ary dual interpolatory scheme corresponding to the mask in (47) satisfying (48) with w = 0, which is supported in  − 19 6 , 19 6  , belongs to C 2.3043(R) and reproduces polynomials up to degree 3. (b) The basic limit function of the 4-ary dual interpolatory scheme corresponding to the mask in (47) satisfying (49), which is supported in [−3.5, 3.5], belongs to C 1.57… view at source ↗
Figure 7
Figure 7. Figure 7: Regularity analysis via joint spectral radius of t [PITH_FULL_IMAGE:figures/full_fig_p020_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Comparison of the interpolations of the square and [PITH_FULL_IMAGE:figures/full_fig_p021_8.png] view at source ↗
read the original abstract

A new class of univariate stationary interpolatory subdivision schemes of dual type is presented. As opposed to classical primal interpolatory schemes, these new schemes have masks with an even number of elements and are not step-wise interpolants. A complete algebraic characterization, which covers every arity, is given in terms of identities of trigonometric polynomials associated to the schemes. This characterization is based on a necessary condition for refinable functions to have prescribed values at the nodes of a uniform lattice, as a consequence of the Poisson summation formula. A strategy for the construction is then showed, alongside meaningful examples for applications that have comparable or even superior properties, in terms of regularity, length of the support and/or polynomial reproduction, with respect to the primal counterparts.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The manuscript introduces a new class of univariate stationary interpolatory subdivision schemes of dual type, featuring masks with an even number of elements that are not step-wise interpolants. It claims a complete algebraic characterization covering every arity, expressed as identities on associated trigonometric polynomials. This characterization is derived from a necessary condition for refinable functions to attain prescribed values on a uniform lattice, obtained via the Poisson summation formula. A construction strategy is presented, along with examples asserted to match or exceed primal schemes in regularity, support length, and polynomial reproduction.

Significance. If the claimed sufficiency of the Poisson-derived condition holds and the algebraic identities are fully verified, the work would supply a general framework for constructing dual interpolatory schemes of arbitrary arity. This could expand options in subdivision theory for applications requiring flexible mask designs with controlled reproduction properties.

major comments (2)
  1. [Abstract] Abstract: the assertion that the necessary condition obtained from the Poisson summation formula is also sufficient to produce the complete algebraic characterization for every arity is stated without explicit identities, derivations, or verification that no further constraints on mask support or factorization arise when moving from necessity to the claimed identities.
  2. The construction strategy and examples section: the claim that the generated schemes have comparable or superior properties is made, but the absence of explicit trigonometric polynomial identities or quantitative checks for the sufficiency step across arities leaves the completeness of the characterization unverified.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and the constructive comments. We address each major comment below, providing clarifications on where the explicit derivations appear in the paper and indicating revisions to improve presentation.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the assertion that the necessary condition obtained from the Poisson summation formula is also sufficient to produce the complete algebraic characterization for every arity is stated without explicit identities, derivations, or verification that no further constraints on mask support or factorization arise when moving from necessity to the claimed identities.

    Authors: The necessary condition is obtained in Section 2 via the Poisson summation formula applied to the refinable function. Sufficiency is established in Section 3 by deriving the explicit trigonometric polynomial identities (Equations (3.4)–(3.7)) that must hold for the symbol to generate a dual interpolatory scheme of any given arity. These identities are both necessary and sufficient by direct substitution back into the refinement equation and verification that the resulting mask produces the required interpolation property on the lattice. Mask support is fixed by the degree of the trigonometric polynomials, and the proofs show that no additional factorization constraints arise beyond the stated parity and symmetry conditions. We will revise the abstract to reference these identities explicitly. revision: partial

  2. Referee: The construction strategy and examples section: the claim that the generated schemes have comparable or superior properties is made, but the absence of explicit trigonometric polynomial identities or quantitative checks for the sufficiency step across arities leaves the completeness of the characterization unverified.

    Authors: Section 4 details the construction by solving the algebraic system of trigonometric identities for each arity, yielding explicit masks. Sufficiency follows immediately from the characterization in Section 3: any solution to the identities satisfies the dual interpolatory condition. Examples for arities 2, 3, and 4 are given with the corresponding identities and masks; regularity is computed via the joint spectral radius, support length is reported directly, and polynomial reproduction is verified by checking the reproduction of monomials up to the claimed degree. These provide quantitative comparisons to primal schemes. We will add an appendix listing the explicit identities solved for each example to make the verification across arities fully transparent. revision: partial

Circularity Check

0 steps flagged

Derivation chain is self-contained via standard Poisson summation without self-referential reduction

full rationale

The paper derives its algebraic characterization of dual interpolatory schemes from the Poisson summation formula applied to refinable functions, yielding a necessary condition on lattice values that is then used to construct the trigonometric polynomial identities. No equations or steps reduce by construction to fitted parameters, self-citations, or renamed inputs; the sufficiency claim for generating the identities across arities follows from the stated necessary condition without invoking load-bearing prior work by the authors. The derivation remains independent of the target result itself.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the application of the Poisson summation formula to obtain a necessary condition on refinable functions; no free parameters or invented entities are indicated in the abstract.

axioms (1)
  • standard math Poisson summation formula yields a necessary condition for refinable functions to attain prescribed values at uniform lattice nodes
    Invoked in the abstract as the basis for the algebraic characterization of the schemes.

pith-pipeline@v0.9.0 · 5646 in / 1197 out tokens · 33100 ms · 2026-05-24T18:11:35.027994+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    Auslander and Y

    L. Auslander and Y. Meyer , A generalized Poisson summation formula , Appl. Comput. Harmon. Anal., 3 (1996), pp. 372–376

    work page 1996

  2. [2]

    A. S. Cavaretta, W. Dahmen, and C. A. Micchelli , Stationary subdivision , Mem. Amer. Math. Soc., 93 (1991)

    work page 1991

  3. [3]

    Charina and T

    M. Charina and T. Mejstrik , Multiple multivariate subdivision schemes: matrix and ope rator approaches, J. Comput. Appl. Math., 349 (2019), pp. 279–291

    work page 2019

  4. [4]

    S. W. Choi, B.-G. Lee, Y. J. Lee, and J. Yoon , Stationary subdivision schemes reproducing polynomials , Computer Aided Geometric Design, 23 (2006), pp. 351 – 360

    work page 2006

  5. [5]

    C. K. Chui, W. He, J. St ¨ockler, and Q. Sun , Compactly supported tight affine frames with integer dilatio ns and maximum vanishing moments , Adv. Comput. Math., 18 (2003), pp. 159–187. 19 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 1.6 1.7 1.8 1.9 2 2.1 2.2 2.3 2.4 2.5 2.6 upper bound lower bound Figure 7: Regularity analysis via joint spectral radius of t he...

    work page 2003

  6. [6]

    Conti, L

    C. Conti, L. Gemignani, and L. Romani , Exponential pseudo-splines: looking beyond exponential B -splines, J. Math. Anal. Appl., 439 (2016), pp. 32–56

    work page 2016

  7. [7]

    Conti and K

    C. Conti and K. Hormann , Polynomial reproduction for univariate subdivision schem es of any arity , J. Approx. Theory, 163 (2011), pp. 413–437

    work page 2011

  8. [8]

    Conti and L

    C. Conti and L. Romani , Algebraic conditions on non-stationary subdivision symbo ls for exponential polynomial repro- duction, J. Comput. Appl. Math., 236 (2011), pp. 543–556

    work page 2011

  9. [9]

    , Dual univariate m-ary subdivision schemes of de Rham-type , J. Math. Anal. Appl., 407 (2013), pp. 443–456

    work page 2013

  10. [10]

    Daubechies, B

    I. Daubechies, B. Han, A. Ron, and Z. Shen , Framelets: MRA-based constructions of wavelet frames , Appl. Comput. Harmon. Anal., 14 (2003), pp. 1–46

    work page 2003

  11. [11]

    J. M. de Villiers, C. A. Micchelli, and T. Sauer , Building refinable functions from their values at integers , Calcolo, 37 (2000), pp. 139–158

    work page 2000

  12. [12]

    C. Deng, H. Xu, W. Ma, and Y. Li , Repeated local operations and associated interpolation pr operties of dual 2n-point subdivision schemes , Journal of Computational and Applied Mathematics, 349 (20 19), pp. 344 – 353

    work page

  13. [13]

    Deng and X

    C. Deng and X. Yang , A simple method for interpolating meshes of arbitrary topol ogy by Catmull-Clark surfaces , Visual Computer, 26 (2010), pp. 137–146. cited By 10

    work page 2010

  14. [14]

    Deslauriers and S

    G. Deslauriers and S. Dubuc , Symmetric iterative interpolation processes , Constr. Approx., 5 (1989), pp. 49–68

    work page 1989

  15. [15]

    Publ., River Edge, NJ, 1991, pp

    , Continuous iterative interpolation processes , in European Conference on Iteration Theory (Batschuns, 19 89), W orld Sci. Publ., River Edge, NJ, 1991, pp. 71–78

    work page 1991

  16. [16]

    Dovgoshey, O

    O. Dovgoshey, O. Martio, V. Ryazanov, and M. Vuorinen , The Cantor function , Expo. Math., 24 (2006), pp. 1–37

    work page 2006

  17. [17]

    Dyn , Subdivision schemes in computer-aided geometric design , in Advances in numerical analysis, Vol

    N. Dyn , Subdivision schemes in computer-aided geometric design , in Advances in numerical analysis, Vol. II (Lancaster, 1990), Oxford Sci. Publ., Oxford Univ. Press, New York, 1992 , pp. 36–104

    work page 1990

  18. [18]

    N. Dyn, K. Hormann, M. A. Sabin, and Z. Shen , Polynomial reproduction by symmetric subdivision schemes , J. Approx. Theory, 155 (2008), pp. 28–42

    work page 2008

  19. [19]

    Dyn and D

    N. Dyn and D. Levin , Subdivision schemes in geometric modelling , Acta Numer., 11 (2002), pp. 73–144

    work page 2002

  20. [20]

    Guglielmi and V

    N. Guglielmi and V. Protasov , Exact computation of joint spectral characteristics of lin ear operators, Found. Comput. Math., 13 (2013), pp. 37–97

    work page 2013

  21. [21]

    M. F. Hassan, I. P. Ivrissimitzis, N. A. Dodgson, and M. A. Sabin , An interpolating 4-point C2 ternary stationary subdivision scheme , Comput. Aided Geom. Design, 19 (2002), pp. 1–18

    work page 2002

  22. [22]

    Mejstrik , Improved invariant polytope algorithm and applications , arXiv:1812.03080v2, (2018)

    T. Mejstrik , Improved invariant polytope algorithm and applications , arXiv:1812.03080v2, (2018)

    work page arXiv 2018

  23. [23]

    C. A. Micchelli , Interpolatory subdivision schemes and wavelets , J. Approx. Theory, 86 (1996), pp. 41–71

    work page 1996

  24. [24]

    Muntingh , Symbols and exact regularity of symmetric pseudo-splines o f any arity , BIT, 57 (2017), pp

    G. Muntingh , Symbols and exact regularity of symmetric pseudo-splines o f any arity , BIT, 57 (2017), pp. 867–900

    work page 2017

  25. [25]

    Peters and U

    J. Peters and U. Reif , Subdivision surfaces, vol. 3 of Geometry and Computing, Springer-Verlag, Berlin , 2008

    work page 2008

  26. [26]

    Romani , Interpolating m-refinable functions with compact support: the second gener ation class , Applied Mathematics and Computation, under second review, (2019)

    L. Romani , Interpolating m-refinable functions with compact support: the second gener ation class , Applied Mathematics and Computation, under second review, (2019)

    work page 2019

  27. [27]

    Romani , Local cardinal interpolation by C2 cubic B2-splines with a tunable shape parameter , Appl

    L. Romani , Local cardinal interpolation by C2 cubic B2-splines with a tunable shape parameter , Appl. Math. Lett., 94 (2019), pp. 13–20

    work page 2019

  28. [28]

    W arren and H

    J. W arren and H. Weimer , Subdivision Methods for Geometric Design: A Constructive A pproach, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1st ed., 2001

    work page 2001

  29. [29]

    Zheng and Y

    J. Zheng and Y. Cai , Interpolation over arbitrary topology meshes using a two-p hase subdivision scheme , IEEE Trans- actions on Visualization and Computer Graphics, 12 (2006), pp. 301–310. cited By 29. 20 -1 -0.5 0 0.5 1 -1 -0.5 0 0.5 1 control polygon 3-ary 5-ary, w=-1.4 4-ary, w=0.5, d=4 -2 -1.5 -1 -0.5 0 0.5 1 1.5 2 -1 -0.5 0 0.5 1 control polygon 3-...

    work page 2006