Related papers: Convergence of row sequences of simultaneous Fouri…
It is well known that the Fourier--Bohr coefficients of regular model sets exist and are uniformly converging, volume-averaged exponential sums. Several proofs for this statement are known, all of which use fairly abstract machinery. For…
This paper deals with two main topics related to Diophantine approximation. Firstly, we show that if a point on an algebraic variety is approximable by rational vectors to a sufficiently large degree, the approximating vectors must lie in…
The generating series of a radix-rational sequence is a rational formal power series from formal language theory viewed through a fixed radix numeration system. For each radix-rational sequence with complex values we provide an asymptotic…
We establish a version of the Beurling-Pollard theorem for operator synthesis and apply it to derive some results on linear operator equations and to prove a Beurling-Pollard type theorem for Varopoulos tensor algebras. Additionally we…
The conditions for convergence of square and rectangular Fejer means of functions on the infinite dimensional torus were obtained, also a generalization of the results for the case of abstract measure spaces was formulated.
Under a slightly stronger hypothesis, one improves a connectedness result of Debarre [D] for a product of two projective spaces in terms of the extension problem of formal-rational functions (see Theorems 1.3 and 1.4 of the introduction)
Fourier series multiscale method, a concise and efficient analytical approach for multiscale computation, will be developed out of this series of papers. In the third paper, the analytical analysis of multiscale phenomena inherent in the…
A computationally efficient method to solve non-convex programming problems with linear equality constraints is presented. The proposed method is based on a recursively feasible and descending sequential convex programming procedure proven…
We develop the convergence theory for a well-known method for the interpolation of functions on the real axis with rational functions. Precise new error estimates for the interpolant are de- rived using existing theory for trigonometric…
This paper discusses semiparametric inference on hypotheses on the cointegration and the attractor spaces for $I(1)$ linear processes with moderately large cross-sectional dimension. The approach is based on empirical canonical correlations…
In this paper, we develop a continual analog of decomposition over orthogonal bases in spaces generated by equidistant shifts of a single function. By doing so, we obtain an explicit expression for best approximation by spaces of shifts in…
We establish a sharp asymptotic formula for the number of rational points up to a given height and within a given distance from a hypersurface. Our main innovation is a bootstrap method that relies on the synthesis of Poisson summation,…
We give an elementary geometric proof using Ford circles that the convergents of the continued fraction expansion of a real number $\alpha$ coincide with the rationals that are best approximations of the second kind of $\alpha$.
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…
We construct explicitly Pad\'e approximations of the second kind for a special class of G-functions. These are then applied to prove a Baker-type lower bound for linear forms in the p-adic values of these functions. Moreover, we consider…
We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…
The computational complexity of simultaneous inference methods in high-dimensional linear regression models quickly increases with the number variables. This paper proposes a computationally efficient method based on the Moore-Penrose…
We construct a new scheme of approximation of any multivalued algebraic function $f(z)$ by a sequence $\{r_{n}(z)\}_{n\in \mathbb{N}}$ of rational functions. The latter sequence is generated by a recurrence relation which is completely…
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…