Related papers: Binary strings of finite VC dimension
Using a classical action associated to a point-particle in (1+1)-dimensions the classical string theory is derived. In connection with this result two aspects are clarified: First, the point particle in (1+1)-dimensions is not an ordinary…
In a complete metric space that is equipped with a doubling measure and supports a Poincar\'e inequality, we study strict subsets, i.e. sets whose variational capacity with respect to a larger reference set is finite, in the case $p=1$.…
We study the minimal dimension of the classifying space of the family of virtually cyclic subgroups of a discrete group. We give a complete answer for instance if the group is virtually poly-Z, word-hyperbolic or countable locally virtually…
Bundles of strings which interact via short-ranged pair potentials are studied in two dimensions. The corresponding transfer matrix problem is solved analytically for arbitrary string number N by Bethe ansatz methods. Bundles consisting of…
We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected…
It is known a vector linear solution may exist if and only if the characteristic of the finite field belongs to a certain set of primes. But, can increasing the message dimension make a network vector linearly solvable over a larger set of…
A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the…
We show that there are infinitely many binary strings z, such that the sum of the on-line decision complexity of predicting the even bits of z given the previous uneven bits, and the decision complexity of predicting the uneven bits given…
We present supersymmetric soliton solutions of the four-dimensional heterotic string corresponding to monopoles, strings and domain walls. These solutions admit the $D=10$ interpretation of a fivebrane wrapped around $5$, $4$ or $3$ of the…
We discuss an orbifold of the toroidally compactified heterotic string which gives a global reduction of the dimension of the moduli space while preserving the supersymmetry. This construction yields the moduli space of the first of a…
In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…
A constructive version of Hausdorff dimension is developed using constructive supergales, which are betting strategies that generalize the constructive supermartingales used in the theory of individual random sequences. This constructive…
The non-linear nature of string theory on non-trivial backgrounds related to the AdS/CFT correspondence suggests to look for simplifications. Two such simplifications proved to be useful in studying string theory. These are the pp-wave…
Special solutions of string theory in supercritical dimensions can interpolate in time between theories with different numbers of spacetime dimensions (via dimension quenching) and different amounts of worldsheet supersymmetry (via…
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself…
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…
Fractional superstrings are recently-proposed generalizations of the traditional superstrings and heterotic strings. They have critical spacetime dimensions which are less than ten, and in this paper we investigate model-building for the…
Much work has been done to identify which binary codes can be represented by collections of open convex or closed convex sets. While not all binary codes can be realized by such sets, here we prove that every binary code can be realized by…
With our current level of understanding, the problem of making string theory predictions is not one of "solving" the theory, but rather of trying to determine whether there are any generic expectations. Within this context, we discuss what…
We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homology with the highest probability: either zero or…