Related papers: Coalgebraic Path Constraints
Due to their flexibility, frames of Hilbert spaces are attractive alternatives to bases in approximation schemes for problems where identifying a basis is not straightforward or even feasible. Computing a best approximation using frames,…
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…
In this work, a new class of vector-valued phase field models is presented, where the values of the phase parameters are constrained by a convex set. The generated phase fields feature the partition of the domain into patches of distinct…
Electromagnetic modeling provides an interesting context to present a link between physical phenomena and homology and cohomology theories. Over the past twenty-five years, a considerable effort has been invested by the computational…
On the basis of the canonical quantization procedure of a system defined on a cubic lattice, we propose a new method, in which resolutions of unity expressed in terms of eigenvectors are naturally provided, to find eigenvectors of field…
The approximate graph colouring problem, whose complexity is unresolved in most cases, concerns finding a $c$-colouring of a graph that is promised to be $k$-colourable, where $c\geq k$. This problem naturally generalises to promise graph…
We perform a canonical analysis of the bimetric theory in the metric formulation, computing the constraints and their algebra explicitly. In particular, we compute a secondary constraint, that has been argued to exist earlier, and show that…
What makes a computational problem easy (e.g., in P, that is, solvable in polynomial time) or hard (e.g., NP-hard)? This fundamental question now has a satisfactory answer for a quite broad class of computational problems, so called…
In many safety-critical settings, probabilistic ML systems have to make predictions subject to algebraic constraints, e.g., predicting the most likely trajectory that does not cross obstacles. These real-world constraints are rarely convex,…
The general self-adjoint elliptic boundary value problems are considered in a domain $G\subset \Bbb R^{n+1}$ with finitely many cylindrical ends. The coefficients are stabilizing (as $x\to\infty$, $x\in G$) so slowly that we can only…
Associating graph algebras to directed graphs leads to both covariant and contravariant functors from suitable categories of graphs to the category k-Alg of algebras and algebra homomorphisms. As both functors are often used at the same…
Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…
In many combinatorial problems one may need to model the diversity or similarity of assignments in a solution. For example, one may wish to maximise or minimise the number of distinct values in a solution. To formulate problems of this…
Several recent unsupervised learning methods use probabilistic approaches to solve combinatorial optimization (CO) problems based on the assumption of statistically independent solution variables. We demonstrate that this assumption imposes…
We present a functional programming language for specifying constraints over tree-shaped data. The language allows for Haskell-like algebraic data types and pattern matching. Our constraint compiler CO4 translates these programs into…
We study some homological invariants of a given generalized bound path algebra in terms of those of the algebras used in its construction. We discuss the particular case where the algebra is a generalized path algebra and give conditions…
We calculate relations on characteristic classes which are obstructions preventing closed K\"ahler manifolds from carrying holomorphic Cartan geometries. We apply these relations to give global constraints on the phase spaces of complex…
A significant group of problems coming from the realm of Combinatorial Geometry can only be approached through the use of Algebraic Topology. From the first such application to Kneser's problem in 1978 by Lov% \'{a}sz \cite{Lovasz} through…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
Motivated by the necessity to find exact solutions with the elliptic Weierstrass function of the Einstein's equations (see gr-qc/0105022),the present paper develops further the proposed approach in hep-th/0107231, concerning the s.c. cubic…