相关论文: A relative Yoneda Lemma (manuscript)
In this paper we translate the necessary and sufficient conditions of Tanaka's theorem on the finiteness of effective prolongations of a fundamental graded Lie algebras into computationally effective criteria, involving the rank of some…
We use expansions with functions related to some special functions such as Hermite or Laguerre to get some conjectural expansions of the Riemann Zeta function in the critical strip involving a set of polynomials which have their zeros on…
We present the type system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…
We compute the Yoneda extension algebra of the collection of Weyl modules for $GL_2$ over an algebraically closed field of positive characteristic p by developing a theory of generalised Koszul duality for certain 2-functors, one of which…
We state and prove a version of Dyson's Lemma for a product of smooth projective varieties of arbitrary dimension using positivity methods.
Particular solutions of the Benney equations are constructed. Their properties are discussed.
Approximate solutions to functional evolution equations are constructed through a combination of series and conjugation methods, and relative errors are estimated. The methods are illustrated, both analytically and numerically, by…
We present a method for approximating context-free languages with one-counter automata. This approximation allows the reconstruction of parse trees of the original grammar. We identify a decidable superset of regular languages whose…
Let $A$ be a Poisson algebra and $\Q(A)$ its quasi-Poisson enveloping algebra. In this paper, the Yoneda-Ext algebra $\Ext^*_{\Q(A)}(A, A)$, which we call the quasi-Poisson cohomology algebra of $A$, is investigated. We construct a…
We investigate fundamental properties of adjoint functors to the precomposition functor in the category of strict polynomial functors.
Extended regular expressions with counting and interleaving are widely used in practice. However the related theoretical studies for this kind of expressions currently cannot meet the need of practical work. This paper develops syntax…
We show that, for a right exact functor from an abelian category to abelian groups, Yoneda's isomorphism commutes with homology and, hence, with functor derivation. Then we extend this result to semiabelian domains. An interpretation in…
In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…
A simple theory of the covariant derivatives, deformed derivatives and relative covariant derivatives of extensor fields is present using algebraic and analytical tools developed in previous papers. Several important formulas are derived.
Two variations of classical Urysohn lemma for subsets of topological vector spaces are obtained in this article. The continuous functions constructed in these lemmas are of quasi-convex type.
A first aim of this paper is to give sufficient conditions on left non-degenerate bijective set-theoretic solutions of the Yang-Baxter equation so that they are non-degenerate. In particular, we extend the results on involutive solutions…
Relative monads provide a controlled view of computation. We generalise the monadic metalanguage to a relative setting and give a complete semantics with strong relative monads. Adopting this perspective, we generalise two existing program…
We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of…
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…