Related papers: Absorbing Subalgebras, Cyclic Terms, and the Const…
The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements. Here a characteristic subset is a set that when containing an element contains all elements that have…
Reduction of combinatorial filters involves compressing state representations that robots use. Such optimization arises in automating the construction of minimalist robots. But exact combinatorial filter reduction is an NP-complete problem…
A temporal constraint language is a set of relations that are first-order definable over (Q;<). We show that several temporal constraint languages whose constraint satisfaction problem is maximally tractable are also maximally tractable for…
We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
We categorify cocompleteness results of monad theory, in the context of pseudomonads. We first prove a general result establishing that, in any 2-category, weighted bicolimits can be constructed from oplax bicolimits and bicoequalizers of…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern…
In an earlier paper, we considered several restriction problems in the representation theory of classical groups over local and global fields. Assuming the Langlands-Vogan parameterization of irreducible representations, we formulated…
We show the NP-completeness of the existential theory of term algebras with the Knuth-Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth-Bendix ordering constraints.
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…
The model checking problem for various fragments of first-order logic has attracted much attention over the last two decades: in particular, for the primitive positive and the positive Horn fragments, which are better known as the…
It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single finite algebra, or equivalently, the quasiequational and universal theories of their free algebras on countably infinitely many generators, may…
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model…
In the previous work, we study the moment polytope of the closure of the complex subtorus orbit in a symplectic toric manifold associated to an affine subspace when the closure is a smooth complex submanifold. In this paper, we clarify the…
In the framework of the generalized Hamiltonian formalism by Dirac, the local symmetries of dynamical systems with first- and second-class constraints are investigated. For theories with an algebra of constraints of special form (to which a…
The classification of one parameter local Coulomb branch solution of theories with eight supercharges is given by assuming that it is given by a genus $g$ fiberation of Riemann surfaces. The crucial point is the fact that certain conjugacy…
We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1)…
Conformal algebras, recently introduced by Kac, encode an axiomatic description of the singular part of the operator product expansion in conformal field theory. The objective of this paper is to develop the theory of ``multi-dimensional''…
Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…