Related papers: A New Finitely Controllable Class of Tuple Generat…

The spectrum of a tensor-triangulated category carries a compact Hausdorff topology, called the constructible topology, also known as the patch topology. We prove that patch-dense subsets detect tt-ideals and we prove that any infinite…

Current end-to-end neural conversation models inherently lack the flexibility to impose semantic control in the response generation process, often resulting in uninteresting responses. Attempts to boost informativeness alone come at the…

Recently, the first-named author gave a classification of 3D consistent 6-tuples of quad-equations with the tetrahedron property; several novel asymmetric 6-tuples have been found. Due to 3D consistency, these 6-tuples can be extended to…

Recently, diffusion probabilistic models have attracted attention in generative time series forecasting due to their remarkable capacity to generate high-fidelity samples. However, the effective utilization of their strong modeling ability…

We investigate a new notion of regularity for tensor triangulated categories, called residual regularity. We show that residual regularity descends and ascends via finite separable extensions and we classify all finite groups whose derived…

Many bundle gerbes constructed in practice are either infinite-dimensional, or finite-dimensional but built using submersions that are far from being fibre bundles. Murray and Stevenson proved that gerbes on simply-connected manifolds,…

Discrete diffusion models are a class of generative models that construct sequences by progressively denoising samples from a categorical noise distribution. Beyond their rapidly growing ability to generate coherent natural language, these…

We prove that every finitely presentable group G arises as the fundamental group of an orientable 3-complex obtained from a hyperbolic link complement, by coning each boundary torus of the link exterior to a distinct point. We define the…

Time Series Generation (TSG) has emerged as a pivotal technique in synthesizing data that accurately mirrors real-world time series, becoming indispensable in numerous applications. Despite significant advancements in TSG, its efficacy…

Graph data structures are fundamental for studying connected entities. With an increase in the number of applications where data is represented as graphs, the problem of graph generation has recently become a hot topic. However, despite its…

Controllable Text Generation (CTG) is emerging area in the field of natural language generation (NLG). It is regarded as crucial for the development of advanced text generation technologies that better meet the specific constraints in…

Topological effects continue to fascinate physicists since more than three decades. One of their main applications are high-precision measurements of the resistivity. We propose to make also use of the spatially separated edge states. It is…

This paper is about robust Model Predictive Control (MPC) for linear systems with additive and multiplicative uncertainty. A novel class of configuration-constrained polytopic robust forward invariant tubes is introduced, which admit a…

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

We prove that a triangulated category which is the underlying category of a stable derivator has a filtered enhancement, providing an affirmative answer to a conjecture in [3].

We present the guarded lambda-calculus, an extension of the simply typed lambda-calculus with guarded recursive and coinductive types. The use of guarded recursive types ensures the productivity of well-typed programs. Guarded recursive…

We show that there exists a canonical functor from the category of strict \infty-groupoids to the category of Grothendieck \infty-groupoids and that this functor is fully faithful. As a main ingredient, we prove that free strict…

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.…

For domains that involve numerical simulation, it can be computationally expensive to run an ensemble of simulations spanning a parameter space of interest to a user. To this end, an attractive surrogate for simulation is the generative…

The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit the semantics encoded in ontologies, has been acknowledged both in the database and knowledge representation communities. We…