Related papers: Algorithmic constructions and primitive elements i…

For any finite Galois field extension $\mathsf{K}/\mathsf{F}$, with Galois group $G = \mathrm{Gal}(\mathsf{K}/\mathsf{F})$, there exists an element $\alpha \in \mathsf{K}$ whose orbit $G\cdot\alpha$ forms an $\mathsf{F}$-basis of…

Version 2: Corrected Section 3.3: instead of lexicographical normal forms we now use a normal form due to V. Diekert and A. Muscholl. Consequent changes made and some misprints corrected. Using an analogue of Makanin-Razborov diagrams, we…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

Let $\Gamma\subset\mathbb{Q}^*$ be a finitely generated subgroup and let $p$ be a prime such that the reduction group $\Gamma_p$ is a well defined subgroup of the multiplicative group $\mathbb{F}_p^*$. We prove an asymptotic formula for the…

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. A submonoid $M$ generated by $k$ elements of $A^*$ is…

Let $p$ be a prime integer and $\mathbb{Z}_p$ be the ring of $p$-adic integers. By a purely computational approach we prove that each nonzero normal element of a completed group algebra over the special linear group ${\rm…

We prove an elementary lemma concerning primitive amalgams and use it to greatly simplify the proof of the Sims conjecture in the case of almost simple groups.

We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$…

This paper proposes new derivations of three well-known sorting algorithms, in their functional formulation. The approach we use is based on three main ingredients: first, the algorithms are derived from a simpler algorithm, i.e. the…

For a morphism f in a category C with sufficiently many finite limits and colimits, we discuss an elementary construction of a decomposition of f through objects P and N which, if C happens to have a zero object, amounts to the standard…

We establish an analogue of the classical Polya-Vinogradov inequality for $GL(2, \F_p)$, where $p$ is a prime. In the process, we compute the `singular' Gauss sums for $GL(2, \F_p)$. As an application, we show that the collection of…

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…

We prove the existence of a regular semigroup F(X) weakly generated by X such that all other regular semigroups weakly generated by X are homomorphic images of F(X). The semigroup F(X) is introduced by a presentation and the word problem…

The normal form for a system of ode's is constructed from its polynomial symmetries of the linear part of the system, which is assumed to be semi-simple. The symmetries are shown to have a simple structure such as invariant function times…

We study the average case complexity of the uniform membership problem for subgroups of free groups, and we show that it is orders of magnitude smaller than the worst case complexity of the best known algorithms. This applies to subgroups…

In this paper we study primality and primary decomposition of certain ideals which are generated by homogeneous degree $2$ polynomials and occur naturally from determinantal conditions. Normality is derived from these results.

We describe a solving semi-decision method based on examination of the rational structures of the generalized integrating factors of first-order ODEs. We propose a conjecture that for some family of equations of the type…

Norm forms, examples of which include $x^2 + y^2$, $x^2 + x y - 57 y^2$, and $x^3 + 2 y^3 + 4 z^3 - 6 x y z$, are integral forms arising from norms on number fields. We prove that the natural density of the set of integers represented by a…