Related papers: On the Duality between Sampling and Interpolation
A method is given for obtaining equivalence subgroups of a family of differential equations from the equivalence group of simpler equations of a similar form, but in which the arbitrary functions specifying the family element depend on…
We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.
Two simple, interpolatory-like linearizations are shown for the simple pendulum which can be used for any initial amplitude.
Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations. To achieve this, we consider the…
Interpolation by various types of splines is the standard procedure in many applications. In this paper we shall discuss harmonic spline "interpolation" (on the lines of a grid) as an alternative to polynomial spline interpolation (at…
Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…
The Taylor expansion is a widely used and powerful tool in all branches of Mathematics, both pure and applied. In Probability and Mathematical Statistics, however, a stronger version of Taylor's classical theorem is often needed, but only…
The aim of this short note is to show how can be derived from the properties of fundamental interpolation polynomials some nice identities.
Time delay estimation has long been an active area of research. In this work, we show that compressive sensing with interpolation may be used to achieve good estimation precision while lowering the sampling frequency. We propose an…
We prove stability bounds for Stokes-like virtual element spaces in two and three dimensions. Such bounds are also instrumental in deriving optimal interpolation estimates. Furthermore, we develop some numerical tests in order to…
We present the real interpolation with variable exponent and we prove the basic properties in analogy to the classical real interpolation. More precisely, we prove that under some additional conditions, this method can be reduced to the…
Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…
We show that a recent interpolative new proof of the Bohnenblust--Hille inequality, when suitably handled, recovers its best known constants. This seems to be unexpectedly surprising since the known interpolative approaches only provide…
The paper suggests a method of extrapolation of notion of one-sided semi-infinite sequences representing traces of two-sided band-limited sequences; this features ensure uniqueness of this extrapolation and possibility to use this for…
We provide elementary proofs of several results concerning the possible outcomes arising from a fixed profile within the class of positional voting systems. Our arguments enable a simple and explicit construction of paradoxical profiles,…
Existing and extremal property of periodic perfect spline, which interpolates given function in the mean were proved.
This note discusses an interpolation technique for univariate distributions. In other words, the question is how to obtain a good approximation for f(x|a) if a0 < a < a1 is a control variable and f(x|a0) and f(x|a1) are known. The technique…
The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the…
We illustrate the interplay between certain discrete and continuous problems, by presenting a method for the study of the asymptotics of a divergent sequence, through consideration of the asymptotics of its continuous analogue
We describe two distinct simple, short and self contained proofs of the composition lemma.