Related papers: String Compression in FA-Presentable Structures
We discuss a cosmological model in which the string gauge field coupled universally to matter gives rise to an extra centripetal force and will have observable signatures on cosmological and astronomical observations. Several tests are…
With any max-stable random process $\eta$ on $\mathcal{X}=\mathbb{Z}^d$ or $\mathbb{R}^d$, we associate a random tessellation of the parameter space $\mathcal{X}$. The construction relies on the Poisson point process representation of the…
A novel mechanism for the production of a cosmic network of fundamental superstrings based on a time-varying string tension has been recently proposed in the context of a kinating background driven by the volume modulus of string…
Behaviors of Winfree's tile assembly systems (TASs) at high temperatures are investigated in combination with integer programming of a specific form called threshold programming. First, we propose a way to build bridges from the Boolean…
In the tensionless limit of string theory on flat background all the massive tower of states gets squeezed to a common zero mass level and the free theory is described by an infinite amount of massless free fields with arbitrary integer…
We give brief ideas on building gauge models in superstring theory, especially the four-dimensional models obtained from the compactification of F-theory. According to Vafa, we discuss the construction of F-theory to approach…
We give lower and upper bounds for the separation profile (introduced by Benjamini, Schramm & Tim\'ar) for various graphs using the isoperimetric profile, growth and Hilbertian compression. For graphs which have polynomial isoperimetry and…
We consider partitions of a point set into two parts, and the lengths of the minimum spanning trees of the original set and of the two parts. If $w(P)$ denotes the length of a minimum spanning tree of $P$, we show that every set $P$ of $n…
Let s be a string whose symbols are solely available through access(i), a read-only operation that probes s and returns the symbol at position i in s. Many compressed data structures for strings, trees, and graphs, require two kinds of…
We study universal features of the density of one-particle states $\rho(E)$ in weakly coupled theories of gravity at energies above the quantum gravity cutoff $\Lambda$, defined as the scale suppressing higher-derivative corrections to the…
Long strings emerge in many Quantum Field Theories, for example as vortices in Abelian Higgs theories, or flux tubes in Yang-Mills theories. The actions of such objects can be expanded in the number of derivatives, around a long straight…
We show that the compressed suffix array and the compressed suffix tree of a string $T$ can be built in $O(n)$ deterministic time using $O(n\log\sigma)$ bits of space, where $n$ is the string length and $\sigma$ is the alphabet size.…
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…
We show that the fermionic matrix model can be realized by $W$-representation. We construct the Virasoro constraints with higher algebraic structures, where the constraint operators obey the Witt algebra and null 3-algebra. The remarkable…
We prove that the local limit of the weighted spanning trees on any simple connected high degree almost regular sequence of electric networks is the Poisson(1) branching process conditioned to survive forever, by generalizing [NP22] and…
The physics of complex systems stands to greatly benefit from the qualitative changes in data availability and advances in data-driven computational methods. Many of these systems can be represented by interacting degrees of freedom on…
Numerical and analytical results are presented for the maximal relative height distribution of stationary periodic Gaussian signals (one dimensional interfaces) displaying a 1/f^alpha power spectrum. For 0<alpha<1 (regime of decaying…
We use Arveson's notion of strongly peaking representation to generalize uniqueness theorems for free spectrahedra and matrix convex sets which admit minimal presentations. A fully compressed separable operator system necessarily generates…
We study the following growth model on a regular d-ary tree. Points at distance n adjacent to the existing subtree are added with probabilities proportional to alpha^{-n}, where alpha<1 is a positive real parameter. The heights of these…
We clarify some properties of projective superspace by using a manifestly superconformal notation. In particular, we analyze the N=2 scalar multiplet in detail, including its action, and the propagator and its super-Schwinger parameters.…