Related papers: Galois correspondence for counting quantifiers

The cloning of quantum variables with continuous spectra is investigated. We define a Gaussian 1-to-2 cloning machine, which copies equally well two conjugate variables such as position and momentum or the two quadrature components of a…

Generalizing the $\omega$-categorical context, we introduce a notion, which we call the Lascar Property, that allows for a fine analysis of the topological isomorphisms between automorphism groups of countable structures satisfying this…

We study Galois descent of K_1 of group algebras with coefficients in certain subrings of the ring of integers of C_p, the completion of an algebraic closure of Q_p.

In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so as to…

We prove a Galois-type correspondence between compositions of purely inseparable field extensions (including infinite ones) and subalgebras of differential operators. This correspondence can be utilized to establish a connection between…

In this paper we study the complexity of counting Constraint Satisfaction Problems (CSPs) of the form #CSP($\mathcal{C}$,-), in which the goal is, given a relational structure $\mathbf{A}$ from a class $\mathcal{C}$ of structures and an…

We give a detailed proof of Kolchin's results on differential Galois groups of strongly normal extensions, in the case where the field of constants is not necessarily algebraically closed. We closely follow former works due to Pillay and…

We define a quantitative constraint language subsuming two calculi well-known in QSR (Qualitative Spatial Reasoning): Frank's cone-shaped and projection-based calculi of cardinal direction relations. We show how to solve a CSP (Constraint…

A connected reductive group G over a field k may be written as a quotient H/S, where the k-group H is an extension of a quasitrivial torus by a simply connected semisimple group, and S is a flasque k-torus, central in H (a flasque torus is…

Given a fixed arity $k \geq 2$, Min-$k$-CSP on complete instances involves a set of $n$ variables $V$ and one nontrivial constraint for every $k$-subset of variables (so there are $\binom{n}{k}$ constraints). The goal is to find an…

This paper investigates the reconfiguration variant of the Constraint Satisfaction Problem (CSP), referred to as the Reconfiguration CSP (RCSP). Given a CSP instance and two of its solutions, RCSP asks whether one solution can be…

This paper studies complete $k$-Constraint Satisfaction Problems (CSPs), where an $n$-variable instance has exactly one nontrivial constraint for each subset of $k$ variables, i.e., it has $\binom{n}{k}$ constraints. A recent work started a…

Practically and intrinsically, inclusions of operator algebras are of fundamental interest. The subject of this paper is intermediate operator algebras of inclusions. There are two previously known theorems which naturally and completely…

Max-k-Cut and correlation clustering are fundamental graph partitioning problems. For a graph with G=(V,E) with n vertices, the methods with the best approximation guarantees for Max-k-Cut and the Max-Agree variant of correlation clustering…

We investigate the impact of modifying the constraining relations of a Constraint Satisfaction Problem (CSP) instance, with a fixed template, on the set of solutions of the instance. More precisely we investigate sensitive instances: an…

We propose a new approximate method for counting the number of the solutions for constraint satisfaction problem (CSP). The method derives from the partition function based on introducing the free energy and capturing the relationship of…

A $\mu$-constrained Boolean Max-CSP$(\psi)$ instance is a Boolean Max-CSP instance on predicate $\psi:\{0,1\}^r \to \{0,1\}$ where the objective is to find a labeling of relative weight exactly $\mu$ that maximizes the fraction of satisfied…

We study the complexity of infinite-domain constraint satisfaction problems: our basic setting is that a complexity classification for the CSPs of first-order expansions of a structure $\mathfrak A$ can be transferred to a classification of…

We study the Capacitated k-Median problem for which existing constant-factor approximation algorithms are all pseudo-approximations that violate either the capacities or the upper bound k on the number of open facilities. Using the natural…

In previous work, the authors constructed and studied a lift of the Galois correspondence to stable homotopy categories. In particular, if $L/k$ is a finite Galois extension of fields with Galois group $G$, there is a functor $c_{L/k}^*$…