Related papers: Function classes and relational constraints stable…
We carry out some of Galois's work in the setting of an arbitrary first-order theory T. We replace the ambient algebraically closed field by a large model M of T, replace fields by definably closed subsets of M, assume that T codes finite…
Generators of the algebra of first class functions in a system with second class constraints are found. It is shown that first class functions form algebras with respect to the Dirac bracket and pointwise multiplication.The subspace of…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…
We present theoretical and practical results on the order theory of lattices of functions, focusing on Galois connections that abstract (sets of) functions - a topic known as higher-order abstract interpretation. We are motivated by the…
We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…
Using a new approach based on Galois theory, we study subvarieties of complex representations of reductive groups which satisfy restriction properties on their invariant rings and function fields, along the lines of the Chevalley…
In this paper, the changes of representations of a group are used in order to describe its action as algebraic Galois group of an univariate polynomial on the roots of factors of any Lagrange resolvent. By this way, the Galois group of…
Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…
We define a Galois structure on the category of pairs of equivalence relations in an exact Mal'tsev category, and characterize central and double central extensions in terms of higher commutator conditions. These results generalize both the…
Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
The structure functions of the Lagrangian gauge algebra are given explicitly in terms of the hamiltonian constraints and the first order Hamiltonian structure functions and their derivatives.
The connection between constraint languages and clone theory has been a fruitful line of research on the complexity of constraint satisfaction problems. In a recent result, Cohen et al. [SICOMP'13] have characterised a Galois connection…
In (Borceux-Janelidze 2001) they prove a Categorical Galois Theorem for ordinary categories, and establish the main result of (Joyal-Tierney 1984), along with the classical Galois theory of Rings, as instances of this more general result.…
In this article, a class of analytic functions is investigated and their some properties are established. Several recurrence relations and various classes of bilinear and bilateral generating functions for these analytic functions are also…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
We introduce a family of rank functions and related notions of total transcendence for Galois types in abstract elementary classes. We focus, in particular, on abstract elementary classes satisfying the condition know as tameness (currently…
We present a detailed synthetic overview of the utilisation of categorical techniques in the study of order structures together with their applications in operational quantum theory. First, after reviewing the notion of residuation and its…
A clonoid is a set of finitary functions from a set $A$ to a set $B$ that is closed under taking minors. Hence clonoids are generalizations of clones. By a classical result of Post, there are only countably many clones on a 2-element set.…
Equivalence relations or, more general, quasiorders (i.e., reflexive and transitive binary relations) $\rho$ have the property that an $n$-ary operation $f$ preserves $\rho$, i.e., $f$ is a polymorphism of $\rho$, if and only if each…