Related papers: Restricted Holant Dichotomy on Domains 3 and 4

For a restricted class of potentials (harmonic+Gaussian potentials), we express the resolvent integral for the correlation functions of simple traces of powers of complex matrices of size $N$, in term of a determinant; this determinant is…

Let $\mathbb{E}_d$ denote the little discs operad for $1 \le d \le \infty$ and let $\mathcal{C}$ be an $\infty$-category all of whose mapping spaces are $n$-truncated. We prove that when considering $\mathbb{E}_d$-monoids in $\mathcal{C}$,…

A typical way of analyzing the time complexity of functional programs is to extract a recurrence expressing the running time of the program in terms of the size of its input, and then to solve the recurrence to obtain a big-O bound. For…

We prove that the HOMFLYPT polynomial of a link, colored by partitions with a fixed number of rows is a $q$-holonomic function. Specializing to the case of knots colored by a partition with a single row, it proves the existence of an…

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

Recent advances in image and signal processing have drawn on geometric function theory, particularly coefficient estimate problems. Motivated by their significance, we introduce a class of starlike functions related to a balloon-shaped…

If $F$ and $G$ are iterated function systems, then any infinite word $W$ in the symbols $F$ and $G$ induces a limit set. It is natural to ask whether this Cantor set can also be realized as the limit set of a single $C^{1 + \alpha}$…

Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…

Let $\Omega\subset \mathbb{R}^n$ be a bounded domain that can be written as $\Omega=\bigcup_{t} \Omega_t$, where $\{\Omega_t\}_{t\in\Gamma}$ is a countable collection of domains with certain properties. In this work, we develop a technique…

This paper presents an algorithm for generating all imaginary and unusual discriminants up to a fixed degree bound that define a quadratic function field of positive 3-rank. Our method makes use of function field adaptations of a method due…

In this note, we characterize the limiting functions in mod-Gausssian convergence; our approach sheds a new light on the nature of mod-Gaussian convergence as well. Our results in fact more generally apply to mod-* convergence, where *…

Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…

Homology has long been accepted as an important computable tool for quantifying complex structures. In many applications, these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study…

The theory of fractional calculus in the complex plane was not built with a specific application in mind. The main obstacle to application was the difficulty with obtaining analytic continuations of fractional derivatives and integrals. It…

We introduce \emph{Term Coding}, a novel framework for analysing extremal problems in discrete mathematics by encoding them as finite systems of \emph{term equations} (and, optionally, \emph{non-equality constraints}). In its basic form,…

We prove the real non-attractive fixed point conjecture for complex polynomial and rational harmonic functions. A harmonic function $f=h+\overline{g}$ is polynomial (rational) if both $h$ and $g$ are polynomials (rational functions) of…

Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a…

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

This paper is an annotated list of transformation properties and identities satisfied by the four theta functions $\theta _1$, $\theta _2$, $\theta _3$, $\theta _4$ of one complex variable, presented in a ready-to-use form. An attempt is…

We introduce the notion of rationality for hyperholomorphic functions (functions in the kernel of the Cauchy-Fueter operator). Following the case of one complex variable, we give three equivalent definitions: the first in terms of…