Related papers: Effective Erd\H{o}s--Wintner for Cantor numeration…
We will construct ``higher-dimensional" versions of the Wiener-Wintner dynamical system that was originally studied by I. Assani in 2003. We will show that on these systems we can provide very simple proofs of the a.e. convergence of the…
Consider the scattering of a time-harmonic plane wave by a rigid obstacle embedded in a homogeneous and isotropic elastic medium in two dimensions. In this paper, a novel boundary integral formulation is proposed and its highly accurate…
This work studies time-dependent electromagnetic scattering from obstacles whose interaction with the wave is fully determined by a nonlinear boundary condition. In particular, the boundary condition studied in this work enforces a power…
There has been recent progress in showing that the exponential dependence on treewidth in dynamic programming algorithms for solving NP-hard problems are optimal under the Strong Exponential Time Hypothesis (SETH). We extend this work to…
Sliding suffix trees (Fiala & Greene, 1989) for an input text $T$ over an alphabet of size $\sigma$ and a sliding window $W$ of $T$ can be maintained in $O(|T| \log \sigma)$ time and $O(|W|)$ space. The two previous approaches that achieve…
We numerically verify and analytically prove a winding number invariant that correctly predicts the number of edge states in one-dimensional, nearest-neighbor (between unit cells), two-band models with any complex couplings and open…
The scattering of electromagnetic waves from obstacles with wave-material interaction in thin layers on the surface is described by generalized impedance boundary conditions, which provide effective approximate models. In particular, this…
We prove the convergence in a strong norm of a finite difference semi-discrete scheme approximating a coupled Schr\"odinger--KdV system on a bounded domain. This system models the interaction of short and long waves. Since the energy…
In this article we show that the Erd\H{o}s-Kac theorem, which informally states that the number of prime divisors of very large integers converges to a normal distribution, has an elegant proof via Algorithmic Information Theory.
Here we build some effective boundary conditions to be used in numerical calculations in order to avoid the thin meshing usually required in problems involving Hartmann layers near a locally plane wall. Wall model are provided for both…
We study a fixed-window counting system in which integers are represented by words of constant length while the alphabet grows as needed. This viewpoint arises from De Bruijn sequences: for fixed order $n$, the reverse prefer-max sequence…
Numerical studies in random systems are plagued with strong finite-size effects and boundary effects. We introduce a window-measurement method as a practical solution to these difficulties. We observe physical quantities only within a…
We study a tight Bennett-type concentration inequality for sums of heterogeneous and independent variables, defined as a one-dimensional minimization. We show that this refinement, which outperforms the standard known bounds, remains…
In 1972 Delange observed in analogy of the classical Erd\H os-Wintner theorem that $q$-additive functions $f(n)$ has a distribution function if and only if the two series $\sum f(d q^j)$, $\sum f(d q^j)^2$ converge. The purpose of this…
Reliability is an inherent challenge for the emerging nonvolatile technology of racetrack memories, and there exists a fundamental relationship between codes designed for racetrack memories and codes with constrained periodicity. Previous…
We provide an improved version of the Darling-Erd\"os theorem for sums of i.i.d. random variables with mean zero and finite variance. We extend this result to multidimensional random vectors. Our proof is based on a new strong invariance…
This paper proposes and analyzes a finite difference method based on compact schemes for the Euler-Bernoulli beam equation with damping terms. The method achieves fourth-order accuracy in space and second-order accuracy in time, while…
We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erd\H{o}s-Straus conjecture. The approach exploits divisor structures of shifted integers p+i rather than…
Bounds consistency is usually enforced on continuous constraints by first decomposing them into binary and ternary primitives. This decomposition has long been shown to drastically slow down the computation of solutions. To tackle this,…
Transversal logical gates offer the opportunity for fast and low-noise logic, particularly when interspersed by a single round of parity check measurements of the underlying code. Using such circuits for the surface code requires decoding…