Related papers: Binary strings of finite VC dimension

We study the compactification of the pure spinor superstring down to four dimensions. We find that the compactified string is described by a conformal invariant system for both the four dimensional and for the compact six dimensional…

We consider string matching with variable length gaps. Given a string $T$ and a pattern $P$ consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending…

First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to…

Let U be a monster model and let D be a subset of U. Let (U,D) denote theexpansion of U with a new predicate for D. Write e(D) for the collection of all subsets C of U such that (U,C) is elementary equivalent to (U,D). We prove that if e(D)…

Recently, a new framework for solving the hierarchy problem has been proposed which does not rely on low energy supersymmetry or technicolor. The gravitational and gauge interactions unite at the electroweak scale, and the observed weakness…

We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the algebraic properties that capture the computational complexity…

Let V be a vector space of dimension n over a field K and let Symm(V) denote the space of symmetric bilinear forms defined on V x V. Let M be a subspace of Symm(V). We investigate a variety of hypotheses concerning the rank of elements in M…

A global superalgebra with 32 supercharges and all possible central extensions is studied in order to extract some general properties of duality and hidden dimensions in a theory that treats $p$-branes democratically. The maximal number of…

In complex vector spaces maximal sets of equiangular lines, known as SICs, are related to real quadratic number fields in a dimension dependent way. If the dimension is of the form $n^2+3$ the base field has a fundamental unit of negative…

We characterize those strings whose suffix arrays are based on arithmetic progressions, in particular, arithmetically progressed permutations where all pairs of successive entries of the permutation have the same difference modulo the…

Fractional superstrings are non-trivial generalizations of ordinary superstrings and heterotic strings, and have critical spacetime dimensions which are less than ten by virtue of a worldsheet fractional supersymmetry relating worldsheet…

For nonnegative integers $n_2, n_3$ and $d$, let $N(n_2,n_3,d)$ denote the maximum cardinality of a code of length $n_2+n_3$, with $n_2$ binary coordinates and $n_3$ ternary coordinates (in this order) and with minimum distance at least…

We consider the learning and communication complexity of subsequence containment. In the learning problem, we seek to learn a classifier that positively labels a binary string $x$ if it contains a fixed binary string $y$ as a subsequence.…

We investigate the structure of solutions of boundary value problems for a one-dimensional nonlinear system of pseudodifferential equations describing the dynamics (rolling) of p-adic open, closed, and open-closed strings for a scalar…

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…

We extend the system of ungauged N=2, d=4 supergravity coupled to vector multiplets and hypermultiplets with 2-form potentials. The maximal number of 2-form potentials that one may introduce is equal to the number of isometries of either…

We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis…

Input from QCD and string theory is used in order to elucidate basic features of the string theory dual of QCD, It is argued that the relevant string theory is a five-dimensional version of the type-0 superstring. The vacuum solution is…

String theory, if it describes nature, is probably strongly coupled. In light of recent developments in string duality, this means that the ``real world'' should correspond to a region of the classical moduli space which admits no weak…

We say that two partial orders on $[n]$ are compatible if there exists a partial order that refines both of them. This compatibility relation induces a natural set system structure between the collection $\mathcal{F}$ of all partial orders…