arXiv subjects

João Araújo

Publications and source records attributed to João Araújo.

At least 19 recordsLinked to original sources

arXiv2026

Proving at Scale for Universal Algebra

We introduce SemiBase, a project that computes and formally certifies finite identity bases for small semigroups. Deciding finite basability is undecidable for finite algebras and remains open for finite semigroups. The task requires a proof that a candidate basis is complete, or a proof that none exists, rather than a single first-order validity query. LLM-guided agents search for these proofs; a referee agent rebuilds them from source, and the Lean kernel checks the resulting corpus in a final audit. Humans choose targets and approve final outcomes. We certify every semigroup of order at most 6: all 1309 semigroups of order at most 5 and all 15973 of order 6, including proofs that the four known nonfinitely based semigroups have no finite basis. The bases for order 6 define 505 distinct varieties, whose inclusion order Vampire determines except for four pairs. The resulting catalogue is a machine-checked account of results scattered across the literature and a tested foundation for order 7.

cs.LO↗

arXiv2026

Complete Mappings of Semigroups

A complete mapping of a semigroup $S$ is a bijection $α\colon S\to S$ such that the map $θ\colon S\to S$ defined by $xθ=x\cdot xα$ is also a bijection. Equivalently, it determines a transversal of the multiplication table of $S$. Complete mappings connect group theory, Latin squares, and cryptography, and their existence for finite groups was characterized by the resolution of the Hall--Paige conjecture. In this paper, we develop the corresponding theory for finite semigroups. We prove that every finite semigroup admitting a complete mapping is regular and that the problem reduces to principal factors. We classify the existence of a complete mapping in Rees matrix semigroups without zero, give a Hall-type criterion for Rees $0$-matrix semigroups over groups with complete mappings, and prove sufficient conditions for Rees $0$-matrix semigroups whose maximal subgroups do not have complete mappings. As the main application of the Rees $0$-matrix analysis, we show that $T_n$ has a complete mapping if and only if $n=1$ or $n\geq 4$. Equivalently, $T_n$ has a complete mapping if and only if the same holds for $S_n$. We prove that the full linear monoid of a finite-dimensional vector space has a complete mapping except in dimension $1$ over a field of odd order and in dimension $2$ over $\mathbb F_2$. We also prove that the partition monoid $\mathcal P_n$ has a complete mapping if and only if $n=1$ or $n\ge4$, and that every finite aperiodic regular $*$-semigroup has a complete mapping. As a consequence, the planar partition, Motzkin and Jones monoids have complete mappings. The paper concludes with open problems.

math.GR↗

arXiv2026

Standard morphisms and Pythagorean triples

Let $m\geq 1$, let $f:\mathbb N\to\mathbb Z/m\mathbb Z$ be a standard morphism and let $T(m)$ be the least integer $N$ such that every such $f$ admits a primitive monochromatic Pythagorean triple with hypotenuse at most $N$. The aim of this note is to prove that every standard morphism has infinitely many identity-valued Pythagorean triples and infinitely many primitive monochromatic Pythagorean triples. Thus the qualitative part of Problem~4.3 of Eliahou, Fromentin, Marion-Poty and Robilliard is solved for every $m$. Moreover, $T(m)$ is finite, the morphism $n\mapsto v_3(n)\pmod m$ has least possible hypotenuse $(9^m+1)/2$ and $T(d)\leq T(m)$ when $d\mid m$.

math.CO↗

arXiv2026

Conjugacy in Abstract Semigroups, Transformation and Diagram Monoids, and Conjugacy Growth

We study conjugacy relations on semigroups and monoids, focusing on the relation $a \cfn b$, defined by the existence of $g,h \in S^1$ such that $ag = gb$, $bh = ha$, $hag = b$, and $gbh = a$. This notion emerged as one that yields particularly elegant results. The interplay between $\cfn$ and other standard conjugacy relations is analyzed, and some results on special classes of abstract semigroups are established. We then specialize to the case of transformation semigroups. A complete classification of $\cfn$-classes is obtained for the full transformation monoid $\mathcal{T}_n$, the symmetric inverse monoid $\mathcal{I}_n$, and the endomorphism monoid of $G$-sets, among others. We also investigate the natural conjugacy in diagram semigroups, including the partition monoid, the Brauer monoid, and the partial Brauer monoid. Finally, we investigate the conjugacy growth function in polycyclic monoids and obtain a precise asymptotic estimate. The paper concludes with some open problems.

math.GR↗

arXiv2026

The Inverse Monoid of Partial Inner Automorphisms of a Semigroup

We introduce the inverse monoid of inner partial automorphisms of a semigroup -- a tool that associates to every semigroup an inverse semigroup. When the semigroup is a group, this inverse semigroup is isomorphic to the group of inner automorphisms with a zero adjoined. We then describe this structure for completely simple semigroups, the full transformation monoid, and the endomorphism monoid of a finite $G$-set when $G$ is a finite abelian group. The paper ends with some open problems.

math.GR↗

arXiv2025

On the impact of semantic transparency on understanding and reviewing social goal models

Context: i* is one of the most influential languages in the Requirements Engineering research community. Perhaps due to its complexity and low adoption in industry, it became a natural candidate for studies aiming at improving its concrete syntax and the stakeholders' ability to correctly interpret i* models. Objectives: We evaluate the impact of semantic transparency on understanding and reviewing i* models, in the presence of a language key. Methods: We performed a quasi-experiment comparing the standard i* concrete syntax with an alternative that has an increased semantic transparency. We asked 57 novice participants to perform understanding and reviewing tasks on i* models, and measured their accuracy, speed and ease, using metrics of task success, time and effort, collected with eye-tracking and participants' feedback. Results: We found no evidence of improved accuracy or speed attributable to the alternative concrete syntax. Although participants' perceived ease was similar, they devoted significantly less visual effort to the model and the provided language key, when using the alternative concrete syntax. Conclusions: The context provided by the model and language key may mitigate the i* symbol recognition deficit reported in previous works. However, the alternative concrete syntax required a significantly lower visual effort.

cs.SE↗

arXiv2025

SAT-Based Techniques for Lexicographically Smallest Finite Models

This paper proposes SAT-based techniques to calculate a specific normal form of a given finite mathematical structure (model). The normal form is obtained by permuting the domain elements so that the representation of the structure is lexicographically smallest possible. Such a normal form is of interest to mathematicians as it enables easy cataloging of algebraic structures. In particular, two structures are isomorphic precisely when their normal forms are the same. This form is also natural to inspect as mathematicians have been using it routinely for many decades. We develop a novel approach where a SAT solver is used in a black-box fashion to compute the smallest representative. The approach constructs the representative gradually and searches the space of possible isomorphisms, requiring a small number of variables. However, the approach may lead to a large number of SAT calls and therefore we devise propagation techniques to reduce this number. The paper focuses on finite structures with a single binary operation (encompassing groups, semigroups, etc.). However, the approach is generalizable to arbitrary finite structures. We provide an implementation of the proposed algorithm and evaluate it on a variety of algebraic structures.

cs.LO↗

arXiv2025

Cube-based Isomorph-free Finite Model Finding

Complete enumeration of finite models of first-order logic (FOL) formulas is pivotal to universal algebra, which studies and catalogs algebraic structures. Efficient finite model enumeration is highly challenging because the number of models grows rapidly with their size but at the same time, we are only interested in models modulo isomorphism. While isomorphism cuts down the number of models of interest, it is nontrivial to take that into account computationally. This paper develops a novel algorithm that achieves isomorphism-free enumeration by employing isomorphic graph detection algorithm nauty, cube-based search space splitting, and compact model representations. We name our algorithm cube-based isomorph-free finite model finding algorithm (CBIF). Our approach contrasts with the traditional two-step algorithms, which first enumerate (possibly isomorphic) models and then filter the isomorphic ones out in the second stage. The experimental results show that CBIF is many orders of magnitude faster than the traditional two-step algorithms. CBIF enables us to calculate new results that are not found in the literature, including the extension of two existing OEIS sequences, thereby advancing the state of the art.

cs.LO↗

arXiv2022

Varieties of Lazy Magmas Characterized by Forbidden Substructure Theorems

A magma (or groupoid) is a set with a binary operation $(A,f)$. Roughly speaking, a magma is said to be lazy if compositions such as $f(x,f(f(y,z),u))$ depend on at most two variables. Recently, Kaprinai, Machida and Waldhauser described the lattice of all the varieties of lazy groupoids. A forbidden structure theorem is one that charcaterizes a smaller class $A$ inside a larger class $B$ as all the elements in $B$ that avoid some substructures. For example, a lattice is distributive (smaller class $A$) if and only if it is a lattice (larger class $B$) and avoids the pentagon and the diamond. In this paper we provide a characterization of all pairs of lazy groupoid varieties $A\le B$ by forbidden substructure theorems. Some of the results are straightforward, but some other are very involved. All of these results and proofs were found using a computational tool that proves theorems of this type (for many different classes of relational algebras) and that we make available to every mathematician.

math.GR↗

arXiv2022

Integrals of groups II

An $integral$ of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. This paper continues the investigation on integrals of groups started in the work arXiv:1803.10179. We study: (1) A sufficient condition for a bound on the order of an integral for a finite integrable group and a necessary condition for a group to be integrable. (2) The existence of integrals that are $p$-groups for abelian $p$-groups, and of nilpotent integrals for all abelian groups. (3) Integrals of (finite or infinite) abelian groups, including nilpotent integrals, groups with finite index in some integral, periodic groups, torsion-free groups and finitely generated groups. (4) The variety of integrals of groups from a given variety, varieties of integrable groups and classes of groups whose integrals (when they exist) still belong to such a class. (5) Integrals of profinite groups and a characterization for integrability for finitely generated profinite centreless groups. (6) Integrals of Cartesian products, which are then used to construct examples of integrable profinite groups without a profinite integral. We end the paper with a number of open problems.

math.GR↗

arXiv2022

CREAM: a Package to Compute [Auto, Endo, Iso, Mono, Epi]-morphisms, Congruences, Divisors and More for Algebras of Type $(2^n,1^n)$

The CREAM GAP package computes automorphisms, congruences, endomorphisms and subalgebras of algebras with an arbitrary number of binary and unary operations; it also decides if between two such algebras there exists a monomorphism, an epimorphism, an isomorphism or if one is a divisor of the other. Thus it finds those objects for almost all algebras used in practice (groups, quasigroups in their various signatures, semigroups possibly with many unary operations, fields, semi-rings, quandles, logic algebras, etc). As a one-size-fits-all package, it only relies on universal algebra theorems, without taking advantage of specific theorems about, eg, groups or semigroups to reduce the search space. Canon and Holt produced very fast code to compute automorphisms of groups that outperform CREAM on orders larger than 128. Similarly, Mitchell et al. take advantage of deep theorems to compute automorphisms and congruences of completely 0-simple semigroups in a very efficient manner. However these domains (groups of order above 128 and completely 0-simple semigroups) are among the very few examples of GAP code faster than our general purpose package CREAM. For the overwhelming majority of other classes of algebras, either ours is the first code computing the above mentioned objects, or the existing algorithms are outperformed by CREAM, in some cases by several orders of magnitude. To get this performance, CREAM uses a mixture of universal algebra algorithms together with GAP coupled with artificial intelligence theorem proving tools (AITP) and very delicate C implementations. As an example of the latter, we re-implement Freese's very clever algorithm for computing congruences in universal algebras, in a way that outperforms all other known implementations.

math.GR↗

arXiv2022

Boosting Isomorphic Model Filtering with Invariants

The enumeration of finite models is very important to the working discrete mathematician (algebra, graph theory, etc) and hence the search for effective methods to do this task is a critical goal in discrete computational mathematics. However, it is hindered by the possible existence of many isomorphic models, which usually only add noise. Typically, they are filtered out {\em a posteriori}, a step that might take a long time just to discard redundant models. This paper proposes a novel approach to split the generated models into mutually non-isomorphic blocks. To do that we use well-designed hand-crafted invariants as well as randomly generated invariants. The blocks are then tackled separately and possibly in parallel. This approach is integrated into Mace4 (the most popular tool among mathematicians) where it shows tremendous speed-ups for a large variety of algebraic structures.

cs.SC↗

arXiv2019

A Survey on Varieties Generated by Small Semigroups and a Companion Website

The aim of this paper is to provide an atlas of identity bases for varieties generated by small semigroups and groups. To help the working mathematician easily find information, we provide a companion website that runs in the background automated reasoning tools, finite model builders, and GAP, so that the user has an automatic \textit{intelligent} guide on the literature. This paper is mainly a survey of what is known about identity bases for semigroups or groups of small orders, and we also mend some gaps left unresolved by previous authors. For instance, we provide the first complete and justified list of identity bases for the varieties generated by a semigroup of order up to~$4$, and the website contains the list of varieties generated by a semigroup of order up to~$5$. The website also provides identity bases for several types of semigroups or groups, such as bands, commutative groups, and metabelian groups. On the inherently non-finitely based finite semigroups side, the website can decide if a given finite semigroup possesses this property or not. We provide some other functionalities such as a tool that outputs the multiplication table of a semigroup given by a $C$-presentation, where~$C$ is any class of algebras defined by a set of first order formulas. The companion website can be found here \url{http://sgv.pythonanywhere.com} Please send any comments/suggestions to \url{jj.araujo@fct.unl.pt}

math.GR↗

arXiv2019

A Transversal Property for Permutation Groups Motivated by Partial Transformations

In this paper we introduce the definition of $(k,l)$-universal transversal property, which is a refinement of the definition of $k$-universal transversal property, which in turn is a refinement of the classic definition of $k$-homogeneity for permutation groups. In particular, a group possesses the $(2,n)$-universal transversal property if and only if it is primitive; it possesses the $(2,2)$-universal transversal property if and only if it is $2$-homogeneous. Up to a few undecided cases, we give a classification of groups satisfying the $(k,l)$-universal transversal property, for $k\ge 3$. Then we apply this result for studying regular semigroups of partial transformations.

math.GR↗

arXiv2019

Primitive Permutation Groups and Strongly Factorizable Transformation Semigroups

Let $Ω$ be a finite set and $T(Ω)$ be the full transformation monoid on $Ω$. The rank of a transformation $t\in T(Ω)$ is the natural number $|Ωt|$. Given $A\subseteq T(Ω)$, denote by $\langle A\rangle$ the semigroup generated by $A$. Let $k$ be a fixed natural number such that $2\le k\le |Ω|$. In the first part of this paper we (almost) classify the permutation groups $G$ on $Ω$ such that for all rank $k$ transformation $t\in T(Ω)$, every element in $S_t:=\langle G,t\rangle$ can be written as a product $eg$, where $e^2=e\in S_t$ and $g\in G$. In the second part we prove, among other results, that if $S\le T(Ω)$ and $G$ is the normalizer of $S$ in the symmetric group on $Ω$, then the semigroup $SG$ is regular if and only if $S$ is regular. (Recall that a semigroup $S$ is regular if for all $s\in S$ there exists $s'\in S$ such that $s=ss's$.) The paper ends with a list of problems.

math.GR↗

arXiv2018

The existential transversal property: a generalization of homogeneity and its impact on semigroups

Let $G$ be a permutation group of degree $n$, and $k$ a positive integer with $k\le n$. We say that $G$ has the $k$-existential property, or $k$-et for short, if there exists a $k$-subset $A$ of the domain $Ω$ such that, for any $k$-partition $\mathcal{P}$ of $Ω$, there exists $g\in G$ mapping $A$ to a transversal (a section) for $\mathcal{P}$. This property is a substantial weakening of the $k$-universal transversal property, or $k$-ut, investigated by the first and third author, which required this condition to hold for all $k$-subsets $A$ of the domain. Our first task in this paper is to investigate the $k$-et property and to decide which groups satisfy it. For example, we show that, for $8\le k\le n/2$, the only groups with $k$-et are the symmetric and alternating groups; this is best possible since the Mathieu group $M_{24}$ has $7$-et. We determine all groups with $k$-et for $4\le k\le n/2$, up to some unresolved cases for $k=4,5$, and describe the property for $k=2,3$ in permutation group language. In the previous work, the results were applied to semigroups, in particular, to the question of when the semigroup $\langle G,t\rangle$ is regular, where $t$ is a map of rank $k$ (with $k<n/2$); this turned out to be equivalent to the $k$-ut property. The question investigated here is when there is a $k$-subset $A$ of the domain such that $\langle G, t\rangle$ is regular for all maps $t$ with image $A$. This turns out to be more delicate; the $k$-et property (with $A$ as witnessing set) is a necessary condition, and the combination of $k$-et and $(k-1)$-ut is sufficient, but the truth lies somewhere between. Given the knowledge that a group under consideration has the necessary condition of $k$-et, we solve the regularity question for $k\le n/2$ except for one sporadic group.

math.GR↗

arXiv2018

Integrals of groups

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those integrals can be. Our main results are: (1) If a finite group has an integral, then it has a finite integral. (2) A precise characterization of the set of natural numbers $n$ for which every group of order $n$ is integrable: these are the cubefree numbers $n$ which do not have prime divisors $p$ and $q$ with $q\mid p-1$. (3) An abelian group of order $n$ has an integral of order at most $n^{1+o(1)}$, but may fail to have an integral of order bounded by $cn$ for constant $c$. (4) A finite group can be integrated $n$ times (in the class of finite groups) if and only if it is the central product of an abelian group and a perfect group. There are many other results on such topics as centreless groups, groups with composition length $2$, and infinite groups. We also include a number of open problems.

math.GR↗

arXiv2017

Decidability and Independence of Conjugacy Problems in Finitely Presented Monoids

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$, $\sim_o$, and $\sim_c$) in certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids, $p$-conjugacy is "almost" transitive, $\sim_c$ is strictly included in $\sim_p$, and the $p$- and $c$-conjugacy problems are decidable with linear compexity. For other classes of monoids, the situation is more complicated. We show that there exists a monoid $M$ defined by a finite complete presentation such that the $c$-conjugacy problem for $M$ is undecidable, and that for finitely presented monoids, the $c$-conjugacy problem and the word problem are independent, as are the $c$-conjugacy and $p$-conjugacy problems.

math.GR↗