Related papers: Tight Additive Sensitivity on LZ-style Compressors…

We use Monte Carlo simulations to study pure 2D Euclidean quantum gravity with $R^2$-interaction on spherical topologies, employing Regge's formulation. We attempt to measure the string susceptibility exponent $\gamma_{\rm str}$ by using a…

Constant weight codes (CWCs) and constant composition codes (CCCs) are two important classes of codes that have been studied extensively in both combinatorics and coding theory for nearly sixty years. In this paper we show that for {\it…

Measurements of the magnetic susceptibility and its anisotropy in the quasi-one-dimensional system o-TaS_{3} in its low-T charge density wave (CDW) ground state are reported. Both sets of data reveal below 40 K an extra paramagnetic…

We consider a sliding window $W$ over a stream of characters from some alphabet of constant size. The user wants to perform deterministic substring matching on the current sliding window content and obtain positions of the matches. We…

This paper considers the problem of maintaining statistic aggregates over the last W elements of a data stream. First, the problem of counting the number of 1's in the last W bits of a binary stream is considered. A lower bound of…

This Letter describes the current most precise measurement of the $W$ boson pair production cross section and most sensitive test of anomalous $WW\gamma$ and $WWZ$ couplings in $p \bar p$ collisions at a center-of-mass energy of 1.96 TeV.…

Counting substrings/subsequences that preserve some property (e.g., palindromes, squares) is an important mathematical interest in stringology. Recently, Glen et al. studied the number of Lyndon factors in a string. A string $w = uv$ is…

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this correspondence, a $K \times N$ measurement matrix for compressed sensing is deterministically constructed via additive…

We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\varTheta(n^2)$, where…

The \emph{longest common extension} (\emph{LCE}) problem is to preprocess a given string $w$ of length $n$ so that the length of the longest common prefix between suffixes of $w$ that start at any two given positions is answered quickly. In…

In this paper we consider two problems concerning string factorisation. Specifically given a string $w$ and an integer $k$ find a factorisation of $w$ where each factor has length bounded by $k$ and has the minimum (the FmD problem) or the…

Precision measurements of rare particle physics phenomena (flavor oscillations and decays, electric dipole moments, etc.) are often sensitive to the effects of new physics encoded in higher-dimensional operators with Wilson coefficients…

We prove a size-sensitive version of Haussler's Packing lemma~\cite{Haussler92spherepacking} for set-systems with bounded primal shatter dimension, which have an additional {\em size-sensitive property}. This answers a question asked by…

Discovery potentials for extra neutral interactions at the Large Hadron Collider in forthcoming experiments are analyzed using resonant leptoproduction. For this purpose we use high precision next-to-next-to-leading order (NNLO)…

We consider extensions of the standard model based on open strings ending on D-branes, with gauge bosons due to strings attached to stacks of D-branes and chiral matter due to strings stretching between intersecting D-branes. Assuming that…

In this paper we compare the difference in performance of two of the Prediction by Partial Matching (PPM) family of compressors (PPM$^*$ and the original Bounded PPM algorithm) and the Lempel-Ziv 78 (LZ) algorithm. We construct an infinite…

Lossless data compression has been widely studied in computer science. One of the most widely used lossless data compressions is Lempel-Zip(LZ) 77 parsing, which achieves a high compression ratio. Bidirectional (a.k.a. macro) parsing is a…

The Swap-Insert Correction distance from a string $S$ of length $n$ to another string $L$ of length $m\geq n$ on the alphabet $[1..d]$ is the minimum number of insertions, and swaps of pairs of adjacent symbols, converting $S$ into $L$.…

A substring $u$ of a string $T$ is called a minimal unique substring (MUS) of $T$ if $u$ occurs exactly once in $T$ and any proper substring of $u$ occurs at least twice in $T$. A string $w$ is called a minimal absent word (MAW) of $T$ if…

We study large dimensions and low string scale in four-dimensional compactifications of type II theories of closed strings at weak coupling. We find that the fundamental string scale, together with all compact dimensions, can be at the TeV,…