Related papers: The Green--Schwarz Superstring in Extended Configu…
Optimization under structural constraints is typically analyzed through projection or penalty methods, obscuring the geometric mechanism by which constraints shape admissible dynamics. We propose an operator-theoretic formulation in which…
We derive the low energy effective action of the heterotic superstring in superspace. This is achieved by coupling the covariantly quantized Green-Schwarz superstring of Berkovits to a curved background and requiring that the sigma model…
We discuss the problem of non abelian constrained systems and the origin of appearance of non abelian algebras. We show that it is possible, in principle, to change a non abelian system to an abelian one, at least locally. Our method is…
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…
A new generalization of the vector Schwinger model is considered where gauge symmetry is broken at the quantum mechanical level. By proper extension of the phase space this broken symmetry has been restored. Also an equivalent first class…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed…
Relation between semiclassical analyses of Green-Schwarz and pure spinor formalisms in an AdS_5 x S^5 background is clarified. It is shown that the two formalisms have identical semiclassical partition functions for a simple family of…
We demonstrate the equivalence between the worldsheet one-loop partition functions computed near classical string solutions in the Green-Schwarz and in the pure-spinor formulations of superstrings in AdS(5) x S(5). While their bosonic…
Compactified string theories give rise to discrete symmetries which are essential if they are to provide a realistic low energy theory. We find that in a class of four dimensional string theories these symmetries are constrained by similar…
The general procedure of constructing a consistent covariant Dirac-type bracket for models with mixed first and second class constraints is presented. The proposed scheme essentially relies upon explicit separation of the initial…
The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…
We consider classical strings propagating in a background generated by a sequence of TsT transformations. We describe a general procedure to derive the Green-Schwarz action for strings. We show that the U(1) isometry variables of the…
This paper explores the computational complexity of various natural one-variable fragments of first-order modal logics with the addition of counting quantifiers, over both constant and varying domains. The addition of counting quantifiers…
We derive the ten-dimensional effective action of the strongly coupled heterotic string as the low energy limit of M-theory on S^1/Z_2. In contrast to a conventional dimensional reduction, it is necessary to integrate out nontrivial heavy…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
We show that the conditional independence (CI) implication problem with bounded cardinalities, which asks whether a given CI implication holds for all discrete random variables with given cardinalities, is co-NEXPTIME-hard. The problem…
Let $k$ be a nonperfect separably closed field. Let $G$ be a (possibly non-connected) reductive group defined over $k$. We study rationality problems for Serre's notion of complete reducibility of subgroups of $G$. In our previous work, we…
We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…
Supersymmetry can be consistently generalized in one and two dimensional spaces, fractional supersymmetry being one of the possible extension. 2D fractional supersymmetry of arbitrary order $F$ is explicitly constructed using an adapted…