Related papers: The Green--Schwarz Superstring in Extended Configu…
We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…
The superstring is quantized in a manner which manifestly preserves a U(5) subgroup of the (Wick-rotated) ten-dimensional super-Poincar\'e invariance. This description of the superstring contains critical N=2 worldsheet superconformal…
Combinatorial problems stated as Constraint Satisfaction Problems (CSP) are examined. It is shown by example that any algorithm designed for the original CSP, and involving the AllDifferent constraint, has at least the same level of…
Maximal green sequences are important objects in representation theory, cluster algebras, and string theory. The two fundamental questions about maximal green sequences are whether a given algebra admits such sequences and, if so, does it…
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…
We show that with every classical system possessing first class constraints that form a natural Lie algebra, we can associate a superalgebra that admits the constraint Lie algebra as a subalgebra. An odd generator of this superalgebra that…
This paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a…
We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…
In a previous paper, "Generalized Green functions and unipotent classes for finite reductive groups, I", we have determined certain unknown scalars involved in the algorithm of computing generalized Green functions in the case of SL_n. In…
We give an introduction to a new approach to the covariant quantization of superstrings. After a brief review of the classical Green--Schwarz superstring and Berkovits' approach to its quantization based on pure spinors, we discuss our…
We show that the pointlike and the idempotent pointlike problems are reducible with respect to natural signatures in the following cases: the pseudovariety of all finite semigroups in which the order of every subgroup is a product of…
1. Preliminaries. 2. Heterotic string and motivations for large volume compactifications; 2.1 Gauge coupling unification; 2.2 Supersymmetry breaking by compactification. 3. M-theory on S^1/Z_2 \times Calabi-Yau. 4. Type I/I' string theory…
The action for a Galilean superstring is found from a non-relativistic limit of the closed Green-Schwarz (GS) superstring; it has zero tension and provides an example of a massless super-Galilean system A Wess-Zumino term leads to a…
Higher-derivative terms in the string and M-theory effective actions are strongly constrained by supersymmetry. Using a mixture of techniques, involving both string amplitude calculations and an analysis of supersymmetry requirements, we…
A possible definition of strong/symmetric hyperbolicity for a second-order system of evolution equations is that it admits a reduction to first order which is strongly/symmetric hyperbolic. We investigate the general system that admits a…
For systems which contain both superselection structure and constraints, we study compatibility between constraining and superselection. Specifically, we start with a generalisation of Doplicher-Roberts superselection theory to the case of…
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem…
For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…
We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. A la Fazeli et al. (2015), we made use of automorphism to significantly reduce the number of variables in the associated linear programming problem.…
At the component-level we study the `beta-function-favored constraint' (bffc) formalism, suggested in 1988 as the most natural formulation for supergravity derived from more fundamental theories. We begin with the suggestion that \bffc…