相关论文: Restricted Holant Dichotomy on Domains 3 and 4
Classes of functions of several variables on arbitrary non-empty domains that are closed under permutation of variables and addition of dummy variables are characterized in terms of generalized constraints, and hereby Hellerstein's Galois…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
Let $(f, g)$ be a pair of complex analytic functions on a singular analytic space $X$. We give ``the correct'' definition of the relative polar curve of $(f, g)$, and we give a very formal generalization of L\^e's attaching result, which…
In the Constraint Satisfaction Problem (CSP for short) the goal is to decide the existence of a homomorphism from a given relational structure $G$ to a given relational structure $H$. If the structure $H$ is fixed and $G$ is the only input,…
Coherence phenomena appear in two different situations. In the context of category theory the term `coherence constraints' refers to a set of diagrams whose commutativity implies the commutativity of a larger class of diagrams. In the…
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is…
We consider logic-based argumentation in which an argument is a pair (Fi,al), where the support Fi is a minimal consistent set of formulae taken from a given knowledge base (usually denoted by De) that entails the claim al (a formula). We…
The authors' previous results on the arity gap of functions of several variables are refined by considering polynomial functions over arbitrary fields. We explicitly describe the polynomial functions with arity gap at least 3, as well as…
We prove the curse of dimensionality in the worst case setting for numerical integration for a number of classes of smooth $d$-variate functions. Roughly speaking, we consider different bounds for the derivatives of $f \in C^k(D_d)$ and ask…
We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…
We prove a complexity dichotomy theorem for symmetric complex-weighted Boolean #CSP when the constraint graph of the input must be planar. The problems that are #P-hard over general graphs but tractable over planar graphs are precisely…
We exploit an ansatz in order to construct power series expansions for pairs of conjugate functions defined on domains of Euclidean $3$--space. Convergence properties of the resulting series are investigated. Entire solutions which are not…
The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of…
We study techniques for deciding the computational complexity of infinite-domain constraint satisfaction problems. For certain fundamental algebraic structures Delta, we prove definability dichotomy theorems of the following form: for every…
This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that…
In the present paper, we will discuss the Hankel determinants $H(f) =a_2a_4-a_3^2$ of order 2 for normalized concave functions $f(z)=z+a_2z^2+a_3z^3+\dots$ with a pole at $p\in(0,1).$ Here, a meromorphic function is called concave if it…
A unary constraint (on the Boolean domain) is a function from {0,1} to the set of real numbers. A free use of auxiliary unary constraints given besides input instances has proven to be useful in establishing a complete classification of the…
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different boundary conditions may hold on different regions. For any…
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…
In the present investigation, we consider a subclass of starlike functions associated with a petal shaped domain, recently introduced and defined by $$\mathcal{S}^{*}_{\rho}:=\{f\in \mathcal{A}:zf'(z)/f(z) \prec 1+\sinh^{-1} z\}.$$ We…