Related papers: The complexity of quantified constraints using the…
The classifications of temporal and phylogeny constraint languages stand among the most seminal complexity classifications within infinite-domain Constraint Satisfaction Problems (CSPs), yet remain the most mysterious in terms of algorithms…
A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…
The logic MMSNP is a restricted fragment of existential second-order logic which allows to express many interesting queries in graph theory and finite model theory. The logic was introduced by Feder and Vardi who showed that every MMSNP…
In [1] we initiated an approach towards quantizing the Hamiltonian constraint in Loop Quantum Gravity (LQG) by requiring that it generates an anomaly-free representation of constraint algebra off-shell. We investigated this issue in the…
We produce a class of $\omega$-categorical structures with finite signature by applying a model-theoretic construction -- a refinement of the Hrushosvki-encoding -- to $\omega$-categorical structures in a possibly infinite signature. We…
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable if the model-complete core of the template…
If \A is a complex hyperplane arrangement, with complement X, we show that the Chen ranks of G=\pi_1(X) are equal to the graded Betti numbers of the linear strand in a minimal, free resolution of the cohomology ring A=H^*(X,\k), viewed as a…
We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the…
For any quartic number field $K$ generated by a root $\alpha$ of an irreducible trinomial of type $x^4+ax^2+b\in Z[x]$, we characterize when $Z[\alpha]$ is integrally closed. Also for $p=2,3$, we explicitly give the highest power of $p$…
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e.,…
Given a fixed constraint language $\Gamma$, the conservative CSP over $\Gamma$ (denoted by c-CSP($\Gamma$)) is a variant of CSP($\Gamma$) where the domain of each variable can be restricted arbitrarily. A dichotomy is known for conservative…
Recall that a triangular Hopf algebra A is said to have the Chevalley property if the tensor product of any two simple A-modules is semisimple, or, equivalently, if the radical of A is a Hopf ideal. There are two reasons to study this class…
The Jacobian Conjecture uses the equation $det(Jac(F))\in k^*$, which is a very short way to write down many equations putting restrictions on the coefficients of a polynomial map $F$. In characteristic $p$ these equations do not suffice to…
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…
We consider the embedding theory, the approach to gravity proposed by Regge and Teitelboim, in which 4D space-time is treated as a surface in high-dimensional flat ambient space. In its general form, which does not contain artificially…
This work introduces a probabilistic-based model for binary CSP that provides a fine grained analysis of its internal structure. Assuming that a domain modification could occur in the CSP, it shows how to express, in a predictive way, the…
A fundamental problem in the theory of Hopf algebras is the classification and explicit construction of finite-dimensional quasitriangular Hopf algebras over C. These Hopf algebras constitute a very important class of Hopf algebras,…
Let $G$ be a connected reductive group over a perfect field $k$ acting on an algebraic variety $X$ and let $P$ be a minimal parabolic subgroup of $G$. For $k$-spherical $G$-varieties we prove finiteness result for $P$-orbits that contain…
The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of…
We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths and constants. This problem is known to be in EXPSPACE and…