Related papers: Exact Separation of Words via Trace Geometry
We present a new method for solving symbolically zero--dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures: arithmetic networks and…
We introduce a term algebra as a new formal specification language for the coordinating architectures of distributed systems consisting of a finite yet unbounded number of components. The language allows to describe infinite sets of systems…
We identify ambiguities in the available frameworks for defining quantum, classical, and total correlations as measured by discordlike quantifiers. More specifically, we determine situations for which either classical or quantum…
The element distinctness problem is the problem of determining whether the elements of a list are distinct, that is, if $x=(x_1,...,x_N)$ is a list with $N$ elements, we ask whether the elements of $x$ are distinct or not. The solution in a…
We consider a (pseudo)Riemannian manifold of arbitrary dimension. The Hamilton-Jacobi equation for geodesic Hamiltonian admits complete separation of variables for some (separable) metrics in some (separable) coordinate systems. Separable…
A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been…
Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…
Separability problem, to decide whether a given state is entangled or not, is a fundamental problem in quantum information theory. We propose a powerful and computationally simple separability criterion, which allows us to detect the…
To find consistent initial data points for a system of differential-algebraic equations, requires the identification of its missing constraints. An efficient class of structural methods exploiting a dependency graph for this task was…
Let $G$ be a nonabelian group and $n$ a natural number. We say that $G$ has a strict $n$-split decomposition if it can be partitioned as the disjoint union of an abelian subgroup $A$ and $n$ nonempty subsets $B_1, B_2, \ldots, B_n$, such…
A coalgebraic definition of finite and infinite trace semantics for probabilistic transition systems has recently been given using a certain Kleisli category. In this paper this semantics is developed using a coalgebraic method which is an…
Many variants of Optimal Transport (OT) have been developed to address its heavy computation. Among them, notably, Sliced Wasserstein (SW) is widely used for application domains by projecting the OT problem onto one-dimensional lines, and…
Using quantum maps we study the accuracy of semiclassical trace formulas. The role of chaos in improving the semiclassical accuracy, in some systems, is demonstrated quantitatively. However, our study of the standard map cautions that this…
Chinese word segmentation is a fundamental task for Chinese language processing. The granularity mismatch problem is the main cause of the errors. This paper showed that the binary tree representation can store outputs with different…
The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…
We study the problem of bounding the posterior distribution of discrete probabilistic programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in this setting: even if exact Bayesian inference is possible,…
The absolute separability problem asks for a characterization of the quantum states $\rho \in M_m\otimes M_n$ with the property that $U\rho U^\dagger$ is separable for all unitary matrices $U$. We investigate whether or not it is the case…
Given a closed subscheme $Z$ of a polarized abelian variety $(A,\ell)$ we define its vanishing threshold with respect to $\ell$ and relate it to the Seshadri constant of the ideal defining $Z.$ As a particular case, we introduce the notion…
This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…
In two earlier papers we derived congruence formats with regard to transition system specifications for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must…