Related papers: Capturing the polynomial hierarchy by second-order…

We determine the complexity of second-order HyperLTL satisfiability, finite-state satisfiability, and model-checking: All three are equivalent to truth in third-order arithmetic. We also consider two fragments of second-order HyperLTL that…

In this paper, we investigate certain graded-commutative rings which are related to the reciprocal plane compactification of the coordinate ring of a complement of a hyperplane arrangement. We give a presentation of these rings by…

The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…

For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known…

We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…

This paper analyzes the correctness of the subsumption algorithm used in CLASSIC, a description logic-based knowledge representation system that is being used in practical applications. In order to deal efficiently with individuals in…

Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting logical properties. Indeed, the model-checking problem for…

This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability…

Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While researchers have identified many uses of spatial conjunction, its…

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width…

We introduce a new logic, called \emph{cluster first-order logic}, a restricted fragment of first-order logic specifically designed to study order invariance. An order-invariant formula is one on a vocabulary that contains an order;…

We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…

For every imprimitive complex reflection group of rank 2, we construct a semi-orthogonal decomposition of the derived category of the associated global quotient stack which categorifies the usual decomposition of the orbifold cohomology…

We describe an explicit semi-algebraic partition for the complement of a real hyperplane arrangement such that each piece is contractible and so that the pieces form a basis of Borel-Moore homology. We also give an explicit correspondence…

Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…

In this paper, we mainly build up the theory of sheaf-correspondence filtered spaces and stratified de Rham complexes for studying singular spaces. We prove the finiteness of a stratified de Rham cohomology and obtain its isomorphism to…

We give two results concerning the power of the Sum-of-Squares(SoS)/Lasserre hierarchy. For binary polynomial optimization problems of degree $2d$ and an odd number of variables $n$, we prove that $\frac{n+2d-1}{2}$ levels of the…

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…

We study algorithmic problems that belong to the complexity class of the existential theory of the reals (ER). A problem is ER-complete if it is as hard as the problem ETR and if it can be written as an ETR formula. Traditionally, these…