Related papers: A complete dichotomy for complex-valued Holant^c
The reliability of a Boolean Conjunctive Query (CQ) over a tuple-independent probabilistic database is the probability that the CQ is satisfied when the tuples of the database are sampled one by one, independently, with their associated…
It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…
Immanants are polynomial functions of n by n matrices attached to irreducible characters of the symmetric group S_n, or equivalently to Young diagrams of size n. Immanants include determinants and permanents as extreme cases. Valiant proved…
Homomorphisms between relational structures are not only fundamental mathematical objects, but are also of great importance in an applied computational context. Indeed, constraint satisfaction problems (CSPs), a wide class of algorithmic…
The problem of finding superintegrable Hamiltonians and their integrals of motion can be reduced to solving a series of compatibility equations that result from the overdetermination of the commutator or Poisson bracket relations. The…
It is shown that the 3-body trigonometric G_2 integrable system is exactly-solvable. If the configuration space is parametrized by certain symmetric functions of the coordinates then, for arbitrary values of the coupling constants, the…
In this paper, we are concerned with the bicomplex analog of the well-known result asserting that real-valued harmonic functions, on simply connected domains, are the real parts of holomorphic functions. We show that this assertion, word…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from…
Estimating the coefficient functionals on various classes of holomorphic functions traditionally forms an important field of geometric complex analysis and its mathematical and physical applications. These coefficients reflect fundamental…
Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which…
Solutions to Laplace's equation are called harmonic functions. Harmonic functions arise in many applications, such as physics and the theory of stochastic processes. Of interest classically are harmonic polynomials, which have a simple…
Counting the number of answers to conjunctive queries is a fundamental problem in databases that, under standard assumptions, does not have an efficient solution. The issue is inherently #P-hard, extending even to classes of acyclic…
We present several families of total boolean functions which have exact quantum query complexity which is a constant multiple (between 1/2 and 2/3) of their classical query complexity, and show that optimal quantum algorithms for these…
In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate…
Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular…
We construct holomorphic families of proper holomorphic embeddings of $\C^k$ into $\C^n$ ($0<k<n-1$), so that for any two different parameters in the family no holomorphic automorphism of $\C^n$ can map the image of the corresponding two…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
In this study, a geometric version of an NP-hard problem ("Almost $2-SAT$" problem) is introduced which has potential applications in clustering, separation axis, binary sensor networks, shape separation, image processing, etc. Furthermore,…