Related papers: Properties of maximum Lempel-Ziv complexity string…
We study the structures of arbitrary split Leibniz triple systems. By developing techniques of connections of roots for this kind of triple systems, under certain conditions, in the case of $T$ being of maximal length, the simplicity of the…
We present a novel approach for investigating lens phenomenology of cosmic strings in order to elaborate detection strategies in galaxy deep field images. To account for the complexity of the projected energy distribution of string networks…
In this article, we review existing probabilistic models for modeling abundance of fixed-length strings (k-mers) in DNA sequencing data. These models capture dependence of the abundance on various phenomena, such as the size and repeat…
I review the relations between mass scales in various string theories and in M-theory. I discuss physical motivations and possible consistent realizations of large volume compactifications and low string scale. Large longitudinal…
We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main…
[Abridged] We consider extensions of the standard model based on open strings ending on D-branes. Assuming that the fundamental string mass scale M_s is in the TeV range and that the theory is weakly coupled, we discuss possible signals of…
In multiple-input multiple-output (MIMO) spatially multiplexing (SM) systems, achievable error rate performance is determined by signal detection strategy. The optimal maximum-likelihood detection (MLD) that exhaustively examines all symbol…
We study random string-duplication systems, which we call P\'olya string models. These are motivated by DNA storage in living organisms, and certain random mutation processes that affect their genome. Unlike previous works that study the…
We introduce a complexity measure for symbolic sequences. Starting from a segmentation procedure of the sequence, we define its complexity as the entropy of the distribution of lengths of the domains of relatively uniform composition in…
All-order strong coupling simulations have been used to derive precise energies of string states in the confined phase of three dimensional Z(2) lattice gauge theory. The behavior of the ground state energy is here compared with predictions…
We study a new class of networks, generated by sequences of letters taken from a finite alphabet consisting of $m$ letters (corresponding to $m$ types of nodes) and a fixed set of connectivity rules. Recently, it was shown how a binary…
We extend the notion of matching for one-dimensional dynamical systems to random matching for random dynamical systems on an interval. We prove that for a large family of piecewise affine random systems of the interval the property of…
We describe an alternative method (to compression) that combines several theoretical and experimental results to numerically approximate the algorithmic (Kolmogorov-Chaitin) complexity of all $\sum_{n=1}^82^n$ bit strings up to 8 bits long,…
Given a set X of finite strings, one interesting question to ask is whether there exists a member of X which is simple conditional to all other members of X. Conditional simplicity is measured by low conditional Kolmogorov complexity. We…
At the classical level we study open bosonic strings. A generic description of string self-interactions localized at string ends is given. Self-interactions are characterized by two dimensionless coupling constants. The model is rewritten…
We use supersymmetry to calculate exact spectral densities for a class of complex random matrix models having the form $M=S+LXR$, where $X$ is a random noise part $X$ and $S,L,R$ are fixed structure parts. This is a certain version of the…
This paper considers a finite sample perspective on the problem of identifying an LTI system from a finite set of possible systems using trajectory data. To this end, we use the maximum likelihood estimator to identify the true system and…
Filaments are one of the most prominent features visible in the galaxy distribution. Considering the Luminous Red Galaxies (LRGs) in the Sloan Digital Sky Survey Data Release Seven (SDSS DR7), we have analyzed the filamentarity in 11 nearly…
Despite their outstanding performance, large language models (LLMs) suffer notorious flaws related to their preference for simple, surface-level textual relations over full semantic complexity of the problem. This proposal investigates a…
A well-known fact in the field of lossless text compression is that high-order entropy is a weak model when the input contains long repetitions. Motivated by this, decades of research have generated myriads of so-called dictionary…