Related papers: Restricted Holant Dichotomy on Domains 3 and 4

To convert a fractional solution to an instance of a constraint satisfaction problem into a solution, a rounding scheme is needed, which can be described by a collection of symmetric operations with one of each arity. An intriguing…

We study the complexity of various fundamental counting problems that arise in the context of incomplete databases, i.e., relational databases that can contain unknown values in the form of labeled nulls. Specifically, we assume that the…

By a theorem of R. Stanley, a graded Cohen-Macaulay domain $A$ is Gorenstein if and only if its Hilbert series satisfies the functional equation \[ \operatorname{Hilb}_A(t^{-1})=(-1)^d t^{-a}\operatorname{Hilb}_A(t), \] where $d$ is the…

In this current study, we consider the classes $\mathcal{S}^{*}_{e}$ and $\mathcal{C}_e$ to obtain sharp bounds for the third Hankel determinant for functions within these classes. Additionally, we provide estimates for the sixth and…

We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…

We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…

Let $\mathcal{A}$ denote the class of analytic functions such that $f(0)=0$ and $f'(0)=1$ in the unit disk $\mathbb{D}:=\{z \in \mathbb{C}: |z|<1\}.$ In this paper, we consider $\mathcal{S}^*(\varphi) := \left\{ f \in \mathcal{A} :…

We present theoretical and practical results on the order theory of lattices of functions, focusing on Galois connections that abstract (sets of) functions - a topic known as higher-order abstract interpretation. We are motivated by the…

Denote the coefficients in the complex form of the Fourier series of a function $f$ on the interval $[-\pi, \pi)$ by $\hat f(n)$. It is known that if $p = 2j/(2j-1)$ for some integer $j>0$, then for each function $f$ in $L^p$ there exists…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

Motivated by applications in automated verification of higher-order functional programs, we develop a notion of constrained Horn clauses in higher-order logic and a decision problem concerning their satisfiability. We show that, although…

We give a domain-theoretic semantics to a statistical programming language, using the plain old category of dcpos, in contrast to some more sophisticated recent proposals. Remarkably, our monad of minimal valuations is commutative, which…

We study the arity gap of functions of several variables defined on an arbitrary set A and valued in another set B. The arity gap of such a function is the minimum decrease in the number of essential variables when variables are identified.…

Here we follow the basic analysis that is common for real and complex variables and find how it can be applied to a quaternionic variable. Non-commutativity of the quaternion algebra poses obstacles for the usual manipulations; but we show…

Let $f$ be a polynomial with integer coefficients whose degree is at least 2. We consider the problem of covering the orbit $\operatorname{Orb}_f(t)=\{t,f(t),f(f(t)),\cdots\}$, where $t$ is an integer, using arithmetic progressions each of…

Two groups of naturally arising questions in the mathematical theory of domains for denotational semantics are addressed. Domains are equipped with Scott topology and represent data types. Scott continuous functions represent computable…

We present dichotomy theorems regarding the computational complexity of counting fixed points in boolean (discrete) dynamical systems, i.e., finite discrete dynamical systems over the domain {0,1}. For a class F of boolean functions and a…

A standard informal method for analyzing the asymptotic complexity of a program is to extract a recurrence that describes its cost in terms of the size of its input, and then to compute a closed-form upper bound on that recurrence. We give…

This study introduces a procedure to obtain general expressions, $y = f(x)$, subject to linear constraints on the function and its derivatives defined at specified values. These constrained expressions can be used describe functions with…

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…