相关论文: Boundary effect of deterministic dense coding
Boundedness is demonstrated for the fifth derivative of the one-particle reduced density matrix for non-relativistic Coulombic wavefunctions in the vicinity of the diagonal. To prove this result, strong pointwise bounds are obtained for…
Klee's measure problem (computing the volume of the union of $n$ axis-parallel boxes in $\mathbb{R}^d$) is well known to have $n^{\frac{d}{2}\pm o(1)}$-time algorithms (Overmars, Yap, SICOMP'91; Chan FOCS'13). Only recently, a conditional…
We consider theoretically density-density correlation of identical Fermi system by including the finite resolution of a detector and delta-function term omitted in the ordinary method. We find an anomalous fermion bunching effect, which is…
We introduce EDB-bounded datalog, a framework for deriving upper bounds on intermediate result sizes and the asymptotic complexity of recursive queries in datalog. We present an algorithm that, given an arbitrary datalog program, constructs…
We generalize the fundamental bounds of Delsarte thesis (1973) on codes of given degree and designs of given strength in the new setting of Bannai et al. (2025). We assume the scheme is weakly metric in the sense of (Sol\'e, 1989). We give…
Many physical systems -- such as optical waveguide lattices and dense neuronal or vascular networks -- can be modeled by metric graphs, where slender "wires" (edges) support wave or diffusion equations subject to Kirchhoff conditions at the…
This paper studies random-coding error exponents of randomised list decoding, in which the decoder randomly selects $L$ messages with probabilities proportional to the decoding metric of the codewords. The exponents (or bounds) are given…
Current deterministic algorithms for the construction of polar codes can only be argued to be practical for channels with small input alphabet sizes. In this paper, we show that any construction algorithm for channels with moderate input…
We show that a known condition for having rough basin boundaries in bistable 2D maps holds for high-dimensional bistable systems that possess a unique nonattracting chaotic set embedded in their basin boundaries. The condition for roughness…
By sending a classical two-level system, one can transfer information about only \emph{two} distinguishable outcomes. Here we show that in quantum mechanics, using both the spin and path degrees of freedom of a spin-1/2 particle, and a…
Given a resistor network on $\mathbb Z^d$ with nearest-neighbor conductances, the effective conductance in a finite set with a given boundary condition is the the minimum of the Dirichlet energy over functions with the prescribed boundary…
Let $A(n,d)$ (respectively $A(n,d,w)$) be the maximum possible number of codewords in a binary code (respectively binary constant-weight $w$ code) of length $n$ and minimum Hamming distance at least $d$. By adding new linear constraints to…
Steady-state solutions of the Poisson-Nernst-Planck model are studied in the asymptotic limit of large, but finite domains. By using asymptotic matching for integrals, we derive an approximate solution for the steady-state equation with…
The effect of "good", point-to-point capacity achieving, code sequences on an additional signal, of bounded variance, transmitted over the additive Gaussian noise channel is examined. For such code sequences, it is shown that their effect,…
We formulate a model for intermittent communication that can capture bursty transmissions or a sporadically available channel, where in either case the receiver does not know a priori when the transmissions will occur. Focusing on the…
We study codes that are list-decodable under insertions and deletions. Specifically, we consider the setting where a codeword over some finite alphabet of size $q$ may suffer from $\delta$ fraction of adversarial deletions and $\gamma$…
The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…
We consider models of directed random polymers interacting with a defect line, which are known to undergo a pinning/depinning (or localization/delocalization) phase transition. We are interested in critical properties and we prove, in…
In this paper, we investigate how much of the numerical artefacts introduced by finite system size and choice of boundary conditions can be removed by finite size scaling, for strongly-correlated systems with quasi-long-range order.…
The curse of dimensionality in the realm of association rules is twofold. Firstly, we have the well known exponential increase in computational complexity with increasing item set size. Secondly, there is a \emph{related curse} concerned…