Related papers: Sharp coincidences for absolutely summing multilin…
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…
We study the D\'iaz-Park sharpness conjecture for fusion systems and prove that, under certain circumstances, there exists a 4 terms exact sequence relating the first two higher limits of the contravariant part of a Mackey functor over…
We extend some basic results known for finite range operators to long range operators with off-diagonal decay. Namely, we prove an analogy of Sch'nol's theorem. We also establish the connection between the almost sure spectrum of long range…
We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are…
We describe an effective method for calculating certain infinite sums, generalizations of the classical Bernoulli polynomials. As shown by Edward Witten in his papers on two-dimensional gauge theories, the correlation functions of…
In this paper we present a new multilevel quasi-interpolation algorithm for smooth periodic functions using scaled Gaussians as basis functions. Recent research in this area has focussed upon implementations using basis function with finite…
This paper offers a solution method that allows one to find exact values for a large class of convergent series of rational terms. Sums of this form arise often in problems dealing with Quantum Field Theory.
We evaluate in closed form several classes of finite trigonometric sums. Two general methods are used. The first is new and involves sums of roots of unity. The second uses contour integration and extends a previous method used by two of…
In this paper we establish sharp weighted bounds (Buckley type theorems) for one{sided maximal and fractional integral operators in terms of one{sided $A_p$ characteristics. Appropriate sharp bounds for strong maximal functions, multiple…
In this paper we discuss the problem of interpolation on straight lines by linear combinations of ridge functions with fixed directions. By using some geometry and/or systems of linear equations, we constructively prove that it is…
This paper provides approximation orders for a class of nonlinear interpolation procedures for univariate data sampled over $\sigma$ quasi-uniform grids. The considered interpolation is built using both essentially nonoscillatory (ENO) and…
Classes of simple polynomial and simple trigonometric splines given by Fourier series are considered. It is shown that the class of simple trigonometric splines includes the class of simple polynomial splines. For some parameter values, the…
A multivariable version of the strong maximal function is introduced and a sharp distributional estimate for this operator in the spirit of the Jessen, Marcinkiewicz, and Zygmund theorem is obtained. Conditions that characterize the…
We describe a dynamic programming algorithm for exact counting and exact uniform sampling of matrices with specified row and column sums. The algorithm runs in polynomial time when the column sums are bounded. Binary or non-negative integer…
The Composite Operator Method (COM) is formulated, its internals illustrated in detail and some of its most successful applications reported. COM endorses the emergence, in strongly correlated systems (SCS), of composite operators,…
We extend several celebrated methods in classical analysis for summing series of complex numbers to series of complex matrices. These include the summation methods of Abel, Borel, Ces\'aro, Euler, Lambert, N\"orlund, and Mittag-Leffler,…
Given gridded cell-average data of a smooth multivariate function, we present a constructive explicit procedure for generating a high-order global approximation of the function. One contribution is the derivation of high order…
I present two new methods for exactly summing a set of floating-point numbers, and then correctly rounding to the nearest floating-point number. Higher accuracy than simple summation (rounding after each addition) is important in many…
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…