Related papers: Coherence of string rewriting systems by decreasin…
The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences…
The vector field of a mixed-monotone system is decomposable via a decomposition function into increasing (cooperative) and decreasing (competitive) components, and this decomposition allows for, e.g., efficient computation of reachable sets…
With respect to earlier investigations, the theory of multi-component, concentric, copolar, axisymmetric, rigidly rotating polytropes is improved and extended, including subsystems with nonzero density on the boundary and subsystems with…
Graphs are a powerful tool for analyzing large data sets, but many real-world phenomena involve interactions that go beyond the simple pairwise relationships captured by a graph. In this paper we introduce and study a simple combinatorial…
The theory of almost characters which is closely related to character sheaves is proposed by Lusztig to study the representation theory of finite reductive groups. In this article we show that the decomposition of the Weil character for…
In this thesis we study string compactifications on manifolds equipped with a $G$-structure, placing a special emphasis on the interplay between geometry and physics. We follow two complementary approaches. In the first part of the thesis…
A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods…
In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…
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…
Experimental mechanisms that yield the growth of homochiral copolymers over their heterochiral counterparts have been advocated by Lahav and co-workers. These chiral amplification mechanisms proceed through racemic {\beta}-sheet-controlled…
We introduce an intuitive algorithmic methodology for enacting automated rewriting of string diagrams within a general double-pushout (DPO) framework, in which the sequence of rewrites is chosen in accordance with the causal structure of…
We propose a two-dimensional superstring sigma model that defines a self-contained corner of heterotic string theory, whose second quantization is heterotic matrix string theory. This worldsheet theory arises from a BPS decoupling limit…
In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of…
Using intersection theory in the context of Hilbert manifolds and geometric homology we show how to recover the main operations of string topology built by M. Chas and D. Sullivan. We also study and build an action of the homology of…
This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically…
Towards better understanding of gate elimination, the only method known that can prove complexity lower bounds for explicit functions against unrestricted Boolean circuits, this work contributes: (1) formalizing circuit simplifications as a…
Motivated by polymer-based data-storage platforms that use chains of binary synthetic polymers as the recording media and read the content via tandem mass spectrometers, we propose a new family of codes that allows for unique string…
Motivated by an application where we try to make proofs for Description Logic inferences smaller by rewriting, we consider the following decision problem, which we call the small term reachability problem: given a term rewriting system $R$,…
The target space theory of the N=(2,1) heterotic string may be interpreted as a theory of gravity coupled to matter in either $1+1$ or $2+1$ dimensions. Among the target space theories in $1+1$ dimensions are the bosonic, type II, and…
The possible tensor constructions of open string theories are analyzed from first principles. To this end the algebraic framework of open string field theory is clarified, including the role of the homotopy associative A_\infty algebra, the…