English
Related papers

Related papers: Order-enriched solid functors

200 papers

We study the expressive power of the two-variable fragment of order-invariant first-order logic. This logic departs from first-order logic in two ways: first, formulas are only allowed to quantify over two variables. Second, formulas can…

Logic in Computer Science · Computer Science 2022-07-12 Julien Grange

This paper proposes an extension of standard mixture stochastic models, by replacing the constant mixture weights with functional weights defined using a classifier. Classifier Weighted Mixtures enable straightforward density evaluation,…

Machine Learning · Statistics 2025-01-07 Elouan Argouarc'h , François Desbouvries , Eric Barat , Eiji Kawasaki , Thomas Dautremer

In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata. Generalising from the Booleans to arbitrary semirings, we extend our…

Formal Languages and Automata Theory · Computer Science 2020-01-13 Dan Shiebler , Alexis Toumi , Mehrnoosh Sadrzadeh

Higher order derivatives of functions are structured high dimensional objects which lend themselves to many alternative representations, with the most popular being multi-index, matrix and tensor representations. The choice between them…

Classical Analysis and ODEs · Mathematics 2021-12-01 José E. Chacón , Tarn Duong

We consider weighted structures, which extend ordinary relational structures by assigning weights, i.e. elements from a particular group or ring, to tuples present in the structure. We introduce an extension of first-order logic that allows…

Logic in Computer Science · Computer Science 2020-09-23 Steffen van Bergerem , Nicole Schweikardt

We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…

Combinatorics · Mathematics 2011-02-15 Béla Csaba , András Pluhár

We study trees where each successor set is equipped with some additional structure. We introduce a family of automaton models for such trees and prove their equivalence to certain fixed-point logics. As a consequence we obtain…

Logic in Computer Science · Computer Science 2025-02-24 Achim Blumensath

We make use of the cotangent complex formalism developed by Lurie to formulate Quillen cohomology of algebras over an enriched operad. Additionally, we introduce a spectral Hochschild cohomology theory for enriched operads and algebras over…

Algebraic Topology · Mathematics 2025-04-21 Truong Hoang

We introduce the notion of a weighted $\delta$-vector of a lattice polytope. Although the definition is motivated by motivic integration, we study weighted $\delta$-vectors from a combinatorial perspective. We present a version of Ehrhart…

Combinatorics · Mathematics 2009-07-10 Alan Stapledon

Higher order free moments and cumulants, introduced by Collins, Mingo, \'Sniady and Speicher in 2006, describe the fluctuations of unitarily invariant random matrices in the limit of infinite size. The functional relations between their…

Combinatorics · Mathematics 2023-01-02 Luca Lionni

Quantification, i.e., the task of training predictors of the class prevalence values in sets of unlabeled data items, has received increased attention in recent years. However, most quantification research has concentrated on developing…

Machine Learning · Computer Science 2023-10-16 Mirko Bunse , Alejandro Moreo , Fabrizio Sebastiani , Martin Senz

It is known that there is a weak-equivalence between the geometric realization of a simplicially enriched small category and its cofibrant replacement [12]. In this paper, we show that when only small categories are considered there exists…

Algebraic Topology · Mathematics 2019-01-03 Asli Guclukan Ilhan , Ozgun Unlu

It is characterized when coarsening functors between categories of graded modules preserve injectivity of objects, and when they commute with graded covariant Hom functors.

Commutative Algebra · Mathematics 2013-04-09 Fred Rohrer

Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the operational semantics of formal systems. For example, a graph enriched Lawvere theory describes structures that have a graph of operations of…

Category Theory · Mathematics 2020-09-16 John C. Baez , Christian Williams

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…

Combinatorics · Mathematics 2018-07-17 Zoltán Füredi , Tao Jiang , Alexandr Kostochka , Dhruv Mubayi , Jacques Verstraëte

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…

This article contains a characterization of when certain weighted Sobolev spaces on $\Bbb R^n$ embed compactly into $L^2(\mathbb R^n, \varphi)$. The characterization is in terms of derivatives of the weight function $\varphi$ and involves…

Functional Analysis · Mathematics 2010-07-22 Klaus Gansberger

The fractional integrals and fractional derivatives problem is tackled by using the operator approach. The definition domain E of operators is causal functions.Many properties of fractional integrals are given. Fractional derivatives…

General Mathematics · Mathematics 2013-02-20 Raoelina Andriambololona

In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…

Functional Analysis · Mathematics 2020-12-07 Andrzej Olbryś , Zsolt Páles

We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…

Category Theory · Mathematics 2020-10-13 Volodymyr Lyubashenko
‹ Prev 1 3 4 5 6 7 10 Next ›