Related papers: On Pseudo Algebraically Closed Extensions of Field…

Abstract We present PAC-Bayesian bounds for the generalisation error of the K-nearest-neighbour classifier (K-NN). This is achieved by casting the K-NN classifier into a kernel space framework in the limit of vanishing kernel bandwidth. We…

We describe a method for counting the number of extensions of $\mathbb{Q}_p$ with a given Galois group $G$, founded upon the description of the absolute Galois group of $\mathbb{Q}_p$ due to Jannsen and Wingberg. Because this description is…

We determine the universal central extension of the Lie algebra of hamiltonian vector fields, thereby classifying its central extensions. Furthermore, we classify the central extensions of the Lie algebra of symplectic vector fields, of the…

We introduce the notion of universal odd generalized Poisson superalgebra associated to an associative algebra A, by generalizing a construction made in [5]. By making use of this notion we give a complete classification of simple linearly…

Let $L$ and $M$ be two algebraically closed fields contained in some common larger field. It is obvious that the intersection $C=L\cap M$ is also algebraically closed. Although the compositum $LM$ is obviously perfect, there is no reason…

The concepts of linkage, building blocks, and problem decomposition have long existed in the genetic algorithm field and have guided the development of model-based genetic algorithms for decades. However, their definitions are usually…

The paper is concerned with the following version of Hilbert's irreducibility theorem: if $\pi: X \to Y$ is a Galois $G$-covering of varieties over a number field $k$ and $H \subset G$ is a subgroup, then for all sufficiently large and…

Let C be an algebraically closed field and X a projective curve over C. Consider an ordinary linear differential equation, or a linear differ- ence equation, with coefficients in the field of rational functions of X, and assume that its…

Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not…

In this paper we extend of the notion of algebraically closed given in the case of groups and skew fields to an arbitrary h-inductive theory. The main subject of this paper is the study of the notion of positive algebraic closedness and its…

For a differential field $F$ having an algebraically closed field of constants, we analyze the structure of Picard-Vessiot extensions of $F$ whose differential Galois groups are unipotent algebraic groups and apply these results to study…

We develop a general axiomatic theory of algebraic pairs, which simultaneously generalizes several algebraic structures, in order to bypass negation as much as feasible. We investigate several classical theorems and notions in this setting…

A systematic study of non-trivial cubic extensions of the four-dimensional Poincar\'e algebra is undertaken. Explicit examples are given with various techniques (Young tableau, characters etc).

This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…

Let $K$ be a complete discretely valued field. An extension $L/K$ is "weakly totally ramified" if the residue extension is purely inseparable. We sharpen a result of Ax by showing that any Galois-invariant disk in the algebraic closure of…

In this paper, we consider the problem of replicable realizable PAC learning. We construct a particularly hard learning problem and show a sample complexity lower bound with a close to $(\log|H|)^{3/2}$ dependence on the size of the…

We study two classes of extension problems, and their interconnections: (i) Extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; (ii) In case of Lie groups, representations of the…

We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…

Fixed point theorems are one of the many tools used to prove existence and uniqueness of differential equations. When the data involved contains products of distributions, some of these tools may not be useful. Thus rises the necessity to…

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…