


Vol 303, No 1 (2018)
- Year: 2018
- Articles: 20
- URL: https://journals.rcsi.science/0081-5438/issue/view/10769
Article
Sergei Vladimirovich Konyagin Turns 60



Selections of the Best and Near-Best Approximation Operators and Solarity
Abstract
In a finite-dimensional Banach space, a closed set with lower semicontinuous metric projection is shown to have a continuous selection of the near-best approximation operator. Such a set is known to be a sun. In the converse question of the stability of best approximation by suns, it is proved that a strict sun in a finite-dimensional Banach space of dimension at most 3 is a P-sun, has a contractible set of nearest points, and admits a continuous ε-selection from the operator of near-best approximation for any ε > 0. A number of approximative and geometric properties of sets with lower semicontinuous metric projection are obtained.



On Constants in the Jackson Stechkin Theorem in the Case of Approximation by Algebraic Polynomials
Abstract
New estimates are proved for the constants J(k, α) in the classical Jackson–Stechkin inequality En−1(f) ≤ J(k, α)ωk(f,απ/n), α > 0, in the case of approximation of functions f ∈ C[−1, 1] by algebraic polynomials. The main result of the paper implies the following two-sided estimates for the constants: 1/2 ≤ J(2k, α) < 10, n ≥ 2k(2k − 1), α ≥ 2.









On Distribution of Elements of Subgroups in Arithmetic Progressions Modulo a Prime
Abstract
Let \(\mathbb{F}_p\) be the field of residue classes modulo a large prime number p. We prove that if \(\mathcal{G}\) is a subgroup of the multiplicative group \(\mathbb{F}_p^*\) and if \(\mathcal{I} \subset \mathbb{F}_p\) is an arithmetic progression, then \(|\mathcal{G} \cap \mathcal{I}| = (1 + o(1))|\mathcal{G}|\mathcal{I}|/p + R\), where \(|R| < (|\mathcal{I}|^{1/2} + |\mathcal{G}|^{1/2} + |\mathcal{I}|^{1/2}|\mathcal{G}|^{3/8}p^{-1/8})p^{o(1)}\). We use this bound to show that the number of solutions to the congruence xn ≡ λ (mod p), x ∈ ℕ, L < x < L + p/n, is at most p1/3−1/390+o(1) uniformly over positive integers n, λ and L. The proofs are based on results and arguments of Cilleruelo and the author (2014), Murphy, Rudnev, Shkredov and Shteinikov (2017) and Bourgain, Konyagin, Shparlinski and the author (2013).



Uniqueness Theorems for Franklin Series
Abstract
Simple Franklin series are investigated that converge to zero everywhere except for one point (or several points). It is also proved that the one-point set (or a finite set) is a uniqueness set for Pringsheim convergent double series.



Turán—Erőd Type Converse Markov Inequalities on General Convex Domains of the Plane in the Boundary Lq Norm
Abstract
In 1939 P. Turán started to derive lower estimations on the norm of the derivatives of polynomials of (maximum) norm 1 on \(\mathbb{I}:= [-1,1]\) (interval) and \(\mathbb{D}:= \{z \in \mathbb{C}: |z| \leq 1\}\) (disk) under the normalization condition that the zeroes of the polynomial in question all lie in \(\mathbb{I} \) or \(\mathbb{D} \), respectively. For the maximum norm he found that with n:= deg p tending to infinity, the precise growth order of the minimal possible derivative norm is √n for \(\mathbb{I} \) and n for \(\mathbb{D} \). J. Erőd continued the work of Turán considering other domains. Finally, about a decade ago the growth of the minimal possible ∞-norm of the derivative was proved to be of order n for all compact convex domains. Although Turán himself gave comments about the above oscillation question in Lq norms, till recently results were known only for \(\mathbb{D} \) and \(\mathbb{I} \). Recently, we have found order n lower estimations for several general classes of compact convex domains, and conjectured that even for arbitrary convex domains the growth order of this quantity should be n. Now we prove that in Lq norm the oscillation order is at least n/log n for all compact convex domains.



An Example Concerning Set Addition in \(\mathbb{F}_2^n\)
Abstract
We construct sets A and B in a vector space over \(\mathbb{F}\) with the property that A is “statistically” almost closed under addition by B in the sense that a + b almost always lies in A when a ∈ A and b ∈ B, but which is extremely far from being “combinatorially” almost closed under addition by B: if A′⊂ A, B′⊂ B and A′ + B′ is comparable in size to A′, then |B′| ⪅ |B|1/2.



Weight-Almost Greedy Bases
Abstract
We introduce the notion of a weight-almost greedy basis and show that a basis for a real Banach space is w-almost greedy if and only if it is both quasi-greedy and w-democratic. We also introduce the notion of a weight-semi-greedy basis and show that a w-almost greedy basis is w-semi-greedy and that the converse holds if the Banach space has finite cotype.



Finite Point Configurations in the Plane, Rigidity and Erdős Problems
Abstract
For a finite point set E ⊂ ℝd and a connected graph G on k + 1 vertices, we define a G-framework to be a collection of k + 1 points in E such that the distance between a pair of points is specified if the corresponding vertices of G are connected by an edge. We consider two frameworks the same if the specified edge-distances are the same. We find tight bounds on such distinct-distance drawings for rigid graphs in the plane, deploying the celebrated result of Guth and Katz. We introduce a congruence relation on a wider set of graphs, which behaves nicely in both the real-discrete and continuous settings. We provide a sharp bound on the number of such congruence classes. We then make a conjecture that the tight bound on rigid graphs should apply to all graphs. This appears to be a hard problem even in the case of the nonrigid 2-chain. However, we provide evidence to support the conjecture by demonstrating that if the Erd˝os pinned-distance conjecture holds in dimension d, then the result for all graphs in dimension d follows.



Kolmogorov Width and Approximate Rank
Abstract
Closely related notions of the Kolmogorov width and the approximate rank of a matrix are considered. New estimates are established in approximation problems related to the width of the set of characteristic functions of intervals; the multidimensional case (characteristic functions of parallelepipeds) is also considered.






Uniformly Convergent Fourier Series and Multiplication of Functions
Abstract
Let \(U(\mathbb{T})\) be the space of all continuous functions on the circle \(\mathbb{T}\) whose Fourier series converges uniformly. Salem’s well-known example shows that a product of two functions in \(U(\mathbb{T})\) does not always belong to \(U(\mathbb{T})\) even if one of the factors belongs to the Wiener algebra \(A(\mathbb{T})\). In this paper we consider pointwise multipliers of the space \(U(\mathbb{T})\), i.e., the functions m such that mf ∈ \(U(\mathbb{T})\) whenever f ∈ \(U(\mathbb{T})\). We present certain sufficient conditions for a function to be a multiplier and also obtain some Salem-type results.



On Irregular Sampling and Interpolation in Bernstein Spaces
Abstract
Sharp estimates of the sampling and interpolation constants in spaces of polynomials are obtained. These estimates are used to deduce asymptotically sharp estimates of the sampling and interpolation constants for Bernstein spaces as the density of a sampling set approaches the critical value.



An Inverse Theorem for an Inequality of Kneser
Abstract
Let G = (G, +) be a compact connected abelian group, and let μG denote its probability Haar measure. A theorem of Kneser (generalising previous results of Macbeath, Raikov, and Shields) establishes the bound μG(A + B) ≥ min(μG(A) + μG(B), 1) whenever A and B are compact subsets of G, and A + B:= {a + b: a ∈ A, b ∈ B} denotes the sumset of A and B. Clearly one has equality when μG(A) + μG(B) ≥ 1. Another way in which equality can be obtained is when A = φ−1(I) and B = φ−1(J) for some continuous surjective homomorphism φ: G → ℝ/ℤ and compact arcs I, J ⊂ ℝ/ℤ. We establish an inverse theorem that asserts, roughly speaking, that when equality in the above bound is almost attained, then A and B are close to one of the above examples. We also give a more “robust” form of this theorem in which the sumset A + B is replaced by the partial sumset A +εB:= {1A * 1B ≥ ε} for some small ε > 0. In a subsequent paper with Joni Teräväinen, we will apply this latter inverse theorem to establish that certain patterns in multiplicative functions occur with positive density.



Extremal Properties of Product Sets
Abstract
We find the nearly optimal size of a set A ⊂ [N]:= {1,...,N} so that the product set AA satisfies either (i) |AA| ~ |A|2/2 or (ii) |AA| ~ |[N][N]|. This settles problems recently posed in a paper of J. Cilleruelo, D. S. Ramana and O. Ramaré.



Weakly Monotone Sets and Continuous Selection from a Near-Best Approximation Operator
Abstract
A new notion of weak monotonicity of sets is introduced, and it is shown that an approximatively compact and weakly monotone connected (weakly Menger-connected) set in a Banach space admits a continuous additive (multiplicative) ε-selection for any ε < 0. Then a notion of weak monotone connectedness (weak Menger connectedness) of sets with respect to a set of d-defining functionals is introduced. For such sets, continuous (d−1, ε)-selections are constructed on arbitrary compact sets.



Double Character Sums with Intervals and Arbitrary Sets
Abstract
We obtain a new bound on certain double sums of multiplicative characters which improves several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical object of study in additive combinatorics.





