Related papers: String Compression in FA-Presentable Structures

We determine the structure of the partition algebra $P_n(Q)$ (a generalized Temperley-Lieb algebra) for specific values of $Q \in \C$, focusing on the quotient which gives rise to the partition function of $n$ site $Q$-state Potts models…

We investigate string graphs through the lens of graph product structure theory, which describes complicated graphs as subgraphs of strong products of simpler building blocks. A graph $G$ is called a string graph if its vertices can be…

We consider the problem of {\em restructuring} compressed texts without explicit decompression. We present algorithms which allow conversions from compressed representations of a string $T$ produced by any grammar-based compression…

We investigate the problem of succinctly representing an arbitrary permutation, \pi, on {0,...,n-1} so that \pi^k(i) can be computed quickly for any i and any (positive or negative) integer power k. A representation taking (1+\epsilon) n lg…

In the volume fraction range (0.005,0.08), we have obtained the temporal evolution of the structure factor $S(q)$, in extensive numerical simulations of both diffusion-limited and reaction-limited colloid aggregation in three dimensions. We…

In 1993 E. I. Zelmanov asked the following question in Dniester Notebook: "Suppose that F_{2, m} is a 2-generated associative ring with the identity x^m=0. Is it true, that the nilpotency degree of F_{2, m} has exponential growth?" We show…

A class of non-supersymmetric string backgrounds can be constructed using twists that involve space-time fermion parity. We propose a non-perturbative definition of string theory in these backgrounds via gauge theories with supersymmetry…

Kucera and Gacs independently showed that every infinite sequence is Turing reducible to a Martin-Lof random sequence. This result is extended by showing that every infinite sequence S is Turing reducible to a Martin-Lof random sequence R…

We present a new data structure called the \emph{Compressed Random Access Memory} (CRAM) that can store a dynamic string $T$ of characters, e.g., representing the memory of a computer, in compressed form while achieving asymptotically…

The stochastic $\phi^4$-theory in $d-$dimensions dynamically develops domain wall structures within which the order parameter is not continuous. We develop a statistical theory for the $\phi^4$-theory driven with a random forcing which is…

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$.…

Let $G=(V,E)$ be a simple graph. A function $f:V\rightarrow \mathbb{N}\cup \{0\}$ is called a configuration of pebbles on the vertices of $G$ and the weight of $f$ is $w(f)=\sum_{u\in V}f(u)$ which is just the total number of pebbles…

We study permutations in $S_n$ that simultaneously avoid the pattern $132$ and satisfy the adjacency bound $|\pi_{i+1} - \pi_i| \leq m$ for all $i$, denoting their number by $A_n^{(m)}$. This combination of a global pattern restriction and…

The architecture of the brain is too complex to be intuitively surveyable without the use of compressed representations that project its variation into a compact, navigable space. The task is especially challenging with high-dimensional…

We study the algebraic structure of electron density operators in gapless Weyl fermion systems in $d=3,5,7,\cdots$ spatial dimensions and in topological insulators (without any protecting symmetry) in $d=4,6,8,\cdots$ spatial dimensions.…

We define a scale of weighted Morrey spaces which contains different weighted versions appearing in the literature. This allows us to obtain weighted estimates for operators in a unified way. In general, we obtain results for weights of the…

Structure of confining string in terms of the topological charge density and the action density is studied in SU(2) Yang-Mills theory on the lattice using HP1 sigma-model embedding approach. We find that the confining flux tube noticeably…

In this paper, we study the static cell probe complexity of non-adaptive data structures that maintain a subset of $n$ points from a universe consisting of $m=n^{1+\Omega(1)}$ points. A data structure is defined to be non-adaptive when the…

Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…

Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this context, especially for real-world cases. Designing an…