We exhibit a practical algorithm for solving the constructive membership problem for discrete free subgroups of rank $2$ in $\mathrm{PSL}_2(\mathbb{R})$ or $\mathrm{SL}_2(\mathbb{R})$. This algorithm, together with methods for checking whether a two-generator subgroup of $\mathrm{PSL}_2(\mathbb{R})$ or $\mathrm{SL}_2(\mathbb{R})$ is discrete and free, have been implemented in Magma for groups defined over real algebraic number fields.

Supplementary materials are available with this article.

We show that a computable and conformal map of the unit disk onto a bounded domain $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}D$ has a computable boundary extension if $D$ has a computable boundary connectivity function.

We exhibit a numerical method to compute three-point branched covers of the complex projective line. We develop algorithms for working explicitly with Fuchsian triangle groups and their finite-index subgroups, and we use these algorithms to compute power series expansions of modular forms on these groups.

The form of information presented can influence its utility for the conveying of knowledge by affecting an interpreter’s ability to reason with the information. There are distinct types of representational systems (for example, symbolic versus diagrammatic logics), various sub-systems (for example, propositional versus predicate logics), and even within a single representational system there may be different means of expressing the same piece of information content. Thus, to display information, choices must be made between its different representations, depending upon many factors such as: the context, the reasoning tasks to be considered, user preferences or desires (for example, for short symbolic sentences or minimal clutter within diagrammatic systems). The identification of all equivalent representations with the same information content is a sensible precursor to attempts to minimise a metric over this class. We posit that defining notions of semantic redundancy and identifying the syntactic properties that encapsulate redundancy can help in achieving the goal of completely identifying equivalences within a single notational system or across multiple systems, but that care must be taken when extending systems, since refinements of redundancy conditions may be necessary even for conservative system extensions. We demonstrate this theory within two diagrammatic systems, which are Euler-diagram-based notations. Such notations can be used to represent logical information and have applications including visualisation of database queries, social network visualisation, statistical data visualisation, and as the basis of more expressive diagrammatic logics such as constraint languages used in software specification and reasoning. The development of the new associated machinery and concepts required is important in its own right since it increases the growing body of knowledge on diagrammatic logics. In particular, we consider Euler diagrams with shading, and then we conservatively extend the system to include projections, which allow for a much greater degree of flexibility of representation. We give syntactic properties that encapsulate semantic equivalence in both systems, whilst observing that the same semantic concept of redundancy is significantly more difficult to realise as syntactic properties in the extended system with projections.

Differential difference algebras, introduced by Mansfield and Szanto, arose naturally from differential difference equations. In this paper, we investigate the Gelfand–Kirillov dimension of differential difference algebras. We give a lower bound of the Gelfand–Kirillov dimension of a differential difference algebra and a sufficient condition under which the lower bound is reached; we also find an upper bound of this Gelfand–Kirillov dimension under some specific conditions and construct an example to show that this upper bound cannot be sharpened any further.

We explicitly construct the Kummer variety associated to the Jacobian of a hyperelliptic curve of genus 3 that is defined over a field of characteristic not equal to 2 and has a rational Weierstrass point defined over the same field. We also construct homogeneous quartic polynomials on the Kummer variety and show that they represent the duplication map using results of Stoll.

Supplementary materials are available with this article.

We give the complete list of possible torsion subgroups of elliptic curves with complex multiplication over number fields of degree 1–13. Additionally we describe the algorithm used to compute these torsion subgroups and its implementation.

We use an invariant-theoretic method to compute certain twists of the modular curves $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}X(n)$ for $n=7,11$. Searching for rational points on these twists enables us to find non-trivial pairs of $n$-congruent elliptic curves over ${\mathbb{Q}}$, that is, pairs of non-isogenous elliptic curves over ${\mathbb{Q}}$ whose $n$-torsion subgroups are isomorphic as Galois modules. We also find a non-trivial pair of 11-congruent elliptic curves over ${\mathbb{Q}}(T)$, and hence give an explicit infinite family of non-trivial pairs of 11-congruent elliptic curves  over ${\mathbb{Q}}$.

Supplementary materials are available with this article.

Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial structure of a polyhedron. In each case we give algorithmic methods to compute the corresponding group and discuss some practical experiences. For practical purposes the linear symmetry group is the most important, as its computation can be directly translated into a graph automorphism problem. We indicate how to compute integral subgroups of the linear symmetry group that are used, for instance, in integer linear programming.

One way to study certain classes of polynomials is by considering examples that are attached to combinatorial objects. Any graph $G$ has an associated reciprocal polynomial $R_{G}$, and with two particular classes of reciprocal polynomials in mind one can ask the questions: (a) when is $R_{G}$ a product of cyclotomic polynomials (giving the cyclotomic graphs)? (b) when does $R_{G}$ have the minimal polynomial of a Salem number as its only non-cyclotomic factor (the non-trivial Salem graphs)? Cyclotomic graphs were classified by Smith (Combinatorial structures and their applications, Proceedings of Calgary International Conference, Calgary, AB, 1969 (eds R. Guy, H. Hanani, H. Saver and J. Schönheim; Gordon and Breach, New York, 1970) 403–406); the maximal connected ones are known as Smith graphs. Salem graphs are ‘spectrally close’ to being cyclotomic, in that nearly all their eigenvalues are in the critical interval $[-2,2]$. On the other hand, Salem graphs do not need to be ‘combinatorially close’ to being cyclotomic: the largest cyclotomic induced subgraph might be comparatively tiny.

We define an $m$-Salem graph to be a connected Salem graph $G$ for which $m$ is minimal such that there exists an induced cyclotomic subgraph of $G$ that has $m$ fewer vertices than $G$. The $1$-Salem subgraphs are both spectrally close and combinatorially close to being cyclotomic. Moreover, every Salem graph contains a $1$-Salem graph as an induced subgraph, so these $1$-Salem graphs provide some necessary substructure of all Salem graphs. The main result of this paper is a complete combinatorial description of all $1$-Salem graphs: in the non-bipartite case there are $25$ infinite families and $383$ sporadic examples.

We describe an online database of number fields which accompanies this paper. The database centers on complete lists of number fields with prescribed invariants. Our description here focuses on summarizing tables and connections to theoretical issues of current interest.