Related papers: Galois correspondence for counting quantifiers

We introduce a new device in the study of abstract elementary classes (AECs): Galois Morleyization, which consists in expanding the models of the class with a relation for every Galois type of length less than a fixed cardinal $\kappa$. We…

Inclusions of operator algebras have long been studied. In particular, inclusions arising from actions of compact groups on factors were studied by Izumi-Longo-Popa and others. The correspondence between intermediate subfactors and…

We prove a query complexity lower bound for $\mathsf{QMA}$ protocols that solve approximate counting: estimating the size of a set given a membership oracle. This gives rise to an oracle $A$ such that $\mathsf{SBP}^A \not\subset…

We review recent results on dimension-robust higher order convergence rates of Quasi-Monte Carlo Petrov-Galerkin approximations for response functionals of infinite-dimensional, parametric operator equations which arise in computational…

Dependently typed languages such as Coq are used to specify and verify the full functional correctness of source programs. Type-preserving compilation can be used to preserve these specifications and proofs of correctness through…

We establish a Galois correspondence for finite quantum groupoid actions on II_1 factors and show that every finite index and finite depth subfactor is an intermediate subalgebra of a quantum groupoid crossed product. Moreover, any such a…

We study the complexity of approximately solving the weighted counting constraint satisfaction problem #CSP(F). In the conservative case, where F contains all unary functions, there is a classification known for the case in which the domain…

This paper presents an efficient parallel approximation scheme for a new class of min-max problems. The algorithm is derived from the matrix multiplicative weights update method and can be used to find near-optimal strategies for…

Let $k$ be an algebraically closed field of characteristic zero, $F$ be an algebraically closed extension of $k$ of transcendence degree one, and $G$ be the group of automorphisms over $k$ of the field $F$. The purpose of this note is to…

We propose a new algorithm for Promise Constraint Satisfaction Problems PCSPs). It is a combination of the $\textbf{C}$onstraint Basic $\textbf{L}$P relaxation and the $\textbf{A}$ffine I$\textbf{P}$ relaxation (CLAP). We give a…

Raghavendra (STOC 2008) gave an elegant and surprising result: if Khot's Unique Games Conjecture (STOC 2002) is true, then for every constraint satisfaction problem (CSP), the best approximation ratio is attained by a certain simple…

The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept…

Discrete subfactors include a particular class of infinite index subfactors and all finite index ones. A discrete subfactor is called local when it is braided and it fulfills a commutativity condition motivated by the study of inclusion of…

We obtain a Galois correspondence between the lattice of intermediate C*-discrete subalgebras intermediate to a given irreducible C*-discrete inclusion, and characterize these as targets of compatible expectations under a traciality…

We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain classes of planar graphs, and show the bound is sometimes exponentially better than previous results. We then show Boolean formula evaluation…

A nearest neighbor representation of a Boolean function is a set of positive and negative prototypes in $R^n$ such that the function has value 1 on an input iff the closest prototype is positive. For $k$-nearest neighbor representation the…

The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and practical applications. A central line of research is concerned with the identification of…

We propose in this article a framework for compilation of quantified constraint satisfaction problems (QCSP). We establish the semantics of this formalism by an interpretation to a QCSP. We specify an algorithm to compile a QCSP embedded…

Given a predicate $P: \{-1, 1\}^k \to \{-1, 1\}$, let $CSP(P)$ be the set of constraint satisfaction problems whose constraints are of the form $P$. We say that $P$ is approximable if given a nearly satisfiable instance of $CSP(P)$, there…

The Maximum Satisfiability (MaxSAT) problem is the problem of finding a truth assignment that maximizes the number of satisfied clauses of a given Boolean formula in Conjunctive Normal Form (CNF). Many exact solvers for MaxSAT have been…