Related papers: A Galois Connection for Weighted (Relational) Clon…

Let $X$ be a reduced connected $k$-scheme pointed at a rational point $x \in X(k)$. By using tannakian techniques we construct the Galois closure of an essentially finite $k$-morphism $f:Y\to X$ satisfying the condition…

Limit computable functions can be characterized by Turing jumps on the input side or limits on the output side. As a monad of this pair of adjoint operations we obtain a problem that characterizes the low functions and dually to this…

We give a complete description of the arboreal Galois representation of a certain postcritically finite cubic polynomial over a large class of number fields and for a large class of basepoints. This is the first such example that is not…

We make explicit certain results around the Galois correspondence in the context of definable automorphism groups, and point out the relation to some recent papers dealing with the Galois theory of algebraic differential equations when the…

We revisit Kolchin's results on definability of differential Galois groups of strongly normal extensions, in the case where the field of constants is not necessarily algebraically closed. In certain classes of differential topological…

Let A be a basic connected finite dimensional algebra over an algebraically closed field, let G be a group, let T be a basic tilting A-module and let B the endomorphism algebra of T. Under a hypothesis on T, we establish a correspondence…

This paper extends Hopf-Galois theory to infinite field extensions and provides a natural definition of subextensions. For separable (possibly infinite) Hopf-Galois extensions, it provides a Galois correspondence. This correspondence also…

Generalising the notion of Galois corings, Galois comodules were introduced as comodules $P$ over an $A$-coring $\cC$ for which $P_A$ is finitely generated and projective and the evaluation map $\mu_\cC:\Hom^\cC(P,\cC)\ot_SP\to \cC$ is an…

A famous result by Jeavons, Cohen, and Gyssens shows that every constraint satisfaction problem (CSP) where the constraints are preserved by a semi-lattice operation can be solved in polynomial time. This is one of the basic facts for the…

The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1…

In this text we develop some aspects of Harder-Narasimhan theory, slopes, semistability and canonical filtration, in the setting of combinatorial lattices. Of noticeable importance is the Harder-Narasimhan structure associated to a Galois…

We prove the finiteness of the kernel of the localization map in the Galois cohomology of a connected reductive group over a global field

We study the differential Galois theory of difference equations under weaker hypothesis on the field of constants of the automorphism. This framework yields a new approach to results by C.Hardouin and M.Singer, which answers possitively a…

A clone of functions on a finite domain determines and is determined by its system of invariant relations (=predicates). When a clone is determined by a finite number of relations, we say that the clone is of finite degree. For each Minsky…

This paper studies expansions of bounded distributive lattices equipped with a Galois connection. We introduce GC-frames and canonical frames for these algebras. The complex algebras of GC-frames are defined in terms of rough set…

We investigate the Galois coverings of weakly shod algebras. For a weakly shod algebra not quasi-tilted of canonical type, we establish a correspondence between its Galois coverings and the Galois coverings of its connecting component. As a…

Let $n>1$, $e\geq 0$ and a prime number $p\geq 2^{n+2+2e}+3$, such that the index of regularity of $p$ is $\leq e$. We show that there are infinitely many irreducible Galois representations $\rho: Gal(\bar{\mathbb{Q}}/\mathbb{Q})\rightarrow…

We generalize finite-sample bounds for convex clustering to the setting where affinity weights appearing in the objective correspond to a general connected graph. These bounds and their analysis lead to a better understanding of clustering…

By a quasi-connected reductive group (a term of Labesse) over an arbitrary field we mean an almost direct product of a connected semisimple group and a quasi-torus (a smooth group of multiplicative type). We show that a linear algebraic…

Given a pair of n-dimensional complex Galois representations over Q, we define their matching density to be the density, if it exists, of the set of places at which the traces of Frobenius of the two Galois representations are equal. We…