Related papers: Order-enriched solid functors
We investigate lifted inference on ordered domains with predecessor relations, where the elements of the domain respect a total (cyclic) order, and every element has a distinct (clockwise) predecessor. Previous work has explored this…
This article is motivated by the need for better understanding of refined Riemann-Roch theorems and the behavior of the determinant of the cohomology. This poses a certain problem of functoriality and can be understood as that of giving…
In this paper, we gave a weighted compactness theory for the generalized commutators of vecotor-valued multilinear Calder\'{o}n-Zygmund operators. This was done by establishing a weighted Fr\'{e}chet-Kolmogorov theorem, which holds for…
We construct a functor from the triangulated category of Voevodsky motives to a certain derived category of mixed Hodge structures enriched with integral weight filtration. We use this construction to prove a strong integral version of the…
The classical theorem of Erd\H os \& Wintner furnishes a criterion for the existence of a limiting distribution for a real, additive arithmetical function. This work is devoted to providing an effective estimate for the remainder term under…
The familiar adjunction between ordered sets and completely distributive lattices can be extended to generalised metric spaces, that is, categories enriched over a quantale (a lattice of "truth values"), via an appropriate distributive law…
Representation learning for high-dimensional, complex physical systems aims to identify a low-dimensional intrinsic latent space, which is crucial for reduced-order modeling and modal analysis. To overcome the well-known Kolmogorov barrier,…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
Weighted First-Order Model Counting (WFOMC) computes the weighted sum of the models of a first-order logic theory on a given finite domain. First-Order Logic theories that admit polynomial-time WFOMC w.r.t domain cardinality are called…
In the theory of operads we consider functors of generalized symmetric powers defined by sums of coinvariant modules under actions of symmetric groups. One observes classically that the construction of symmetric functors provides an…
We construct the complete set of orders of growth and we define on it the generalized entropy of a dynamical systems. With this object we provide a framework where we can study the separation of orbits of a map beyond the scope of…
It is known due to the work of Van den Broeck et al [KR, 2014] that weighted first-order model counting (WFOMC) in the two-variable fragment of first-order logic can be solved in time polynomial in the number of domain elements. In this…
This paper introduces a skew variant of the notion of enriched category, suitable for enrichment over a skew-monoidal category, the main novelty of which is that the elements of the enriched hom-objects need not be in bijection with the…
In this work we discuss a new type of factorisation systems for \textbf{Ord}-enriched categories. We start by defining the new notion of lax weak orthogonality, which involves the existence of lax diagonal morphisms for lax squares. Using…
We present a complete analysis of the linearised dynamics of active solids with orientational order, taking into account a hitherto overlooked consequence of rotation invariance. Our predictions include the possibility of stable active…
The Euler numbers have been widely studied. A signed version of the Euler numbers of even subscript are given by the coefficients of the exponential generating function 1/(1+x^2/2!+x^4/4!+...). Leeming and MacLeod introduced a…
We continue the study of enriched infinity categories, using a definition equivalent to that of Gepner and Haugseng. In our approach enriched infinity categories are associative monoids in an especially designed monoidal category of…
Let $A$ be a noetherian connected graded algebra. We introduce and study homological invariants that are weighted sums of the homological and internal degrees of cochain complexes of graded $A$-modules, providing weighted versions of…
We set up a general theory of weak or homotopy-coherent enrichment in an arbitrary monoidal $\infty$-category $\mathcal{V}$. Our theory of enriched $\infty$-categories has many desirable properties; for instance, if the enriching…
Functor lifting along a fibration is used for several different purposes in computer science. In the theory of coalgebras, it is used to define coinductive predicates, such as simulation preorder and bisimilarity. Codensity lifting is a…