Related papers: Tight Additive Sensitivity on LZ-style Compressors…
We consider subsequences with gap constraints, i.e., length-k subsequences p that can be embedded into a string w such that the induced gaps (i.e., the factors of w between the positions to which p is mapped to) satisfy given gap…
We study the stochastic gravitational waves from string gas cosmology. With the help of the Lambert W function, we derive the exact energy density spectrum of the stochastic gravitational waves in term of tensor-to-scalar. New feathers with…
We report on a study of axion string networks using fixed-grid simulations of up to $16384$ points per side. The length of string can be characterised in terms of standard dimensionless parameters $\zeta_\text{w}$ and $\zeta_\text{r}$, the…
In this work, we study the limits of compressed data structures, i.e., structures that support various queries on an input text $T\in\Sigma^n$ using space proportional to the size of $T$ in compressed form. Nearly all fundamental queries…
We study the evolution of the gauge coupling constants in string unification schemes in which the light spectrum below the compactification scale is exactly that of the minimal supersymmetric standard model. In the absence of string…
A search is presented for three additional operators that would lead to anomalous WW$\gamma$ or WWZ couplings with respect to those in the standard model. They are constrained by studying events with two vector bosons; a W boson decaying to…
In highly repetitive strings, like collections of genomes from the same species, distinct measures of repetition all grow sublinearly in the length of the text, and indexes targeted to such strings typically depend only on one of these…
In the field of compressed string indexes, recent work has introduced suffixient sets and their corresponding repetitiveness measure $\chi$. In particular, researchers have explored its relationship to other repetitiveness measures, notably…
We prove that the maximum number $N_c$ of non-relativistic electrons that a nucleus of charge $Z$ can bind is less than $1.22Z+3Z^{1/3}$. This improves Lieb's upper bound $N_c<2Z+1$ [{\it Phys. Rev. A} {\bf 29}, 3018-3028 (1984)] when $Z\ge…
In this paper we present for the first time a detailed Monte Carlo study of measuring WZGamma production with pure leptonic decays and probing anomalous quartic gauge-boson WWZGamma couplings at the sqrt(s) = 14 TeV LHC, with parton shower…
One of the most famous and investigated lossless data-compression scheme is the one introduced by Lempel and Ziv about 40 years ago. This compression scheme is known as "dictionary-based compression" and consists of squeezing an input…
We study search trees with 2-way comparisons (2WCST's), which involve separate less-than and equal-to tests in their nodes, each test having two possible outcomes, yes and no. These trees have a much subtler structure than standard search…
We consider the adversarial linear contextual bandit setting, which allows for the loss functions associated with each of $K$ arms to change over time without restriction. Assuming the $d$-dimensional contexts are drawn from a fixed known…
The aim of this note is to provide some reference facts for LZW---mostly from Thomas and Cover \cite{Cover:2006aa} and provide a reference for some metrics that can be derived from it. LZW is an algorithm to compute a Kolmogorov Complexity…
Given strings $P$ of length $m$ and $T$ of length $n$ over an alphabet of size $\sigma$, the string matching with $k$-mismatches problem is to find the positions of all the substrings in $T$ that are at Hamming distance at most $k$ from…
This paper provides an upper bound for several subsets of maximal repeats and maximal pairs in compressed strings and also presents a formerly unknown relationship between maximal pairs and the run-length Burrows-Wheeler transform. This…
Very recently, the ATLAS and CMS collaborations reported diboson and dijet excesses above standard model expectations in the invariant mass region of 1.8 -2.0 TeV. Interpreting the diboson excess of events in a model independent fashion…
A Straight-Line Program (SLP) for a string $T$ is a context-free grammar in Chomsky normal form that derives $T$ only, which can be seen as a compressed form of $T$. Kida et al.\ introduced collage systems [Theor. Comput. Sci., 2003] to…
Despite consistently yielding the best compression on repetitive text collections, the Lempel-Ziv parsing has resisted all attempts at offering relevant guarantees on the cost to access an arbitrary symbol. This makes it less attractive for…
In this work, we study the maximum matching problem from the perspective of sensitivity. The sensitivity of an algorithm $A$ on a graph $G$ is defined as the maximum Wasserstein distance between the output distributions of $A$ on $G$ and on…