Related papers: Order-enriched solid functors
Under correlation-type conditions, we derive an upper bound of order $(\log n)/n$ for the average Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law. The result is based on improved…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
We extend Lurie's definition of enriched $\infty$-categories to notions of left enriched, right enriched and bienriched $\infty$-categories, which generalize the concepts of closed left tensored, right tensored and bitensored…
This text is based on lectures given by authors in summer 2015. It contains an introduction to the theory of limits over the category of presentations, with examples of different well-known functors like homology or derived functors of…
A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a homogeneous polynomial of sufficiently high strength specialises to any given polynomial of the same degree in a bounded number of…
In this paper we first offer an alternative approach to extend the original Fueter's Theorem in Dunkl-Clifford analysis to a version of the higher order case. Then this result is used to prove a generlized version of Fueter's Theorem with…
Braided-enriched monoidal categories were introduced in work of Morrison-Penneys, where they were characterized using braided central functors. Recent work of Kong-Yuan-Zhang-Zheng and Dell extended this characterization to an equivalence…
We exhibit a functor from the category OUS of order unit spaces and positive, unit-preserving mappings into the category $\Prob$ of probabilistic models (test spaces with designated state spaces) and morphisms thereof. Restricted to any…
Norm estimates for strongly continuous semigroups have been successfully studied in numerous settings, but at the moment there are no corresponding studies in the case of solution operators of singular integral equations. Such equations…
The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…
Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…
We argue that in some KR applications, we want to quantify over sets of concepts formally represented by symbols in the vocabulary. We show that this quantification should be distinguished from second-order quantification and…
In this paper, we establish refined Strichartz estimates for higher-order Schr\"odinger equations with initial data exhibiting partial regularity. By partial regularity, we mean that the initial data are not required to have full Sobolev…
In this work we provide a survey of Fuglede's flux extensions of first order partial differential operators, a concept largely forgotten today. A long the way we also survey the classical weak and strong extensions of PDE operators and the…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
We discuss polynomials orthogonal with respect to a semi-classical generalised higher order Freud weight \[\omega(x;t,\lambda)=|x|^{2\lambda+1}\exp\left(tx^2-x^{2m}\right),\qquad x\in\mathbb{R},\] with parameters $\lambda > -1$,…
In this paper we study weighted Hardy-Sobolev spaces of vector valued functions analytic on double-napped cones of the complex plane. We introduce these spaces as a tool for complex scaling of linear ordinary differential equations with…
We show that a family of random variables is uniformly integrable if and only if it is stochastically bounded in the increasing convex order by an integrable random variable. This result is complemented by proving analogous statements for…
Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…