相关论文: A New Finitely Controllable Class of Tuple Generat…

We describe a new class of positive linear discrete-time switching systems for which the problems of stability or stabilizability can be resolved constructively. This class generalizes the class of systems with independently switching state…

We present a chance-constrained model predictive control (MPC) framework under Gaussian mixture model (GMM) uncertainty. Specifically, we consider the uncertainty that arises from predicting future behaviors of moving obstacles, which may…

We call a first-order formula one-dimensional if its every maximal block of existential (universal) quantifiers leaves at most one variable free. We consider the one-dimensional restrictions of the guarded fragment, GF, and the tri-guarded…

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

We study the complexity of constraint satisfaction problems involving global constraints, i.e., special-purpose constraints provided by a solver and represented implicitly by a parametrised algorithm. Such constraints are widely used;…

We initiate the study of the \emph{twisted conjugacy growth series} of a finitely generated group, the formal power series associated to the twisted conjugacy growth function. Our main result is that, for a virtually abelian group, this…

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

Let $\phi:G\to G$ be an automorphism of a group which is a free-product of finitely many groups each of which is freely indecomposable and two of the factors contain proper finite index characteristic subgroups. We show that $G$ has…

Existence of incomplete and imprecise data has moved the database paradigm from deterministic to proba- babilistic information. Probabilistic databases contain tuples that may or may not exist with some probability. As a result, the number…

In recent years, the Shapley value has emerged as a general game-theoretic measure for assessing the contribution of a tuple to the result of a database query. We study the complexity of calculating the Shapley value of a tuple for an…

This paper shows a new phenomenon in higher cluster tilting theory. For each positive integer d, we exhibit a triangulated category C with the following properties. On the one hand, the d-cluster tilting subcategories of C have very simple…

We show that finitely generated cohomology is invariant under separable equivalences for all algebras. As a result, we obtain a proof of the finite generation of cohomology for finite symmetric tensor categories in characteristic zero, as…

For a connected semisimple algebraic group $G$, we consider some special infinite series of tensor products of simple $G$-modules whose $G$-fixed point spaces are at most one-dimensional. We prove that their existence is closely related to…

We study the complexity of enumerating the answers of Conjunctive Queries (CQs) in the presence of Functional Dependencies (FDs). Our focus is on the ability to list output tuples with a constant delay in between, following a linear-time…

The standard definition generation task requires to automatically produce mono-lingual definitions (e.g., English definitions for English words), but ignores that the generated definitions may also consist of unfamiliar words for language…

Despite the remarkable progress of 3D generation, achieving controllability, i.e., ensuring consistency between generated 3D content and input conditions like edge and depth, remains a significant challenge. Existing methods often struggle…

In this paper, we propose a design method for controller based it on that describe plants as T-S triangular cloud models in case of uncertainty in them.

It has been conjectured that finite tensor categories have finitely generated cohomology. We show that this is equivalent to finitely generated Hochschild cohomology for the endomorphism algebras of the projective generators.

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…