Related papers: Tight Additive Sensitivity on LZ-style Compressors…
We revisit the study of optimal regret rates in bandit combinatorial optimization---a fundamental framework for sequential decision making under uncertainty that abstracts numerous combinatorial prediction problems. We prove that the…
We present final searches of the anomalous gammaWW and ZWW trilinear gauge boson couplings from WW and WZ production using lepton plus dijet final states and a combination with results from Wgamma, WW, and WZ production with leptonic final…
We give the explicit estimates of order $\gamma^{-d}$ (with logarithmic correction in the 1D case) for the fractal dimension of the attractor of the damped hyperbolic equation (or system) in a bounded domain $\Omega\subset \mathbb R^d$,…
We propose a novel Thompson sampling algorithm that learns linear quadratic regulators (LQR) with a Bayesian regret bound of $O(\sqrt{T})$. Our method leverages Langevin dynamics with a carefully designed preconditioner and incorporates a…
We spell out the derivation of novel features, put forward earlier in a letter, of two dimensional gravity in the strong coupling regime, at $C_L=7$, 13, 19. Within the operator approach previously developed, they neatly follow from the…
We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their…
Two important similarity measures between sequences are the longest common subsequence (LCS) and the dynamic time warping distance (DTWD). The computations of these measures for two given sequences are central tasks in a variety of…
We show tight bounds for online Hamming distance computation in the cell-probe model with word size w. The task is to output the Hamming distance between a fixed string of length n and the last n symbols of a stream. We give a lower bound…
For every total recursive time bound $t$, a constant fraction of all compressible (low Kolmogorov complexity) strings is $t$-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of…
Deviations from standard electroweak physics arise in the framework of a Randall-Sundrum model, with matter and gauge fields in the bulk and the Higgs field localized on the TeV brane. We focus in particular on modifications associated with…
We reveal a connection between the incompressibility method and the Lovasz local lemma in the context of Ramsey theory. We obtain bounds by repeatedly encoding objects of interest and thereby compressing strings. The method is demonstrated…
We consider, in a string theory framework, physical processes of phenomenological interest in models with a low string scale. The amplitudes we study involve tree-level virtual gravitational exchange, divergent in a field-theoretical…
In this paper we present $LCSk$++: a new metric for measuring the similarity of long strings, and provide an algorithm for its efficient computation. With ever increasing size of strings occuring in practice, e.g. large genomes of plants…
At low energies, interactions of massless particles in type II strings compactified on a torus $T^d$ are described by an effective Wilsonian action $\mathcal{S}(\Lambda)$, consisting of the usual supergravity Lagrangian supplemented by an…
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern matching problem inspired by the popularity of such compression…
We present evidence for a new deconstruction of Little String Theory (LST). The starting point is a four-dimensional conformal field theory on its Higgs branch which provides a lattice regularization of six-dimensional gauge theory. We…
We investigate adaptive sublinear algorithms for detecting monotone patterns in an array. Given fixed $2 \leq k \in \mathbb{N}$ and $\varepsilon > 0$, consider the problem of finding a length-$k$ increasing subsequence in an array $f \colon…
In recent years the question of maximizing GCD sums regained interest due to its firm link with large values of $L$-functions. In the present paper we initiate the study of minimizing for positive weights~$w$ of normalized $L^1$- norm the…
A mild version of the weak gravity conjecture (WGC) states that extremal black holes have charge-to-mass ratio larger or equal than one when higher-curvature interactions are taken into account. Since these corrections become more relevant…
A {\em subsequence} of a word $w$ is a word $u$ that can be obtained by deleting some letters from $w$ while maintaining the relative order of the remaining letters, e.g., $\mathtt{lala}$ is a subsequence of $\mathtt{alfalfa}$. A word, over…