Related papers: Binary strings of finite VC dimension
We point out that the moduli sector of the $(2,2)$ string compactification with its nonperturbatively preserved non-compact symmetries is a framework to study global topological defects. Based on the target space modular invariance of the…
We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates child, right sibling,…
We study set systems definable in graphs using variants of logic with different expressive power. Our focus is on the notion of Vapnik-Chervonenkis density: the smallest possible degree of a polynomial bounding the cardinalities of…
We confirm a conjecture of Fox, Pach, and Suk, that for every $d>0$, there exists $c>0$ such that every $n$-vertex graph of VC-dimension at most $d$ has a clique or stable set of size at least $n^c$. This implies that, in the language of…
Suffixient sets are a novel prefix array (PA) compression technique based on subsampling PA (rather than compressing the entire array like previous techniques used to do): by storing very few entries of PA (in fact, a compressed number of…
The VC-dimension of a set system is a way to capture its complexity and has been a key parameter studied extensively in machine learning and geometry communities. In this paper, we resolve two longstanding open problems on bounding the…
For a finite binary relation, we show a local operation which does not decrease its number of (Galois-)closed sets and eventually increases its (Vapnik-Chervonenkis)-dimension. Specifically, we show that there always exist a pair of…
It was recently shown that non-Abelian vortex strings supported in a version of four-dimensional N=2 supersymmetric QCD (SQCD) become critical superstrings. In addition to four translational moduli, non-Abelian strings under consideration…
As was shown recently, non-Abelian vortex strings supported in four-dimensional ${\cal N}=2$ supersymmetric QCD with the U(2) gauge group and $N_f=4$ quark multiplets (flavors) become critical superstrings. In addition to the translational…
We study the origins of the five ten-dimensional ``matrix superstring'' theories, supplementing old results with new ones, and find that they all fit into a unified framework. In all cases the matrix definition of the string in the limit of…
I describe our understanding of physics near the planck length, in particular the great progress of the last four years in string theory. Superstring theory, and a recent extension called M theory, are leading candidates for a quantum…
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…
We show how to make a topological string theory starting from an $N=4$ superconformal theory. The critical dimension for this theory is $\hat c= 2$ ($c=6$). It is shown that superstrings (in both the RNS and GS formulations) and critical…
An example of a consistent theory with massive higher spin fields is constructed in flat space-time of dimension three. The action is written in the light-cone gauge. The theory has certain stringy features, e.g. its spectrum is unbounded…
Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…
This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our setting, one first specifies an SMC theory T, which may…
We consider the (one-dimensional) array counterpart of contextual as well as insertion and deletion string grammars and consider the operations of array insertion and deletion in array grammars. First we show that the emptiness problem for…
We introduce a binary embedding framework, called Proximity Preserving Code (PPC), which learns similarity and dissimilarity between data points to create a compact and affinity-preserving binary code. This code can be used to apply fast…
In this paper, we show how the notion of tree dimension can be used in the verification of constrained Horn clauses (CHCs). The dimension of a tree is a numerical measure of its branching complexity and the concept here applies to Horn…
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…