Related papers: Ranks of gauge groups and an NP-complete problem o…
I argue that questions of algorithmic decidability, computability and complexity should play a larger role in deciding the "ultimate" theoretical description of the Landscape of string vacua. More specifically, I examine the notion of the…
Consistent coupling of effective field theories with a quantum theory of gravity appears to require bounds on the the rank of the gauge group and the amount of matter. We consider landscapes of field theories subject to such to boundedness…
We show that computing the lattice programming gap of the group problems is NP-hard when the dimension is a part of input. We also obtain lower and upper bounds for the gap in terms of the cost vector and the determinant of the lattice.
We compute the rank of the fundamental group of an arbitrary connected component of the space map(X, Y) for X and Y nilpotent CW complexes with X finite. For the general component corresponding to a homotopy class f : X --> Y, we give a…
The assignment of local observables in the vacuum sector, fulfilling the standard axioms of local quantum theory, is known to determine uniquely a compact group G of gauge transformations of the first kind together with a central involutive…
Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…
The landscape of string/M theory is surveyed over a large class of type $IIB$ flux compactification vacua. We derive a simple formula for the average size of the gauge group rank on the landscape under assumptions that we clearly state. We…
We show that determining the rank of a tensor over a field has the same complexity as deciding the existential theory of that field. This implies earlier NP-hardness results by H{\aa}stad~\cite{H90}. The hardness proof also implies an…
To numerically evolve the full Einstein equations (or modifications thereof), simulations of cosmological spacetimes must rely on a particular formulation of the field equations combined with a specific gauge/frame choice. Yet truly…
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…
Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of an NP-hard problem. The number of elementary operations (quantum gates) needed to solve…
We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…
Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In previous work, the authors proved that for each graph group, the knapsack problem can be solved in $\mathsf{NP}$. Here, we determine the exact…
CANDECOMP/PARAFAC (CP) tensor factorization of incomplete data is a powerful technique for tensor completion through explicitly capturing the multilinear latent factors. The existing CP algorithms require the tensor rank to be manually…
We prove that the isomorphism type of the subrack lattice of a finite group determines the nilpotence class. We analyze the problem of estimating the orders of the group elements corresponding to the atoms of the subrack lattice. As a…
It will be argued here that the cosmological constant problem exists because of the way the vacuum is defined in quantum field theory. It has been known for some time that for QFT to be gauge invariant certain terms--such as part of the…
We obtain a new classification of the finite metacyclic group in terms of group invariants. We present an algorithm to compute these invariants, and hence to decide if two given finite metacyclic groups are isomorphic, and another algorithm…
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
We develop a unified categorical framework for gauging both continuous and finite symmetries in arbitrary spacetime dimensions. Our construction applies to geometric categories i.e. categories internal to stacks. This generalizes the…
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…