相关论文: Sensitivity of Repetitiveness Measures to String R…

Test-time adaptation (TTA) aims to adapt models to maintain reliable performance on non-stationary test streams without requiring labeled data. Despite its empirical success, the learnability of TTA under non-stationary streams remains…

Like grand unification of old, string unification predicts simple tree-level relations between the couplings of all unbroken gauge groups such as $SU(3)_C$ or $SU(2)_W\)$. I show here how to compute one-loop corrections to these relations…

The Burrows-Wheeler Transform (BWT) serves as the basis for many important sequence indexes. On very large datasets (e.g. genomic databases), classical BWT construction algorithms are often infeasible because they usually need to have the…

We show that existing low energy experiments, searching for the breaking of local Lorentz invariance, set bounds upon string theory inspired quantum gravity models that induce corrections to the propagation of fields. In the D-particle…

Given an infinite word ${\bf w}$ on a finite alphabet, an immediate question arises:~can we understand the frequency of letters in ${\bf w}$\,? For words that are the fixed points of substitutions, the answer to this question is often `yes'…

We present a metric on the space of scattering events based on relative transverse momenta and with explicit sensitivity to intermediate resonances. With this new metric, negative weights in an event sample can be reduced substantially…

Word order variances generally exist in different languages. In this paper, we hypothesize that cross-lingual models that fit into the word order of the source language might fail to handle target languages. To verify this hypothesis, we…

Recent large language models have been trained on vast datasets, but also often on repeated data, either intentionally for the purpose of upweighting higher quality data, or unintentionally because data deduplication is not perfect and the…

While machine translation evaluation metrics based on string overlap (e.g., BLEU) have their limitations, their computations are transparent: the BLEU score assigned to a particular candidate translation can be traced back to the presence…

In this work, we study the relative hardness of fundamental problems with state-of-the-art word RAM algorithms that take $O(n\sqrt{\log n})$ time for instances described in $\Theta(n)$ machine words ($\Theta(n\log n)$ bits). This complexity…

We present a new scalable, lightweight algorithm to incrementally construct the BWT and FM-index of large string sets such as those produced by Next Generation Sequencing. The algorithm is designed for massive parallelism and can…

The size of the \textit{smallest suffixient set} of positions of a string recently emerged as a new measure of string \textit{repetitiveness} -- a measure reflecting how much of repetitive content the string contains. We study how to…

In string theory, it is well known that any hard scattering amplitude inevitably suffers exponential suppression. We demonstrate that, if the string scale is M_s < 2TeV, this intrinsically stringy behavior leads to a dramatic reduction in…

In the property testing model, the task is to distinguish objects possessing some property from the objects that are far from it. One of such properties is monotonicity, when the objects are functions from one poset to another. This is an…

The problem of correcting transpositions (or swaps) of consecutive symbols in $ q $-ary strings is studied. Lower bounds on asymptotically achievable rates of codes correcting $ t = \tau n $ transpositions are derived. The first bound is…

After reviewing the $\beta$-function equations for consistent string backgrounds in the $\sigma$-model approach, including metric and antisymmetric tensor, dilaton and tachyon potential, we apply this formalism to WZW models. We…

A family of Lempel-Ziv factorizations is a well-studied string structure. The LZ-End factorization is a member of the family that achieved faster extraction of any substrings (Kreft & Navarro, TCS 2013). One of the interests for LZ-End…

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 prove that for every integer $n > 0$ and for every alphabet $\Sigma_k$ of size $k \geq 3$, there exists a necklace of length $n$ whose Burrows-Wheeler Transform (BWT) is completely unclustered, i.e., it consists of exactly $n$ runs with…

We study string theory on the extended spacetime of the BTZ black hole, as described by an orbifold of the SL(2,R) WZW model. The full spacetime has an infinite number of disconnected boundary components, each corresponding to a dual CFT.…