Related papers: On non-structural subtype entailment

In this paper we consider the reachability problem for bounded branching VASS. Bounded VASS are a variant of the classic VASS model where all values in all configurations are upper bounded by a fixed natural number, encoded in binary in the…

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

Nonrigid mathematical structures may no longer form usual Eilenberg - Mac Lane categories, but more general ones, as illustrated by pseudo-topologies. A rather general concept of pseudo-topology was used in constructing differential…

The entailment between separation logic formulae with inductive predicates, also known as symbolic heaps, has been shown to be decidable for a large class of inductive definitions. Recently, a 2-EXPTIME algorithm was proposed and an…

Session types, types for structuring communication between endpoints in distributed systems, are recently being integrated into mainstream programming languages. In practice, a very important notion for dealing with such types is that of…

We study groups of reversible cellular automata, or CA groups, on groups. More generally, we consider automorphism groups of subshifts of finite type on groups. It is known that word problems of CA groups on virtually nilpotent groups are…

The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…

In this paper we continue an earlier study of ends non-compact manifolds. The over-arching goal is to investigate and obtain generalizations of Siebenmann's famous collaring theorem that may be applied to manifolds having non-stable…

Recent studies have examined the computational complexity of computing Shapley additive explanations (also known as SHAP) across various models and distributions, revealing their tractability or intractability in different settings.…

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following…

In this paper we study the existence of solutions to an isotropic differential inclusion.

Semidefinite programs (SDPs) are standard convex problems that are frequently found in control and optimization applications. Interior-point methods can solve SDPs in polynomial time up to arbitrary accuracy, but scale poorly as the size of…

Let $X$ be a normal noetherian scheme and $Z \subseteq X$ a closed subset of codimension $\geq 2$. We consider here the local obstructions to the map $\hat{\pi}_{1}(X\backslash Z) \to \hat{\pi}_{1}(X)$ being an isomorphism. Assuming $X$ has…

In this work, we show that several problems naturally represented as Nonlinear Absolute Value Equations (NAVE) can be reformulated as Nonlinear Complementarity Problems (NCP) and efficiently solved using smoothing regularization techniques…

Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…

The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in programming languages. The soundness and the completeness, together referred to as the…

A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…

Constraint satisfaction problems (CSPs) are a natural class of decision problems where one must decide whether there is an assignment to variables that satisfies a given formula. Schaefer's dichotomy theorem, and its extension to all…

In the space of sextic forms in 4 variables with a decomposition of length 18 we determine and describe a closed subvariety which contains all non-identifiable sextics. The description of the subvariety is geometric, but one can derive from…

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…