L approximation with trigonometric n-nomials

We compare the degree of approximation to L²(−π, π) by nth degree trigonometric polynomials, with the degree of approximation by trigonometric n-nomials, which are linear combinations, with constant (complex) coefficients, of any 2n + 1 members of the sequence {exp (ikx)}, − ∞ < k < ∞.     

One-sided approximation in <Emphasis Type="Italic">L</Emphasis> of the characteristic function of an interval by trigonometric polynomials

The value of the best one-sided integral approximation of the characteristic function of the interval (?h, h) by trigonometric polynomials of given degree is found for any 0 < h ≤ π.     

On a result by geronimus

In 1935, Ya.L. Geronimus found the best integral approximation on the period [?π,π) of the function sin(n + 1)t ? 2q sin nt, q ∈ ?, by the subspace of trigonometric polynomials of degree at most n ? 1. This result is an integral analog of the known theorem by E.I. Zolotarev (1868). At present, there are several methods of proving this fact. We propose one more variant of the proof. In the case |q| ≥ 1, we apply the (2π/n)-periodization and the fact that the function | sin nt| is orthogonal to the harmonic cos t on the period. In the case |q| < 1, we use the duality relations for Chebyshev’s theorem (1859) on a rational function least deviating from zero on a closed interval with respect to the uniform metric.     

On the boundedness below of trigonometric polynomials of best approximation

As A. S. Belov proved, the partial sums of an even 2π-periodic function f expanded in a Fourier series with convex coefficients {α _n } _n=0 ^∞ , are uniformly bounded below if the conditions a _n = O(n ^?1), n → ∞, are satisfied; moreover, this assertion is no longer valid if the exponent ?1 in this condition is replaced by a greater one. In this paper, we obtain analogs of these results for trigonometric polynomials of best approximation to the function f in the metric of L _2π ¹ .     

Equivalence of the trigonometric system and its perturbations in <Emphasis Type="Italic">L</Emphasis> <Superscript>p</Superscript>(−π,π)

Let B be one of the spaces L^p(?π,π), 1 ≤ p < ∞, p ≠ 2, and C[?π,π]. Sufficient conditions under which the “perturbed” trigonometric system \({e^{i{{\left( {n + {\alpha _n}} \right)}^t}}}\), n ∈ Z, is equivalent in B to the trigonometric system e^int, n ∈ Z, are found. Under an additional requirement on (α_n), a necessary condition is obtained. One of the results is as follows. If (α_n) ∈ l^s, where 1/s = 1/p - 1/2, then the equivalence specified above takes place, and the exponent s is exact; the space C corresponds to p = ∞. The proofs are based on the application of Fourier multipliers.     

Approximation of circular arcs by Bézier curves

For the circular arc of angle 0<α<π we present the explicit form of the best GC³ quartic approximation and the best GC² quartic approximations of various types, and give the explicit form of the Hausdorff distance between the circular arc and the approximate Bézier curves for each case. We also show the existence of the GC⁴ quintic approximations to the arc, and find the explicit form of the best GC³ quintic approximation in certain constraints and their distances from the arc. All approximations we construct in this paper have the optimal order of approximation, twice of the degree of approximate Bézier curves.     

Integral approximation of the characteristic function of an interval by trigonometric polynomials

We prove that the value E _n?1(χ _h ) _L of the best integral approximation of the characteristic function χ _h of an interval (?h, h) on the period [?π,π) by trigonometric polynomials of degree at most n ? 1 is expressed in terms of zeros of the Bernstein function cos {nt ? arccos[(2q ? (1 + q ²) cost)/(1 + q ² ? 2q cost)]}, t ∈ [0, π], q ∈ (?1,1). Here, the parameters q, h, and n are connected in a special way; in particular, q = sech ? tanh for h = π/n.     

Rational approximation with varying weights I

We investigate two problems concerning uniform approximation by weighted rationals {w ⁿr_n～ _∞ ⁿ⁼¹ }, wherer _n=p_n Namely, forw(x):=e ^x we prove that uniform convergence to 1 ofw ⁿr_n is not possible on any interval [0,a] witha>2π. Forw(x):=x ^?, ?>1, we show that uniform convergence to 1 ofw ⁿr_n is not possible on any interval [b, 1] withb<tan ⁴(π(??1)/4?). (The latter result can be interpreted as a rational analogue of results concerning “incomplete polynomials.”) More generally, for α≥0, β≥0, α+β>0, we investigate forw(x)=e ^x andw(x)=x ^?, the possibility of approximation byw ⁿ p_n/q_n～ _∞ ⁿ⁼¹ , where depp _n≤αn, degq _n≤βn. The analysis utilizes potential theoretic methods. These are essentially sharp results though this will not be established in this paper.     

Sharp constant in Jackson’s inequality with modulus of smoothness for uniform approximations of periodic functions

It is proved that, in the space C_2π, for all k, n ∈ ?,n > 1, the following inequalities hold: where e _n?1(f) is the value of the best approximation of f by trigonometric polynomials and ω ₂(f, h) is the modulus of smoothness of f. A similar result is also obtained for approximation by continuous polygonal lines with equidistant nodes.     

On approximation of real numbers by algebraic numbers of bounded degree

Dirichlet proved that for any real irrational number ξ there exist infinitely many rational numbers p/q such that |ξ−p/q|<q⁻². The correct generalization to the case of approximation by algebraic numbers of degree ?n, n>2, is still unknown. Here we prove a result which improves all previous estimates concerning this problem for n>2.     

О сходимости в метрике L четных тригонометрических интерполяционных полиномов по равноотстояшим уэлам

Even, 2π-periodic, continuous for all x ≠ 2πn, n = 0, 1, …, functions, represented by Fourier series are considered. The question of convergence in the metric L of the trigonometric interpolation cosine polinomials of such functions with convex, quasiconvex, monotone and quasimonotone Fourier coefficients is investigated.     

Асимптитические свойства ужей

It is known that the alternance points of trigonometric “snakes” of degree n inscribed into corridors with the assigned continuous bounds tend to be equispaced along with growing n. In this paper the deviation from π/n, the distance between neighboring alternance points as a function of n, and the local moduli of continuityy of the boundary functions are estimated.     

Simultaneous rational approximation to the successive powers of a real number

Let n be an integer ≥ 1 and let θ be a real number which is not an algebraic number of degree ≤ [n/2]. We show that there exist ? > 0 and arbitrary large real numbers X such that the system of linear inequalities |x₀| ≤ X and |x₀θ^j − x_j| ≤ ?X^−1/[n/2] for 1 < j < n, has only the zero solution in rational integers x₀,…, x_n. This result refines a similar statement due to H. Davenport and W. M. Schmidt, where the upper integer part [n/2] is replaced everywhere by the integer part [n/2]. As a corollary, we improve slightly the exponent of approximation to 0 by algebraic integers of degree n + 1 over Q obtained by these authors.     

A proof of the q,t-Catalan positivity conjecture

We present here a proof that a certain rational function C_n(q,t) which has come to be known as the “q,t-Catalan” is in fact a polynomial with positive integer coefficients. This has been an open problem since 1994. The precise form of the conjecture is given in Garsia and Haiman (J. Algebraic Combin. 5(3) (1996) 191), where it is further conjectured that C_n(q,t) is the Hilbert series of the diagonal harmonic alternants in the variables (x₁,x₂,…,x_n;y₁,y₂,…,y_n). Since C_n(q,t) evaluates to the Catalan number at t=q=1, it has also been an open problem to find a pair of statistics a(π),b(π) on Dyck paths π in the n×n square yielding C_n(q,t)=∑_πt^a(π)q^b(π). Our proof is based on a recursion for C_n(q,t) suggested by a pair of statistics a(π),b(π) recently proposed by Haglund. Thus, one of the byproducts of our developments is a proof of the validity of Haglund's conjecture. It should also be noted that our arguments rely and expand on the plethystic machinery developed in Bergeron et al. (Methods and Applications of Analysis, Vol. VII(3), 1999, p. 363).     

Retarded equations on the sphere induced by linear equations

Using a Poincaré compactification, the linear homogeneous system of delay equations {x = Ax(t ? 1) (A is an n × n real matrix) induces a delay system π(A) on the sphere Sⁿ. The points at infinity belong to an invariant submanifold S^{n ? 1} of Sⁿ. For an open and dense set of 2 × 2 matrices A with distinct eigenvalues, the system π(A) has only hyperbolic critical points (including the critical points at infinity). For an open and dense set of 2 × 2matrices $\text{A}$ with complex eigenvalues, the nonwandering set at infinity is the union of an odd number of hyperbolic periodic orbits; if $\text{(}\text{det}\text{A}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{<}\text{3π}\text{2}$, the restriction of $\text{π(}\text{A}\text{)}$ to S¹ is Morse-Smale. For n = 1 there exist periodic orbits of period 4 provided that $\text{?A >}\text{π}\text{2}$ and Hopf bifurcation of a center occurs for ?A near $\text{(}\text{π}\text{2}\text{) + 2kπ, k ? Z}$.     

The polynomial Fourier transform with minimum mean square error for noisy data

In 2006, Naoki Saito proposed a Polyharmonic Local Fourier Transform (PHLFT) to decompose a signal f∈L²(Ω) into the sum of a polyharmonic componentu and a residualv, where Ω is a bounded and open domain in R^d. The solution presented in PHLFT in general does not have an error with minimal energy. In resolving this issue, we propose the least squares approximant to a given signal in L²([−1,1]) using the combination of a set of algebraic polynomials and a set of trigonometric polynomials. The maximum degree of the algebraic polynomials is chosen to be small and fixed. We show in this paper that the least squares approximant converges uniformly for a Hölder continuous function. Therefore Gibbs phenomenon will not occur around the boundary for such a function. We also show that the PHLFT converges uniformly and is a near least squares approximation in the sense that it is arbitrarily close to the least squares approximant in L² norm as the dimension of the approximation space increases. Our experiments show that the proposed method is robust in approximating a highly oscillating signal. Even when the signal is corrupted by noise, the method is still robust. The experiments also reveal that an optimum degree of the trigonometric polynomial is needed in order to attain the minimal l² error of the approximation when there is noise present in the data set. This optimum degree is shown to be determined by the intrinsic frequency of the signal. We also discuss the energy compaction of the solution vector and give an explanation to it.     

Some permutation problems

Put Z_n = {1, 2,…, n} and let π denote an arbitrary permutation of Z_n. Problem I. Let π = (π(1), π(2), …, π(n)). π has an up, down, or fixed point at a according as a < π(a), a > π(a), or a = π(a). Let $\text{A}\text{(r, s, t)}$ be the number of π ∈ Z_n with r ups, s downs, and t fixed points. Problem II. Consider the triple π^?1(a), a, π(a). Let R denote an up and F a down of π and let B(n, r, s) denote the number of π ∈ Z_n with r occurrences of π^?1(a)RaRπ(a) and s occurrences of π^?1(a)FaFπ(a). Generating functions are obtained for each enumerant as well as for a refinement of the second. In each case use is made of the cycle structure of permutations.     

Kinklike solutions of fourth-order differential equations with a cubic bistable nonlinearity

For the equation y ⁽⁴⁾+2y(y ²?1) = 0, we suggest an analytic construction of kinklike solutions (solutions bounded on the entire line and having finitely many zeros) in the form of rapidly convergent series in products of exponential and trigonometric functions. We show that, to within sign and shift, kinklike solutions are uniquely characterized by the tuple of integers n ₁, …, n _k (the integer parts of distances, divided by π, between the successive zeros of these solutions). The positivity of the spatial entropy indicates the existence of chaotic solutions of this equation.     

Degree of Simultaneous Coconvex Polynomial Approximation

$ {\rm Let}\ f\ \epsilon\ {C^{1}}[-1,1] $ change its convexity finitely many times in the interval, say s times, at ${\rm at}\ {Y_{s}}\:\ -1\ <\ y_{s}\ <\ \dots\ < y_{1}\ < 1 $ . We estimate the degree of simultaneous approximation of ? and its derivative by polynomials of degree n, which change convexity exactly at the points Y _s, and their derivatives. We show that provided n is sufficiently large, depending on the location of the points Y _s, the rate of approximation can be estimated by C(s)/n times the second Ditzian-Totik modulus of smoothness of ?′. This should be compared to a recent paper by the authors together with I. A. Shevchuk where ? is merely assumed to be continuous and estimates of coconvex approximation are given by means of the third Ditzian-Totik modulus of smoothness. However, no simultaneous approximation is given there.     

Holomorphic maps with a given asymptotic expansion at a boundary point

The following result has been known for a long time: let 0 < α < 2π and let S be the sector {z ≠ 0 and arg z ≠ α(+ 2kπ)} of the complex plane; let (u_n) be a given infinite sequence of complex numbers; then there exists a holomorphic function on S which admits the formal power series ∑^+∞_{n = 0}u_nzⁿ as asymptotic expansion at the origin. A first generalization of this result to the infinite dimensional case is given by the author (A result of existence of holomorphic maps which admit a given asymptotic expansion, in “Advances in Holomorphy” (J. A. Barroso, Ed.), in press). We give here an improvement of this last result, based upon a different proof. Then we give two counterexamples showing that our assumptions on the spaces are essential.