Related papers: A New Finitely Controllable Class of Tuple Generat…
Controllable text generation (CTG) by large language models has a huge potential to transform education for teachers and students alike. Specifically, high quality and diverse question generation can dramatically reduce the load on teachers…
We consider the finite generation property for cohomology algebra of pointed finite tensor categories via de-equivariantization and exact sequence of finite tensor categories. As a result, we prove that all coradically graded pointed finite…
Among the mutation finite cluster algebras the tubular ones are a particularly interesting class. We show that all tubular (simply laced) cluster algebras are of exponential growth by two different methods: first by studying the…
In this paper, we study consistent query answering in tables with nulls and functional dependencies. Given such a table T, we consider the set Tuples of all tuples that can be built up from constants appearing in T, and we use set theoretic…
We propose a new model for the theory of $(\infty,n)$-categories (including the case $n=\infty$) in the category of marked cubical sets with connections, similar in flavor to complicial sets of Verity. The model structure characterizing our…
We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method…
We give a specific cylinder functor for semifree dg categories. This allows us to construct a homotopy colimit functor explicitly. These two functors are "computable", specifically, the constructed cylinder functor sends a dg category of…
Consider a finite group $G$ acting on a triangulated category $\mathcal T$. In this paper we investigate triangulated structure on the category $\mathcal T^G$ of $G$-equivariant objects in $\mathcal T$. We prove (under some technical…
Entailment Graphs (EGs) have been constructed based on extracted corpora as a strong and explainable form to indicate context-independent entailment relations in natural languages. However, EGs built by previous methods often suffer from…
A new general formula for the number of conjugacy classes of subgroups of given index in a finitely generated group is obtained.
The development of control techniques to maintain vehicle stability under possible loss-of-control scenarios is essential to the safe deployment of autonomous ground vehicles in public scenarios. In this paper, we propose a tube-based…
The Guarded Fragment (GF) is a well-established decidable fragment of first-order logic. We study an extension of GF with nested equivalence relations, namely a family of distinguished binary predicates $E_1, E_2, \dots$ interpreted as…
We prove a uniqueness theorem for irreducible non-critical Gelfand-Tsetlin modules. The uniqueness result leads to a complete classification of the irreducible Gelfand-Tsetlin modules with 1-singularity. An explicit construction of such…
Multiple-choice cloze questions are commonly used to assess linguistic proficiency and comprehension. However, generating high-quality distractors remains challenging, as existing methods often lack adaptability and control over difficulty…
We present GS (Guarded Successor), a novel decidable temporal logic with several unique distinctive features. Among those, it allows infinitely many data values that come not only with equality but with a somehow rich theory too: the…
With the rapid development of Large Language Models (LLMs), Controllable Text Generation (CTG) has become a critical technology for enhancing system reliability and user experience. Addressing the limitations of traditional methods, this…
This article makes discrete masked models for the generative modeling of discrete data controllable. The goal is to generate samples of a discrete random variable that adheres to a posterior distribution, satisfies specific constraints, or…
In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete…
The stable category of modules over the algebra of a finite group with coefficients in a field is a compactly generated tensor triangulated category, that has been studied extensively in representation theory. In this paper, we provide a…
Controllable text generation is an appealing but challenging task, which allows users to specify particular attributes of the generated outputs. In this paper, we propose a controllable dialogue generation model to steer response generation…