相关论文: A New Decidable Class of Tuple Generating Dependen…
We introduce and study single-conclusioned nested sequent calculi for a broad class of intuitionistic multi-modal logics known as "intuitionistic grammar logics (IGLs)." These logics serve as the intuitionistic counterparts of classical…
Gradually typed programming languages, which allow for soundly mixing static and dynamically typed programming styles, present a strong challenge for metatheorists. Even the simplest sound gradually typed languages feature at least…
The weighted triangulation algebras associated to triangulation quivers and their socle deformations were recently introduced and studied in [15]-[20] and [2]. These algebras, based on surface triangulations and originated from the theory…
We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…
Machine learning in drug discovery has been focused on virtual screening of molecular libraries using discriminative models. Generative models are an entirely different approach that learn to represent and optimize molecules in a continuous…
Computing expected predictions of discriminative models is a fundamental task in machine learning that appears in many interesting applications such as fairness, handling missing values, and data analysis. Unfortunately, computing…
The mapping class group of an orientable surface, which records its symmetries up to isotopy, plays a central role in low-dimensional topology. This chapter explores the foundational problem of determining minimal generating sets for these…
Generative concept representations have three major advantages over discriminative ones: they can represent uncertainty, they support integration of learning and reasoning, and they are good for unsupervised and semi-supervised learning. We…
We consider the smallest triangulated subcategory of the unbounded derived module category of a ring that contains the injective modules and is closed under set indexed coproducts. If this subcategory is the entire derived category, then we…
We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…
Containers conveniently represent a wide class of inductive data types. Their derivatives compute representations of types of one-hole contexts, useful for implementing tree-traversal algorithms. In the category of containers and cartesian…
In this paper we investigate injective generation for graded rings. We first examine the relation between injective generation and graded injective generation for graded rings. We then reduce the study of injective generation for graded…
New families of algebras and DG algebras with two simple modules are introduced and described. Using the twisted tensor product operation, we prove that such algebras have finite global dimension, and the resulting DG algebras are smooth.…
In the terms of an `$n$-periodic derived category', we describe explicitly how the orbit category of the bounded derived category of an algebra with respect to powers of the shift functor embeds in its triangulated hull. We obtain a large…
A large class of first order partial nonlinear differential equations in two independent variables which possess an infinite set of polynomial conservation laws derived from an explicit generating function is constructed. The conserved…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
We construct a family of PL triangulations of the $d$-dimensional real projective space $\mathbb{R}P^d$ on $\Theta((\frac{1+\sqrt{5}}{2})^{d+1})$ vertices for every $d\geq 1$. This improves a construction due to K\"{u}hnel on $2^{d+1}-1$…
We investigate the computational complexity of mining guarded clauses from clausal datasets through the framework of inductive logic programming (ILP). We show that learning guarded clauses is NP-complete and thus one step below the…
We introduce and study a new class of differential fields in positive characteristic. We call them separably differentially closed fields and demonstrate that they are the differential analogue of separably closed fields. We prove several…
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…