A measurable convolution kernel satisfying the displayed size and cancellation properties together with the Hörmander integral kernel condition defines uniformly bounded Fourier multipliers after deletion of a ball at the origin. The deleted-ball kernels belong to , although they need not belong to at infinity. Cancellation controls low-frequency integration near the deleted ball; translation by half an oscillation controls the far tail through the oscillatory tail estimate for a singular kernel.
ATPase dwell-time inference from concentration dependence Created 2026-10-24 Updated 2026-11-05
A rotary ATP synthase subunit can exhibit an ATP-dependent exponential distribution of binding waits with rate and an ATP-independent sum of two first-order waits. Convolution gives the latter density . The equal-rate limit is the Erlang distribution . These fits support one concentration-dependent binding event and two kinetically resolved transitions, but do not uniquely assign the latter to hydrolysis, product release or conformational change. Their rates cannot be ordered from this symmetric density alone.
Back-calculation of infection incidence Created 2026-10-06 Updated 2026-10-14
Observed symptom-onset intensity is the convolution of past infection intensity with the incubation delay density: . Back-calculation infers the infection history from that relation. Include pre-observation infections unless their absence is known.
Big-integer multiplication Created 2026-10-20 Updated 2026-11-05
Big-integer multiplication multiplies arbitrary-precision integers represented by arrays of digits. For and , first compute the coefficient sums , then propagate carries in base . Thus the main step is a convolution followed by carry handling.
The school method needs digit multiplications for two -digit inputs. Karatsuba multiplication splits each input into two halves and uses three recursive products instead of four, giving arithmetic work under the usual digit model. For larger inputs, transform-based methods accelerate the convolution. Which method is fastest depends on input size and implementation overhead.
A finite optical record can bound later radiant energy if an independently justified exponential decay envelope applies at every later time. Let the recorded window end at , and suppose the true nonnegative radiant power satisfiesIntegration gives the exponential-envelope tail-energy boundEquality holds when the entire tail follows the envelope. This is a bound on an unobserved contribution, not automatically a standard uncertainty or a probabilistic interval.
For an original numerical example, suppose the energy inside the recorded window is known to lie in , while a justified envelope has and . The missing contribution is at most , so the total laser pulse energy lies in . The optical energy outside a time gate fraction, considering only this late contribution, is at most . Any unobserved early energy requires its own bound.
One way to justify the envelope mathematically is a differential inequality for an exponential tail envelope. Suppose is absolutely continuous on each finite interval after , , and almost everywhere. Multiplying by the integrating factor givesso . The decay law must apply throughout the unobserved region; it is a physical assumption to validate, rather than a consequence of fitting the last few samples.
The distinction is testable by a counterexample. Append a later nonnegative pulse whose support lies entirely beyond the recorded interval. Its energy can be arbitrarily large while every recorded sample is unchanged. Such a pulse violates the global envelope but cannot be excluded by a good local exponential fit alone. Similarly, an envelope with a positive constant background has an infinite integral over an infinite time interval. A finite observation horizon or an adequately defined and validated background subtraction is then essential.
Uncertain envelope parameters require a bound valid for their allowed combinations. If the allowed set is the rectangle and , then . For and , this is and the preceding total interval becomes . More restrictive joint parameter constraints can tighten this result; inserting separate best-fit values does not establish a guaranteed bound.
Finally, an electrical tail need not be an optical tail. In an original idealized linear time-invariant system, let a photodetector have unit-area impulse response for , and zero otherwise. An impulsive optical input , with the Dirac delta function, gives the calibrated output by convolution. Its electrical tail after has area even though all incident optical energy arrived at time zero. This optical tail and detector-response ambiguity requires a separate response measurement. NIST's historical procedure characterized the photodetector, cable and oscilloscope together before convolving measured responses with trial waveforms. Appendix C describes typical optical excitation of about , a photodetector rise time near , and a oscilloscope with rise time. The optical excitation was much shorter than the detector response, while the oscilloscope was fast enough that the detector dominated the measured waveform. Response data were collected at each gain setting and several signal levels.[ref]
Calibration Service for Low-level Pulsed-Laser Radiometers at 1.06 µm: Pulse Energy and Peak Power by Rodney W. Leonhardt. Appendix C.1–C.2, printed pp. 36–37
Box averaging filter 2026-11-05
A box averaging filter gives equal weight to all positions within a specified window and zero weight outside it. In one spatial dimension, its normalized kernel and action areThis is a spatial averaging filter expressed as a convolution. In several dimensions, averaging over an axis-aligned rectangular box uses the product of the one-dimensional kernels.
The discrete counterpart averages a fixed number of samples. On an infinite sequence that is zero except for value ten at index zero, a centred five-sample box average produces value two at indices and zero elsewhere. The total remains ten, while the isolated peak spreads. On a finite array, boundary extension must be specified; reflection, zero padding and wrapping can give different edge values.[ref]
uniform_filter1d in the SciPy documentation. Parameters size, mode and origin: window length, boundary extension and centring
Applying the same box average twice is not the same operation as applying it once. The new kernel is the convolution of the two kernels:Indeed, the integral counts the length of overlap of two intervals, divided by . The resulting support has width , and the weight decreases away from its centre.
For a Fourier mode , one application multiplies the amplitude by ; two applications square this multiplier. The sinc function response explains why a box average smooths a signal without implementing an ideal sharp frequency cutoff. In large eddy simulation, that distinction matters when relating a grid filter to a coarser test filter.
Box smoothing of a two-sided exponential Created 2026-10-20 Updated 2026-10-20
For , the convolution of the normalized interval indicator with the two-sided exponential isSplit the defining integral at in the interior case; outside the interval the absolute value has a fixed sign. These elementary integrals prove the formula and its continuity at the joining points. With Fourier transform convention , the convolution theorem gives , using its continuous value at . Parseval's identity can therefore turn the squared integral of this rational-trigonometric transform into a piecewise elementary real-space integral.
In a fixed tangent viewing geometry, an electron bunch of longitudinal length passes the same radiating point over approximately . Different electrons then emit from nearly the same point at different times. The incoherent pulse envelope is the convolution of the single-electron intensity profile with the bunch's passage-time distribution, assuming equal particle trajectories and a linear detector. Its width generally has scale at least . A bunch short compared with the orbit need not be short compared with the intrinsic single-electron pulse.
Suppose a convolution operator has operator norm at most , and its kernel satisfies the Hörmander integral kernel condition with constant . Under hypotheses making its integrals well-defined, the Calderón–Zygmund decomposition gives weak type (1,1). Indeed, the bounded part has squared norm at most . The bad cubes occupy at most , while outside their dilations the cancellation estimate outside a dilated cube bounds the bad image in . Applying distributional estimates to these three regions gives .
Cancellation estimate outside a dilated cube 2026-10-14
If obeys the Hörmander integral kernel condition with constant , and an integrable is supported in a cube with , then for . Here is the concentric cube with multiplied side length. Subtract the kernel value at the cube center inside the convolution; outside , every source displacement is smaller than half the observation displacement. Tonelli theorem and the integral kernel condition give the bound.
Cauchy convolution semigroup Created 2026-10-20 Updated 2026-11-05
The centered Cauchy densitiesform a convolution semigroup: . With Fourier convention , the characteristic function is . Multiplying characteristic functions proves the semigroup identity. Equivalently, the sum of independent centered Cauchy random variables has scale equal to the sum of their scales; for example, scales two and three combine to scale five.
This family permits an exact deconvolution calculation for a particular right-hand side. If , the integral equationhas probability-density solution . If , the probability-measure solution is the Dirac measure at zero rather than an ordinary density. If , a probability-measure solution would have characteristic function , which exceeds one in modulus for nonzero and is impossible.
Subtracting scales works because both sides belong to this convolution family. For a general right-hand side, Fourier deconvolution instead multiplies its transform by , potentially amplifying high-frequency errors. The semigroup identity does not make arbitrary Cauchy-kernel integral equations stable or solvable by a scale subtraction.
Cauchy-Green operator Created 2026-09-28 Updated 2026-11-05
For a smooth function compactly supported in a disc , the Cauchy-Green operator isHere and , fixing the sign between the two forms of the integral. The kernel is locally integrable, andIndeed, the distribution is a fundamental solution of , so differentiating its convolution with gives . Smooth compactly supported input makes the convolution smooth and the identity classical.[ref]
For local data without compact support, multiply by a smooth cutoff function equal to one on a smaller disc. The resulting operator solves the original equation there. Applying this construction to coefficients in one coordinate at a time gives the local primitives in the Dolbeault-Poincaré lemma. The solution need not itself have compact support.
Causal extension by zero 2026-10-14
Extend a function given for nonnegative time to the real line by setting it to zero before the starting time. This turns unilateral convolution into whole-line convolution and identifies a Laplace transform slice with a Fourier transform after exponential function weighting.
Causal Green function of an overdamped oscillator Created 2026-10-18 Updated 2026-10-20
For with , denotes the Heaviside step function. This Green function vanishes at negative time and satisfies . Its positive-time part solves the homogeneous ordinary differential equation, is zero at the origin, and has right derivative one. Thus it is continuous with a unit derivative jump, which gives precisely the Dirac delta function in its second distributional derivative.
With the negative-exponential Fourier transform convention,Both poles lie in the upper half-plane. Contour integration closes above for positive time and below for negative time, giving the title expression. When the integral converges, convolution supplies the response with no freely added homogeneous transient growing toward negative infinity. The continuous limit is .
Causal indistinguishability of delayed optical inputs on a finite record means that an observation ending at a fixed time cannot discriminate inputs whose differences have not yet reached its receivers. The unobserved delayed-pulse counterexample to a fitted tail bound proves this for one calibrated convolution channel. The same information limit holds for any finite set of causal linear channels.
Let channel have response with for , and record only for . Every perturbation supported strictly after satisfiesfor every channel. Thus the finite-record observation operator has a whole family of invisible input directions. This is compatible with nonnegative optical power: choose any nonnegative delayed pulse and compare with . No cancellation between unphysical negative powers is required.
Known propagation or detector latency can hide part of the input even before the record ends. If for , an input starting at produces no response before . The input-time horizon of a delayed optical receiver record therefore depends on the channel's time reference, not just the last stored sample time.
For an original example, suppose two ideal delay channels measure and , both recorded through . A pulse starting at input time first appears at output times and . Both stored records are unchanged by that pulse, even though it began before the nominal record endpoint. Additional causal channels with smaller delays can extend the input horizon; none can observe an input that begins after their recording ends.
Offline processing of identical stored records still gives identical results, even if the processing filter itself uses samples on both sides of each stored time. To distinguish the inputs, obtain additional observations or supply independently justified restrictions on later illumination. Exact knowledge of the receiver response alone supplies neither.
NIST's pulse calibration characterized the detector, cable and oscilloscope as a combined response chain using a short optical input.[ref]
Calibration Service for Low-level Pulsed-Laser Radiometers at 1.06 µm: Pulse Energy and Peak Power by Rodney W. Leonhardt. Appendix C.1–C.2, printed pp. 36–37, Figure C1 and measurement procedure
Such characterization is important for aligning the physical input and recorded output times. The two pure delays above are chosen models, not measured delays of that apparatus. A future-valid optical envelope or documented source cutoff remains additional information needed for an all-future missed-energy bound. Causal response of a first-order relaxation equation Created 2026-10-14 Updated 2026-10-20
For , the retarded impulse response of is the displayed function, with the Heaviside step function. The corresponding convolution is the unique solution tending to zero in the remote past whenever the integral exists and has that limit. For example, bounded forcing that tends to zero as satisfies these conditions. A general forcing need not: admits no such solution. A unit-duration pulse with gives before zero, between zero and one, and thereafter.
Cepstrum 2026-11-05
A cepstrum transforms a logarithmic spectrum back to a time-like coordinate. In the real-cepstrum convention for a discrete-time signal with Fourier transform ,The finite-data version uses an inverse discrete Fourier transform of the log-magnitude spectrum. Zeros require suitable assumptions or numerical regularization. Using log power instead of log magnitude changes the scaling, so the convention must be stated.[ref]
Spectral Audio Signal Processing by Julius O. Smith III. Spectral Envelope Extraction, Cepstral Windowing, equation 11.2
The usefulness comes from convolution: if , then the spectra multiply and their log magnitudes add, giving . Multiplicative source-and-filter effects become additive.
For an ideal echo filter , with real , expanding givesOther coefficients vanish. Thus an echo of amplitude delayed by eight samples gives coefficients at and at . Peaks reveal a delay that originally appeared as spectral ripples. The output coordinate is called quefrency. Keeping only its low-quefrency coefficients can smooth a spectral envelope, while retaining high-quefrency structure can expose repetitions.
Every character of an algebra on with convolution multiplication is uniquely of this form for . If is the point mass at , then . A character has norm one and , so and . Hence lies on the unit circle; multiplication determines all and continuity determines the displayed series. Conversely absolute convergence permits rearrangement of the double series, proving multiplicativity. The maximal ideals are exactly their kernels: each consists of sequences whose Fourier series vanishes at one fixed point of the unit circle.
Character space of an Abelian L1 group algebra Created 2026-10-14 Updated 2026-10-31
For a locally compact Hausdorff Abelian group, each continuous unitary character defines an algebra character by . Conversely, if is a nonzero algebra character and , the ratio is independent of , continuous and multiplicative. Translation isometries bound all its integer powers, so its modulus is one. The convolution formula recovers . The Gelfand topology corresponds to the compact-open topology on the Pontryagin dual group; conjugating the characters gives the alternative Fourier sign convention.
Every compactly supported distribution on an open set is a finite sum with continuous compactly supported inside . One can first write for a continuous global convolution primitive, then multiply by a cutoff function equal to one near the support. The identity localizes every coefficient. Finite global representation can fail for a distribution of unbounded order.