Related papers: Calculating Colimits Compositionally
We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type…
In this paper we present a cut-free sequent calculus, called SeqS, for some standard conditional logics, namely CK, CK+ID, CK+MP and CK+MP+ID. The calculus uses labels and transition formulas and can be used to prove decidability and space…
In this note, we derive a finite summation formula and an infinite summation formula involving Harmonic numbers of order up to some order by means of several definite integrals
We prove a precise formula for the minimal number K(n) such that every binary word of length $n$ can be divided into K(n) palindromes. Also we estimate the average number $\ol K(n)$ of palindromes composing a random binary word of the…
We prove a Kleene theorem for higher-dimensional automata. It states that the languages they recognise are precisely the rational subsumption-closed sets of finite interval pomsets. The rational operations on these languages include a…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of…
The development of machine learning in particular and artificial intelligent in general has been strongly conditioned by the lack of an appropriated framework to specify and integrate learning processes, data transformation processes and…
Several interesting formulas concerning finite Hilbert transform and logarithmic integrals are proved with application in determining equilibrium measures, planar limits of analytic random matrix models with $1-$cut potential and solving…
Higher Homotopy van Kampen Theorems allow the computation as colimits of certain homotopical invariants of glued spaces. One corollary is to describe homotopical excision in critical dimensions in terms of induced modules and crossed…
We exhibit a uniform method for obtaining (wellfounded and non-wellfounded) cut-free sequent-style proof systems that are sound and complete for various classes of action algebras, i.e., Kleene algebras enriched with meets and residuals.…
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
The extension of Hille-Phillips functional calculus of semigroup generators which leads to unbounded operators is considered. Connections of this calculus to Bochner-Phillips functional calculus are indicated. In particular, the…
In this paper, first we characterize closedness of range of the finite sum of weighted composition operators between different Lp-spaces. Then we discuss polar decomposition and invertibility of these operators.
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
We compute the lengths of two particular cases of (possibly non-unital) composition algebras, namely, standard composition algebras and Okubo algebras over an arbitrary field $\mathbb{F}$. These results finish the complete description of…
We consider the pointwise approximation of a subharmonic function by the logarithm of the modulus of an entire function up to a bounded quantity. In the case of finite order an estimate from below of the planar Lebesgue measure of an…
Analogous to the sl(n) case, we address the computation of the index of seaweed subalgebras of sp(2n) by introducing graphical representations called symplectic meanders. Formulas for the algebra's index may be computed by counting the…
We give an introduction to the concept of Kan extensions, and study its relation with the notions of coend and adjoint functors. We state and prove in detail a well known formula to compute Kan extensions by using coends: a certain colimit…
We provide a complete classification of solvable instances of the equational unification problem over De Morgan and Kleene algebras with respect to unification type. The key tool is a combinatorial characterization of finitely generated…