Related papers: String Compression in FA-Presentable Structures
The ability to find short representations, i.e. to compress data, is crucial for many intelligent systems. We present a theory of incremental compression showing that arbitrary data strings, that can be described by a set of features, can…
We show that the BRST structure of the topological string is encoded in the ``small'' $N=4$ superconformal algebra, enabling us to obtain, in a non-trivial way, the string theory from hamiltonian reduction of $A(1|1)$. This leads to the…
We systematically examine all possible Gauss laws obeying spatial rotation symmetry, characterising the corresponding conserved charges. In the case of conserved higher moments, this gives rise to fractonic behaviour. We show that many…
We construct a power series representation of the integrals of form \begin{equation} \text{log} \int d\mu_{S}(\psi, \bar{\psi}) \hspace{0.05 cm} e^{f(\psi, \bar{\psi}, \eta, \bar{\eta})} \nonumber \end{equation} where $\psi, \bar{\psi}$ and…
The tree based representation described in this paper, hereditarily binary numbers, applies recursively a run-length compression mechanism that enables computations limited by the structural complexity of their operands rather than by their…
In this work, we introduce the notion of decisional width of a finite relational structure and the notion of decisional width of a regular class of finite structures. Our main result states that given a first-order formula {\psi} over a…
We study the compressed representation of a ranked tree by a (string) straight-line program (SLP) for its preorder traversal, and compare it with the well-studied representation by straight-line context free tree grammars (which are also…
Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h, s)$-length $\phi$-expander decomposition is a small collection of length…
We introduce a compressed representation of sets of sets that exploits how much they differ from each other. Our representation supports access, membership, predecessor and successor queries on the sets within logarithmic time. In addition,…
The term "strong approximation" is used to describe phenomena where an arithmetic group as well as all of its Zariski dense subgroups have a large image in the congruence quotients. We exhibit analogues of such phenomena in a probabilistic,…
Inspired by recent works on evolutionary graph theory, an area of growing interest in mathematical and computational biology, we present the first known examples of undirected structures acting as suppressors of selection for any fitness…
Given a string $S$ of $n$ integers in $[0,\sigma)$, a range minimum query RMQ$(i, j)$ asks for the index of the smallest integer in $S[i \dots j]$. It is well known that the problem can be solved with a succinct data structure of size $2n +…
This paper is concerned with incremental stability properties of nonlinear systems. We propose conditions to compute an upper bound on the incremental L2-gain and to assess incremental asymptotic stability of piecewise-affine (PWA) systems.…
We consider the length of the longest word definable in FO and MSO via a formula of size n. For both logics we obtain as an upper bound for this number an exponential tower of height linear in n. We prove this by counting types with respect…
We show that \emph{efficient Turing computability} at any fixed input/output precision implies the existence of \emph{compositionally sparse} (bounded-fan-in, polynomial-size) DAG representations and of corresponding neural approximants…
Reduction of flow compressibility with the corresponding ideally invariant helicities, universally for various fluid models of neutral and ionized gases, can be argued statistically and associated with the geometrical scenario in the…
We revisit tree compression with top trees (Bille et al, ICALP'13) and present several improvements to the compressor and its analysis. By significantly reducing the amount of information stored and guiding the compression step using a…
A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…
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…
This paper presents a new deep learning architecture for Natural Language Inference (NLI). Firstly, we introduce a new architecture where alignment pairs are compared, compressed and then propagated to upper layers for enhanced…