Searcharxiv⌕ Search

arXiv subjects

Alexandre Borovik

Publications and source records attributed to Alexandre Borovik.

At least 37 records · Page 2Linked to original sources
arXiv2018

Groups of finite Morley rank with a generically sharply multiply transitive action

We prove that if $G$ is a group of finite Morley rank which acts definably and generically sharply $n$-transitively on a connected abelian group $V$ of Morley rank $n$ with no involutions, then there is an algebraically closed field $F$ of characteristic $\ne 2$ such that $V$ has a structure of a vector space of dimension $n$ over $F$ and $G$ acts on $V$ as the group $\operatorname{GL}_n(F)$ in its natural action on $F^n$. This is the final pre-publication version of the paper: A. Berkman and A. Borovik, Groups of finite Morley rank with a generically sharply multiply transitive action, J. Algebra (2018), https://doi.org/10.1016/j.jalgebra.2018.07.033. Accepted for publication 28 July 2018. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published

math.GR↗
arXiv2017

Adjoint representations of black box groups ${\rm PSL}_2(\mathbb{F}_q)$

Given a black box group $\mathsf{Y}$ encrypting $\rm{PSL}_2(\mathbb{F})$ over an unknown field $\mathbb{F}$ of unknown odd characteristic $p$ and a global exponent $E$ for $\mathsf{Y}$ (that is, an integer $E$ such that $\mathsf{y}^E=1$ for all $\mathsf{y} \in \mathsf{Y}$), we present a Las Vegas algorithm which constructs a unipotent element in $\mathsf{Y}$. The running time of our algorithm is polynomial in $\log E$. This answers the question posed by Babai and Beals in 1999. We also find the characteristic of the underlying field in time polynomial in $\log E$ and linear in $p$. Furthermore, we construct, in probabilistic time polynomial in $\log E$, 1. a black box group $\mathsf{X}$ encrypting $\rm{PGL}_2(\mathbb{F}) \cong\rm{SO}_3(\mathbb{F})$, its subgroup $\mathsf{Y}^\circ$ of index $2$ isomorphic to $\mathsf{Y}$ and a probabilistic polynomial in $\log E$ time isomorphism $\mathsf{Y}^\circ \longrightarrow \mathsf{Y}$; 2. a black box field $\mathsf{K}$, and 3. polynomial time, in $\log E$, isomorphisms \[ \rm{SO}_3(\mathsf{K}) \longrightarrow \mathsf{X} \longrightarrow \rm{SO}_3(\mathsf{K}). \] If, in addition, we know $p$ and the standard explicitly given finite field $\mathbb{F}$ isomorphic to $\mathbb{F}$ then we construct, in time polynomial in $\log E$, isomorphism \[ \rm{SO}_3(\mathbb{F})\longrightarrow \rm{SO}_3(\mathsf{K}). \] Unlike many papers on black box groups, our algorithms make no use of additional oracles other than the black box group operations. Moreover, our result acts as an $\rm{SL}_2$-oracle in the black box group theory. We implemented our algorithms in GAP and tested them for groups such as $\rm{PSL}_2(\mathbb{F})$ for $|\mathbb{F}|=115756986668303657898962467957$ (a prime number).

math.GR↗
arXiv2017

Cauchy's infinitesimals, his sum theorem, and foundational paradigms

Cauchy's sum theorem is a prototype of what is today a basic result on the convergence of a series of functions in undergraduate analysis. We seek to interpret Cauchy's proof, and discuss the related epistemological questions involved in comparing distinct interpretive paradigms. Cauchy's proof is often interpreted in the modern framework of a Weierstrassian paradigm. We analyze Cauchy's proof closely and show that it finds closer proxies in a different modern framework. Keywords: Cauchy's infinitesimal; sum theorem; quantifier alternation; uniform convergence; foundational paradigms.

math.HO↗
arXiv2016

A non-standard analysis of a cultural icon: The case of Paul Halmos

We examine Paul Halmos' comments on category theory, Dedekind cuts, devil worship, logic, and Robinson's infinitesimals. Halmos' scepticism about category theory derives from his philosophical position of naive set-theoretic realism. In the words of an MAA biography, Halmos thought that mathematics is "certainty" and "architecture" yet 20th century logic teaches us is that mathematics is full of uncertainty or more precisely incompleteness. If the term architecture meant to imply that mathematics is one great solid castle, then modern logic tends to teach us the opposite lession, namely that the castle is floating in midair. Halmos' realism tends to color his judgment of purely scientific aspects of logic and the way it is practiced and applied. He often expressed distaste for nonstandard models, and made a sustained effort to eliminate first-order logic, the logicians' concept of interpretation, and the syntactic vs semantic distinction. He felt that these were vague, and sought to replace them all by his polyadic algebra. Halmos claimed that Robinson's framework is "unnecessary" but Henson and Keisler argue that Robinson's framework allows one to dig deeper into set-theoretic resources than is common in Archimedean mathematics. This can potentially prove theorems not accessible by standard methods, undermining Halmos' criticisms. Keywords: Archimedean axiom; bridge between discrete and continuous mathematics; hyperreals; incomparable quantities; indispensability; infinity; mathematical realism; Robinson.

math.HO↗
arXiv2015

Rank 3 Bingo

We classify irreducible actions of connected groups of finite Morley rank on abelian groups of Morley rank 3.

math.GR↗
arXiv2014

Black Box White Arrow

The present paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. Instead of a single black box, we consider categories of black boxes and their morphisms. This makes new classes of black box problems accessible. For example, we can enrich black box groups by actions of outer automorphisms. As an example of application of this technique, we construct Frobenius maps on black box groups of untwisted Lie type in odd characteristic (Section 6) and inverse-transpose automorphisms on black box groups encrypting ${\rm (P)SL}_n(\mathbb{F}_q)$. One of the advantages of our approach is that it allows us to work in black box groups over finite fields of big characteristic. Another advantage is explanatory power of our methods; as an example, we explain Kantor's and Kassabov's construction of an involution in black box groups encrypting ${\rm SL}_2(2^n)$. Due to the nature of our work we also have to discuss a few methodological issues of the black box group theory. The paper is further development of our text "Fifty shades of black" [arXiv:1308.2487], and repeats parts of it, but under a weaker axioms for black box groups.

math.GR↗
arXiv2013

Mathematics discovered, invented, and inherited

The classical platonist/formalist dilemma in philosophy of mathematics can be expressed in lay terms as a deceptively naive question: is new mathematics discovered or invented? Using an example from my own mathematical life, I argue that there is also a third way: new mathematics can also be inherited -- and in the process briefly discuss a remarkable paper by W. Burnside of 1900.

math.HO↗
arXiv2013

Fifty shades of black

The paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. As the starting point of our programme, we construct Frobenius maps on black box groups of untwisted Lie type in odd characteristic and then apply them to black box groups X encrypting groups (P)SL(2,q) in small odd characteristics. We propose an algorithm constructing a black box field K isomorphic to F_q, and an isomorphism from (P)SL(2,K) to X. The algorithm runs in time quadratic in the characteristic of the underlying field and polynomial in log q. Due to the nature of our work we also have to discuss a few methodological issues of the black box group theory.

math.GR↗
arXiv2013

Steinberg presentations of black box classical groups in small characteristics

The main component of (constructive) recognition algorithms for black box groups of Lie type in computational group theory is the construction of unipotent elements. In the existing algorithms unipotent elements are found by random search and therefore the running time of these algorithms is polynomial in the underlying field size $q$ which makes them unfeasible for most practical applications \cite{guralnick01.169}. Meanwhile, the input size of recognition algorithms involves only $\log q$. The present paper introduces a new approach to construction of unipotent elements in which the running time of the algorithm is quadratic in characteristic $p$ of the underlying field and is polynomial in $\log q$; for small values of $p$ (which make a vast and practically important class of problems), the complexity of these algorithms is polynomial in the input size. For $\psl_2(q)$, $\qpone$, we present a Monte-Carlo algorithm which constructs a root subgroup $U$, the maximal torus $T$ normalizing $U$ and a Weyl group element $w$ which conjugates $U$ to its opposite. Moreover, we extend this result and construct Steinberg generators for the black box untwisted classical groups defined over a field of odd size $q=p^k$ where $\qpone$. Our algorithms run in time quadratic in characteristic $p$ of the underlying field and polynomial in $\log q$ and the Lie rank $n$ of the group. The case $\qmone$ requires the use of additional tools and is treated separately in our next paper \cite{suko12B}. Further, and much stronger results can be found in \cite{suko12E,suko12F}.

math.GR↗
arXiv2012

An integer construction of infinitesimals: Toward a theory of Eudoxus hyperreals

A construction of the real number system based on almost homomorphisms of the integers Z was proposed by Schanuel, Arthan, and others. We combine such a construction with the ultrapower or limit ultrapower construction, to construct the hyperreals out of integers. In fact, any hyperreal field, whose universe is a set, can be obtained by such a one-step construction directly out of integers. Even the maximal (i.e., On-saturated) hyperreal number system described by Kanovei and Reeken (2004) and independently by Ehrlich (2012) can be obtained in this fashion, albeit not in NBG. In NBG, it can be obtained via a one-step construction by means of a definable ultrapower (modulo a suitable definable class ultrafilter).

math.LO↗
arXiv2012

Who Gave you the Cauchy-Weierstrass Tale? The Dual History of Rigorous Calculus

Cauchy's contribution to the foundations of analysis is often viewed through the lens of developments that occurred some decades later, namely the formalisation of analysis on the basis of the epsilon-delta doctrine in the context of an Archimedean continuum. What does one see if one refrains from viewing Cauchy as if he had read Weierstrass already? One sees, with Felix Klein, a parallel thread for the development of analysis, in the context of an infinitesimal-enriched continuum. One sees, with Emile Borel, the seeds of the theory of rates of growth of functions as developed by Paul du Bois-Reymond. One sees, with E. G. Bjorling, an infinitesimal definition of the criterion of uniform convergence. Cauchy's foundational stance is hereby reconsidered.

math.HO↗
arXiv2011

Groups of Finite Morley Rank with a Pseudoreflection Action

In this work, we give two characterisations of the general linear group as a group $G$ of finite Morley rank acting on an abelian connected group $V$ of finite Morley rank definably, faithfully and irreducibly. To be more precise, we prove that if the pseudoreflection rank of $G$ is equal to the Morley rank of $V$, then $V$ has a vector space structure over an algebraically closed field, $G\cong GL(V)$ and the action is the natural action. The same result holds also under the assumption of Prufer 2-rank of $G$ being equal to the Morley rank of $V$.

math.GR↗
arXiv2008

Linear groups of finite Morley rank

We show that a non-algebraic simple group of finite Morley rank with a definable representation over a field has no involutions, and otherwise resembles a bad group. In particular, the modern form of the Cherlin-Zilber alebaricity conjecture hold for such groups.

math.LO↗