Search arXivSearch

arXiv · 2204.02652

Quasi groupes de Frobenius dimensionnels

Abstract

We are interested in a class of groups, quasi-Frobenius groups (with involutions), whose internal structure generalizes that of the classical groups GA1(C), PGL 2(C) and SO3(R) : a subgroup and its conjugates, of finite index in their normalizer and trivial mutual intersection, cover "generically" the ambient group. From the perspective of model theory, we work with the hypothesis of the existence of a good notion of dimension on definable sets (we must distinguish between the o-minimal case and the ranked case). We pay special attention to the ranked case. By studying the geometry of incidence induced by involutions, we sketch a classification of quasi-Frobenius groups and thus determine under which conditionsclassical groups can be identified in a dimensional framework -- -- Nous nous int\'eressons \`a une classe de groupes, les quasi-groupes de Frobenius (avec involutions), dont la structure interne g\'en\'eralise celle des groupes classiques GA1(C), PGL2(C) et SO3(R) : un sous-groupe et ses conjugu\'es, d'indice fini dans leur normalisateur et d'intersection mutuelle triviale, recouvrent "g\'en\'eriquement" le groupe ambiant. Dans la perspective de la th\'eorie des mod\`eles, nous travaillons avec l'hypoth\`ese de l'existence d'une bonne notion dimension sur les ensembles d\'efinissables (il faut distinguer le cas o-minimal et le cas rang\'e). Nous accordons une attention particuli\`ere au cas rang\'e. En \'etudiant la g\'eom\'etrie d'incidence induite par les involutions, nous esquissons une classification des quasi-groupes de Frobenius et nous d\'eterminons ainsi sous quelles conditions des groupes classiques peuvent \^etre identifi\'es dans un cadre dimensionnel.

Explore related subjects

Keep this discovery

BibTeXRIS

Samuel Zamour. 2022-04-06. Quasi groupes de Frobenius dimensionnels. https://doi.org/10.2140/mt.2023.2.69

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO