skip to main content


Title: On Uniform Convergence of Diagonal Multipoint Pad� Approximants For Entire Functions
We prove that for most entire functions f in the sense of category, a strong form of the Baker-Gammel-Wills Conjecture holds. More precisely, there is an inÖnite sequence S of positive integers n, such that given any r > 0, and multipoint PadÈ approximants Rn to f with interpolation points in fz : jzj  rg, fRngn2S converges locally uniformly to f in the plane. The sequence S does not depend on r, nor on the interpolation points. For entire functions with smooth rapidly decreasing coe¢ cients, full diagonal sequences of multipoint PadÈ approximants converge.  more » « less
Award ID(s):
1800251
NSF-PAR ID:
10091966
Author(s) / Creator(s):
Date Published:
Journal Name:
Constructive approximation
Volume:
49
ISSN:
1432-0940
Page Range / eLocation ID:
149-174
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We prove that for most entire functions f in the sense of category, a strong form of the Baker-Gammel-Wills Conjecture holds. More precisely, there is an infinite sequence S of positive integers n, such that given any r>0, and multipoint Padé approximants R_{n} to f with interpolation points in {z:|z|≤r}, {R_{n}}_{n∈S} converges locally uniformly to f in the plane. The sequence S does not depend on r, nor on the interpolation points. For entire functions with smooth rapidly decreasing coefficients, full diagonal sequences of multipoint Padé approximants converge. 
    more » « less
  2. null (Ed.)
    We present approximation and exact algorithms for piecewise regression of univariate and bivariate data using fixed-degree polynomials. Specifically, given a set S of n data points (x1, y1), . . . , (xn, yn) ∈ Rd × R where d ∈ {1, 2}, the goal is to segment xi’s into some (arbitrary) number of disjoint pieces P1, . . . , Pk, where each piece Pj is associated with a fixed-degree polynomial fj : Rd → R, to minimize the total loss function λk+􏰄ni=1(yi −f(xi))2, where λ ≥ 0 is a regularization term that penalizes model complexity (number of pieces) and f : 􏰇kj=1 Pj → R is the piecewise polynomial function defined as f|Pj = fj. The pieces P1,...,Pk are disjoint intervals of R in the case of univariate data and disjoint axis-aligned rectangles in the case of bivariate data. Our error approximation allows use of any fixed-degree polynomial, not just linear functions. Our main results are the following. For univariate data, we present a (1 + ε)-approximation algorithm with time complexity O(nε log1ε), assuming that data is presented in sorted order of xi’s. For bivariate data, we √ present three results: a sub-exponential exact algorithm with running time nO( n); a polynomial-time constant- approximation algorithm; and a quasi-polynomial time approximation scheme (QPTAS). The bivariate case is believed to be NP-hard in the folklore but we could not find a published record in the literature, so in this paper we also present a hardness proof for completeness. 
    more » « less
  3. Multivariate multipoint evaluation is the problem of evaluating a multivariate polynomial, given as a coefficient vector, simultaneously at multiple evaluation points. In this work, we show that there exists a deterministic algorithm for multivariate multipoint evaluation over any finite field F that outputs the evaluations of an m-variate polynomial of degree less than d in each variable at N points in time (dm + N)1+o(1) · poly(m, d, log |F|) for all m ∈ N and all sufficiently large d ∈ N. A previous work of Kedlaya and Umans (FOCS 2008, SICOMP 2011) achieved the same time complexity when the number of variables m is at most d^{o(1)} and had left the problem of removing this condition as an open problem. A recent work of Bhargava, Ghosh, Kumar and Mohapatra (STOC 2022) answered this question when the underlying field is not too large and has characteristic less than d^{o(1)}. In this work, we remove this constraint on the number of variables over all finite fields, thereby answering the question of Kedlaya and Umans over all finite fields. Our algorithm relies on a non-trivial combination of ideas from three seemingly different previously knownalgorithms for multivariate multipoint evaluation, namely the algorithms of Kedlaya and Umans, that of Björklund, Kaski and Williams (IPEC 2017, Algorithmica 2019), and that of Bhargava, Ghosh, Kumar and Mohapatra, together with a result of Bombieri and Vinogradov from analytic number theory about the distribution of primes in an arithmetic progression. We also present a second algorithm for multivariate multipoint evaluation that is completely elementary and in particular, avoids the use of the Bombieri–Vinogradov Theorem. However, it requires a mild assumption that the field size is bounded by an exponential-tower in d of bounded height. 
    more » « less
  4. Twisted stalks are morphologically unique bacterial extracellular organo-metallic structures containing Fe(III) oxyhydroxides that are produced by microaerophilic Fe(II)-oxidizers belonging to the Betaproteobacteria and Zetaproteobacteria. Understanding the underlying genetic and physiological mechanisms of stalk formation is of great interest based on their potential as novel biogenic nanomaterials and their relevance as putative biomarkers for microbial Fe(II) oxidation on ancient Earth. Despite the recognition of these special biominerals for over 150 years, the genetic foundation for the stalk phenotype has remained unresolved. Here we present a candidate gene cluster for the biosynthesis and secretion of the stalk organic matrix that we identified with a trait-based analyses of a pan-genome comprising 16 Zetaproteobacteria isolate genomes. The “ s talk f ormation in Z etaproteobacteria” (sfz) cluster comprises six genes ( sfz1-sfz6 ), of which sfz1 and sfz2 were predicted with functions in exopolysaccharide synthesis, regulation, and export, sfz4 and sfz6 with functions in cell wall synthesis manipulation and carbohydrate hydrolysis, and sfz3 and sfz5 with unknown functions. The stalk-forming Betaproteobacteria Ferriphaselus R-1 and OYT-1, as well as dread-forming Zetaproteobacteria Mariprofundus aestuarium CP-5 and Mariprofundus ferrinatatus CP-8 contain distant sfz gene homologs, whereas stalk-less Zetaproteobacteria and Betaproteobacteria lack the entire gene cluster. Our pan-genome analysis further revealed a significant enrichment of clusters of orthologous groups (COGs) across all Zetaproteobacteria isolate genomes that are associated with the regulation of a switch between sessile and motile growth controlled by the intracellular signaling molecule c-di-GMP. Potential interactions between stalk-former unique transcription factor genes, sfz genes, and c-di-GMP point toward a c-di-GMP regulated surface attachment function of stalks during sessile growth. 
    more » « less
  5. Abstract

    Topology optimization has been proved to be an automatic, efficient and powerful tool for structural designs. In recent years, the focus of structural topology optimization has evolved from mono-scale, single material structural designs to hierarchical multimaterial structural designs. In this research, the multi-material structural design is carried out in a concurrent parametric level set framework so that the structural topologies in the macroscale and the corresponding material properties in mesoscale can be optimized simultaneously. The constructed cardinal basis function (CBF) is utilized to parameterize the level set function. With CBF, the upper and lower bounds of the design variables can be identified explicitly, compared with the trial and error approach when the radial basis function (RBF) is used. In the macroscale, the ‘color’ level set is employed to model the multiple material phases, where different materials are represented using combined level set functions like mixing colors from primary colors. At the end of this optimization, the optimal material properties for different constructing materials will be identified. By using those optimal values as targets, a second structural topology optimization is carried out to determine the exact mesoscale metamaterial structural layout. In both the macroscale and the mesoscale structural topology optimization, an energy functional is utilized to regularize the level set function to be a distance-regularized level set function, where the level set function is maintained as a signed distance function along the design boundary and kept flat elsewhere. The signed distance slopes can ensure a steady and accurate material property interpolation from the level set model to the physical model. The flat surfaces can make it easier for the level set function to penetrate its zero level to create new holes. After obtaining both the macroscale structural layouts and the mesoscale metamaterial layouts, the hierarchical multimaterial structure is finalized via a local-shape-preserving conformal mapping to preserve the designed material properties. Unlike the conventional conformal mapping using the Ricci flow method where only four control points are utilized, in this research, a multi-control-point conformal mapping is utilized to be more flexible and adaptive in handling complex geometries. The conformally mapped multi-material hierarchical structure models can be directly used for additive manufacturing, concluding the entire process of designing, mapping, and manufacturing.

     
    more » « less