English
Related papers

Related papers: Restricted Holant Dichotomy on Domains 3 and 4

200 papers

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…

Computational Complexity · Computer Science 2017-05-11 Shuichi Hirahara

We study Boolean functions with sparse Fourier coefficients or small spectral norm, and show their applications to the Log-rank Conjecture for XOR functions f(x\oplus y) --- a fairly large class of functions including well studied ones such…

Computational Complexity · Computer Science 2013-04-10 Hing Yin Tsang , Chung Hoi Wong , Ning Xie , Shengyu Zhang

We investigate analyticity properties of correlation functions in conformal field theories (CFT) in the Wightman formulation. The goal is to determine domain of holomorphy of permuted Wightman functions. We focus on crossing property of…

High Energy Physics - Theory · Physics 2020-08-26 Jnanadeva Maharana

In this paper, we study the (possible) solutions of the equation $\exp_{*}(f)=g$, where $g$ is a slice regular never vanishing function on a circular domain of the quaternions $\mathbb{H}$ and $\exp_{*}$ is the natural generalization of the…

Complex Variables · Mathematics 2023-10-31 Amedeo Altavilla , Chiara de Fabritiis

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Rings and Algebras · Mathematics 2025-07-01 Pim Spelier

A physically more adequate definition of a quaternionic holomorphic (H-holomorphic) function of one quaternionic variable compared to known ones and a quaternionic generalization of Cauchy-Riemann's equations are presented. At that a class…

Complex Variables · Mathematics 2024-02-14 Michael Parfenov

Assume $D$ is a finite set and $R$ is a finite set of functions from $D$ to the natural numbers. An instance of the minimum $R$-cost homomorphism problem ($MinHom_R$) is a set of variables $V$ subject to specified constraints together with…

Computational Complexity · Computer Science 2012-10-09 Rustem Takhanov

We prove that some holomorphic continuations of functions in the classes $\mathbf{an}^*$ and $\mathcal{G}$ are definable in the o-minimal structures $\mathbb{R}_{\mathrm{an}^*}$ and $\mathbb{R}_{\mathcal{G}}$ respectively. More…

Logic · Mathematics 2025-06-19 Adele Padgett , Patrick Speissegger

We determine sufficient conditions under which certain recursively defined functions are well defined for all real inputs. Given a function $f:\mathbb R\to\mathbb R$, call a decreasing sequence $x_1>x_2>x_3>\cdots$ "$f$-bad" if…

Logic · Mathematics 2026-02-09 Gabriel Nivasch , Lior Shiboli

We show that if R is a compact domain in the complex plane with two or more holes and an anticonformal involution onto itself (or equivalently a hyperelliptic Schottky double), then there is an operator T which has R as a spectral set, but…

Functional Analysis · Mathematics 2008-09-02 James Pickering

The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean…

Computational Complexity · Computer Science 2010-06-02 Olaf Beyersdorff , Arne Meier , Michael Thomas , Heribert Vollmer

The main purpose of this work is to characterize derivations through functional equations. This work consists of five chapters. In the first one, we summarize the most important notions and results from the theory of functional equations.…

Functional Analysis · Mathematics 2019-04-11 Eszter Gselmann

The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…

Computational Complexity · Computer Science 2020-04-15 Jin-Yi Cai , Artem Govorov

In a triangulated symmetric monoidal closed category, there are natural dualities induced by the internal Hom. Given a monoidal functor f^* between two such catgories and adjoint couples (f^*,f_*) and (f_*,f^!), we prove the necessary…

Category Theory · Mathematics 2010-04-07 Baptiste Calmès , Jens Hornbostel

In the previous three papers in this series, [WKO1]-[WKO3] (arXiv:1405.1956, arXiv:1405.1955, and to appear), Z. Dancso and I studied a certain theory of "homomorphic expansions" of "w-knotted objects", a certain class of knotted objects in…

Geometric Topology · Mathematics 2015-11-19 Dror Bar-Natan

Let H be any complex inner product space with inner product <, >. We say that f : C -->C is Hermitian positive definite on H if the matrix $$(f(<z^r,z^s>))_{r,s=1}^n \eqno(*)$$ is Hermitian positive definite for all choice of z^1,...,z^n in…

Classical Analysis and ODEs · Mathematics 2007-05-23 Allan Pinkus

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…

Complex Variables · Mathematics 2007-05-23 Marshall A. Whittlesey

For any unitary representation $\rho$ on a finite-dimensional Hilbert space \(V\) with differential \(d\rho : \mathfrak{g} \to \mathfrak{u}(V)\) for the Lie algebra $\mathfrak g$, we consider the Hamiltonian evolution \[ U_X(t) \coloneqq…

Quantum Physics · Physics 2026-03-10 Naihuan Jing , Molena Nguyen

In this article, we will consider second order uniformly elliptic operators of divergence form defined on R^n with measurable coefficients. Mainly, we will give estimates on the dimension of space of solutions that grow at most polynomially…

Analysis of PDEs · Mathematics 2016-09-07 Peter Li , Jiaping Wang

This paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a…

Logic in Computer Science · Computer Science 2007-05-23 Stefan Ratschan , Luc Jaulin