Related papers: Disjunctive form and the modal $\mu$ alternation h…
Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…
We review recent results on Integrable Discrete Geometry. It turns out that most of the known (continuous and/or discrete) integrable systems are particular symmetries of the quadrilateral lattice, a multidimensional lattice characterized…
The main goal of this paper is to find the discrete analogue of the Bianchi system in spaces of arbitrary dimesion together with its geometric interpretation. We show that the proper geometric framework of such generalization is the…
We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares…
A fundamental challenge in multiparameter persistent homology is the absence of a complete and discrete invariant. To address this issue, we propose an enhanced framework that realizes a holistic understanding of a fully commutative…
When classes of structures are not first-order definable, we might still try to find a nice description. There are two common ways for doing this. One is to expand the language, leading to notions of pseudo-elementary classes, and the other…
We present a non-deterministic semantic framework for all modal logics in the modal cube, extending prior works by Kearns and others. Our approach introduces modular and uniform multi-valued non-deterministic matrices (Nmatrices) for each…
Datalog+/- is a Datalog-based language family enhanced with existential quantification in rule heads, equalities and negative constraints. Query answering over databases with respect to a Datalog+/- theory is generally undecidable, however…
Comparing the bounded derived categories of an algebra and of the endomorphism algebra of a given support {\tau}-tilting module, we find a relation between the derived dimensions of an algebra and of the endomorphism algebra of a given…
This paper addresses the problem of representing the set of repairs of a possibly inconsistent database by means of a disjunctive database. Specifically, the class of denial constraints is considered. We show that, given a database and a…
The structure of nilpotent symplectic algebras of maximal class has been studied in [8, 5]. In this paper, we study the dual subclass of algebras of minimal class. In particular, we show that symplectic alternating algebras of dimension up…
The algebraic and Hamiltonian structures of the multicomponent dispersionless Benney and Toda hierarchies are studied. This is achieved by using a modified set of variables for which there is a symmetry between the basic fields. This…
This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…
In this article, we propose a second-order central scheme of the Nessyahu-Tadmor-type for a class of scalar conservation laws with discontinuous flux and present its convergence analysis. Since solutions to problems with discontinuous flux…
We study the tractability of conjunctive query answering for queries with unbounded arity. It is well known that tractability of the problem can be characterised in terms of the queries treewidth under the assumption of bounded arity. We…
Bachmair's and Ganzinger's abstract redundancy concept for the Superposition Calculus justifies almost all operations that are used in superposition provers to delete or simplify clauses, and thus to keep the clause set manageable. Typical…
Based on \cite{DH94}, we introduce a bijective correspondence between first order differential calculi and the graph structure of the symmetric lattice that allows one to encode completely the interconnection structure of the graph in the…
We consider the Arveson-Douglas conjecture on the essential normality of homogeneous submodules corresponding to algebraic subvarieties of the unit ball. We prove that the property of essential normality is preserved by isomorphisms between…
We prove a combinatorial formula for the alternating descent polynomials of type A and B. Combining with Josuat-Verg\`es' combinatorial interpretation for Hoffman's derivative polynomials for tangent and secant functions, we obtain a…
Abstraction is a key verification technique to improve scalability. However, its use for neural networks is so far extremely limited. Previous approaches for abstracting classification networks replace several neurons with one of them that…