相关论文: Quantitative inverse Galois problem for semicommut…

Counting number fields with prescribed Galois group is an enduring challenge in arithmetic statistics. Using the determinant method, we provide an upper bound for even groups, which is new in some cases.

The residual closure of a subgroup $H$ of a group $G$ is the intersection of all virtually normal subgroups of $G$ containing $H$. We show that if $G$ is generated by finitely many cosets of $H$ and if $H$ is commensurated, then the…

Semi-infinite programs are a class of mathematical optimization problems with a finite number of decision variables and infinite constraints. As shown by Blankenship and Falk (Blankenship and Falk. "Infinitely constrained optimization…

The first aim of this note is to fill a gap in the literature by proving that, given a global field $K$ and a finite set $\mathcal{S}$ of primes of $K$, every finite split embedding problem $G \rightarrow {\rm{Gal}}(L/K)$ over $K$ with…

We disprove a strong form of the Regular Inverse Galois Problem: there exist finite groups $G$ which do not have a realization $F/\Qq(T)$ that induces all Galois extensions $L/\Qq(U)$ of group $G$ by specializing $T$ to $f(U) \in \Qq(U)$.…

In this work we present algebraic conditions on an inverse semigroup S (with zero) which imply that its associated tight groupoid G_{tight)(S) is: Hausdorff, essentially principal, minimal and contracting, respectively. In some cases these…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered…

We describe a special class of representations of an inverse semigroup S on Hilbert's space which we term "tight". These representations are supported on a subset of the spectrum of the idempotent semilattice of S, called the "tight…

The groups QF, QT, and QV are groups of quasi-automorphisms of the infinite binary tree. Their names indicate a similarity with Thompson's well-known groups F, T, and V. We will use the theory of diagram groups over semigroup presentations…

This article is concerned with Galois theory for iterative differential fields (ID-fields) in positive characteristic. More precisely, we consider purely inseparable Picard-Vessiot extensions, because these are the ones having an…

This article is the first part of a series of three articles about compatible systems of symplectic Galois representations and applications to the inverse Galois problem. In this first part, we determine the smallest field over which the…

In 2018, Legrand and Paran proved a weaker form of the Inverse Galois Problem for all Hilbertian fields and all finite groups: that is, there exist possibly non-Galois extensions over given Hilbertian base field with given finite group as…

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…

Over a smooth and proper complex scheme, the differential Galois group of an integrable connection may be obtained as the closure of the transcendental monodromy representation. In this paper, we employ a completely algebraic variation of…

In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

The main aim of this work is to introduce and justify the study of semi-covarities. A {\it semi-covariety} is a non-empty family $\mathcal{F}$ of numerical semigroups such that it is closed under finite intersections, has a minimum,…