Related papers: Tight Additive Sensitivity on LZ-style Compressors…
It has been known for some time that the SL(2,R) WZWN model reduces to Liouville theory. Here we give a direct and physical derivation of this result based on the classical string equations of motion and the proper string size. This allows…
In the Closest String problem one is given a family $\mathcal S$ of equal-length strings over some fixed alphabet, and the task is to find a string $y$ that minimizes the maximum Hamming distance between $y$ and a string from $\mathcal S$.…
A binary code Enc$:\{0,1\}^k \to \{0,1\}^n$ is $(0.5-\epsilon,L)$-list decodable if for all $w \in \{0,1\}^n$, the set List$(w)$ of all messages $m \in \{0,1\}^k$ such that the relative Hamming distance between Enc$(m)$ and $w$ is at most…
In this paper, we propose a novel approach to combine \emph{compact directed acyclic word graphs} (CDAWGs) and grammar-based compression. This leads us to an efficient self-index, called Linear-size CDAWGs (L-CDAWGs), which can be…
The Longest Common Subsequence (LCS) is a fundamental string similarity measure, and computing the LCS of two strings is a classic algorithms question. A textbook dynamic programming algorithm gives an exact algorithm in quadratic time, and…
We analyze various models with an extra U(1) gauge symmetry in addition to the Standard Model (SM) gauge group at low energies, and impose limits on the mass of the neutral Z' boson, M_Z', predicted in all such models, and on the Z-Z'…
Two permutations $(x_1,\dots,x_w)$ and $(y_1,\dots,y_w)$ are weakly similar if $x_i<x_{i+1}$ if and only if $y_i<y_{i+1}$ for all $1\leqslant i \leqslant w$. Let $\pi$ be a permutation of the set $[n]=\{1,2,\dots, n\}$ and let $wt(\pi)$…
We show how precision electroweak data, assuming CP conservation and flavor universality, despite being sensitive to 20 dimension 6 operators, constrain severely only 9 combinations of them. We define a set of 7 oblique parameters $\hat S,…
The exclusive two-photon production at the LHC of pairs of W and Z bosons provides a novel and unique test-ground for the electroweak gauge boson sector. In particular it offers, thanks to high gamma-gamma center-of-mass energies, large and…
In top-bottom seesaw and topflavor model, there may exist extra Higgses and vectorlike fermions, and we have examined the W mass anomaly reported by CDF II in these frames. We found that the CDF II W-boson mass data constrains the parameter…
It is well-known that checking whether a given string $w$ matches a given regular expression $r$ can be done in quadratic time $O(|w|\cdot |r|)$ and that this cannot be improved to a truly subquadratic running time of $O((|w|\cdot…
Grammar compression is a general compression framework in which a string $T$ of length $N$ is represented as a context-free grammar of size $n$ whose language contains only $T$. In this paper, we focus on studying the limitations of…
An LZ-like factorization of a string divides it into factors, each being either a single character or a copy of a preceding substring. While grammar-based compression schemes support efficient random access with space linear in the…
Let $C$ be an extremal Type III or IV code and $D_{w}$ be the support design of $C$ for a weight $w$. We introduce the two numbers $\delta(C)$ and $s(C)$: $\delta(C)$ is the largest integer $t$ such that, for all weights, $D_{w}$ is a…
Lightweight Temporal Compression (LTC) is among the lossy stream compression methods that provide the highest compression rate for the lowest CPU and memory consumption. As such, it is well suited to compress data streams in…
We introduce a new family of codes, termed weighted superimposed codes (WSCs). This family generalizes the class of Euclidean superimposed codes (ESCs), used in multiuser identification systems. WSCs allow for discriminating all bounded,…
The sensitivity conjecture which claims that the sensitivity complexity is polynomially related to block sensitivity complexity, is one of the most important and challenging problem in decision tree complexity theory. Despite of a lot of…
Graph spanners and emulators are sparse structures that approximately preserve distances of the original graph. While there has been an extensive amount of work on additive spanners, so far little attention was given to weighted graphs.…
A low-power error-correcting cooling (LPECC) code was introduced as a coding scheme for communication over a bus by Chee et al. to control the peak temperature, the average power consumption of on-chip buses, and error-correction for the…
Compact directed acyclic word graphs (CDAWGs) [Blumer et al. 1987] are a fundamental data structure on strings with applications in text pattern searching, data compression, and pattern discovery. Intuitively, the CDAWG of a string $T$ is…