Related papers: Universality Problem for Unambiguous VASS
In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming…
It is shown that for a wide class of analytic Lagrangians which depend only on the scalar curvature of a metric and a connection, the application of the so--called ``Palatini formalism'', i.e., treating the metric and the connection as…
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical…
Let $\mathcal{X} \subset \mathbb{P}_k^d$ be Drinfeld's halfspace over a finite field $k$ and let $\mathcal{E}$ be a homogeneous vector bundle on $\mathbb{P}_k^d$. The paper deals with two different descriptions of the space of global…
In this paper, we study the construction of the supersymmetric extensions of vertex algebras. In particular, for $N = n \in \mathbb{Z}_{+}$, we show the universal enveloping $N = n$ supersymmetric (SUSY) vertex algebra of an $N = n$ SUSY…
We construct a universal space for the class of proper metric spaces of bounded geometry and of given asymptotic dimension. As a consequence of this result, we establish coincidence of the asymptotic dimension with the asymptotic inductive…
We consider a general class of decision problems concerning formal languages, called ``(one-dimensional) unboundedness predicates'', for automata that feature reversal-bounded counters (RBCA). We show that each problem in this class reduces…
We analyse the complexity of the satisfiability problem ssmSAT for State Space Models (SSM), which asks whether an input sequence can lead the model to an accepting configuration. We find that ssmSAT is undecidable in general, reflecting…
We consider the quantifier-free languages, Bc and Bc0, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected…
We investigate partial Equality and Word Problems for finitely generated groups. After introducing Upper Banach (UB) density on free groups, we prove that solvability of the Equality Problem on squares of UB-generic sets implies solvability…
High-dimensional representations for words, text, images, knowledge graphs and other structured data are commonly used in different paradigms of machine learning and data mining. These representations have different degrees of…
Ambiguity is ubiquitous in natural language. Resolving ambiguous meanings is especially important in information retrieval tasks. While word embeddings carry semantic information, they fail to handle ambiguity well. Transformer models have…
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…
Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…
It is well-known that the canonical commutation relation $[x,p]=i$ can be realized only on an infinite-dimensional Hilbert space. While any finite set of experimental data can also be explained in terms of a finite-dimensional Hilbert space…
The Quantified Constraint Satisfaction Problem is the problem of evaluating a sentence with both quantifiers, over relations from some constraint language, with conjunction as the only connective. We show that for any constraint language on…
A new criterion for inextendibility of expanding cosmological models with symmetry is presented. It is applied to derive a number of new results and to simplify the proofs of existing ones. In particular it shows that the solutions of the…
Global N=2 supersymmetry in four dimensions with a gauged central charge is formulated in superspace. To find an irreducible representation of supersymmetry for the gauge connections a set of constraints is given. Then the Bianchi…
Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…
We continue the work of [1, 2, 3] by analyzing the equivalence relation of bi-embeddability on various classes of countable planes, most notably the class of countable non-Desarguesian projective planes. We use constructions of the second…