Related papers: On String Contact Representations in 3D
In grammar-based compression a string is represented by a context-free grammar, also called a straight-line program (SLP), that generates only that string. We refine a recent balancing result stating that one can transform an SLP of size…
We consider a string theory with two types of strings with geometric interaction. We show that the theory contains strings with constant Dirichlet boundary condition and those strings are glued together by 2-d topological gravity with…
We propose a worldline formulation of higher-spin gravity (HSG) in $\mathrm{AdS}_4$, based on a simple twistor action. Taken at face value, the model describes only the free propagation of massless higher-spin fields. The central…
The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch…
We study contact representations for graphs, which we call pixel representations in 2D and voxel representations in 3D. Our representations are based on the unit square grid whose cells we call pixels in 2D and voxels in 3D. Two pixels are…
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed…
An axis parallel $d$-dimensional box is the Cartesian product $R_1 \times R_2 \times ... \times R_d$ where each $R_i$ is a closed interval on the real line. The {\it boxicity} of a graph $G$, denoted as $\boxi(G)$, is the minimum integer…
We consider the sum of planar diagrams for open strings propagating on N D3-branes and show that it can be recast as the propagation of a closed string with a Hamiltonian H = H_0 - g_s N P where H_0 is the free Hamiltonian and P is the hole…
Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a…
A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the outer face have triangular shape. Such a drawing can be viewed as a tiling of a triangle using triangles with…
A graph $G=(V,E)$ is representable if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\in E$ for each $x\neq y$. If $W$ is $k$-uniform (each letter of $W$ occurs exactly $k$…
Let $L$ be a sequence $(\ell_1,\ell_2,\ldots,\ell_n)$ of $n$ lines in $\mathbb{C}^3$. We define the {\it intersection graph} $G_L=([n],E)$ of $L$, where $[n]:=\{1,\ldots, n\}$, and with $\{i,j\}\in E$ if and only if $i\neq j$ and the…
Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin \& Gon{\c{c}}alves, 2009), \textsc{L}-shapes (Gon{\c{c}}alves et al, 2018).…
String matching is the problem of deciding whether a given $n$-bit string contains a given $k$-bit pattern. We study the complexity of this problem in three settings. Communication complexity. For small $k$, we provide near-optimal upper…
In this thesis, two aspects of string theory are discussed, tensionless strings and supersymmetric sigma models. The equivalent to a massless particle in string theory is a tensionless string. Even almost 30 years after it was first…
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two…
An axis-parallel $d$--dimensional box is a Cartesian product $R_1 \times R_2 \times ... \times R_d$ where $R_i$ (for $1 \le i \le d$) is a closed interval of the form $[a_i, b_i]$ on the real line. For a graph $G$, its \emph{boxicity}…
We construct a new model of four-dimensional relativistic strings with integrable dynamics on the worldsheet. In addition to translational modes this model contains a single massless pseudoscalar worldsheet field - the worldsheet axion. The…
Tensionless string theory on AdS3 x S3 x T4, as captured by a free symmetric product orbifold, has a large set of conserved currents which can be usefully organised in terms of representations of a N=(4,4) supersymmetric higher spin…
We model the (holographic) QCD Pomeron as a long and stretched (fixed impact parameter) transverse quantum string in flat $D_\perp=3$ dimensions. After discretizing the string in $N$ string bits, we analyze its length, mass and spatial…