Our aim in this paper is to identify the limit behavior of the solutions of random degenerate equations of the form −div Aε(x′,∇Uε)+ρεω(x′)Uε=F with mixed boundary conditions on Ωε whenever ε→0, where Ωε is an N-dimensional thin domain with a small thickness h(ε), ρεω(x′)=ρω(x′/ε), where ρω is the realization of a random function ρ(ω) , and Aε(x′,ξ)=a(Tx′ /εω,ξ) , the map a(ω,ξ) being measurable in ω and satisfying degenerated structure conditions with weight ρ in ξ. As usual in dimension reduction problems, we focus on the rescaled equations and we prove that under the condition h(ε)/ε→0 , the sequence of solutions of them converges to a limit u0, where u0 is the solution of an (N−1) -dimensional limit problem with homogenized and auxiliary equations.

We investigate existence and uniqueness of p-means ep and the median e1 of a probability measure μ on a Finsler manifold, in relation with the convexity of the support of μ. We prove that ep is the limit point of a continuous time gradient flow. Under some additional condition which is always satisfied for p≥2, a discretization of this path converges to ep. This provides an algorithm for determining the Finsler center points.

Let G be a group generated by k elements, G=〈g1,…,gk〉, with group operations (multiplication, inversion and comparison with identity) performed by a black box. We prove that one can test whether the group G is abelian at a cost of O(k) group operations. On the other hand, we show that a deterministic approach requires Ω(k2) group operations.

Let p and r be two primes, and let n and m be two distinct divisors of pr. Consider Φn and Φm, the nth and mth cyclotomic polynomials. In this paper, we present lower and upper bounds for the coefficients of the inverse of Φn modulo Φm and discuss an application to torus-based cryptography.

The existence of products of three pairwise coprime integers is investigated in short intervals of the form . A general theorem is proved which shows that such integer products exist provided there is a bound on the product of any two of them. A particular case of relevance to elliptic curve cryptography, where all three integers are of order , is presented as a corollary to this result.

We perform an almost sure linear stability analysis of the θ-Maruyama method, selecting as our test equation a two-dimensional system of Itô differential equations with diagonal drift coefficient and two independent stochastic perturbations which capture the stabilising and destabilising roles of feedback geometry in the almost sure asymptotic stability of the equilibrium solution. For small values of the constant step-size parameter, we derive close-to-sharp conditions for the almost sure asymptotic stability and instability of the equilibrium solution of the discretisation that match those of the original test system. Our investigation demonstrates the use of a discrete form of the Itô formula in the context of an almost sure linear stability analysis.

We test R. van Luijk’s method for computing the Picard group of a K3 surface. The examples considered are the resolutions of Kummer quartics in ℙ3. Using the theory of abelian varieties, the Picard group may be computed directly in this case. Our experiments show that the upper bounds provided by van Luijk’s method are sharp when sufficiently many primes are used. In fact, there are a lot of primes that yield a value close to the exact one. However, for many but not all Kummer surfaces V of Picard rank 18, we have for a set of primes of density at least 1/2.

We construct and classify all groups given by triangular presentations associated to the smallest thick generalized quadrangle that act simply transitively on the vertices of hyperbolic triangular buildings of the smallest non-trivial thickness. Our classification yields 23 non-isomorphic torsion-free groups (which were obtained in an earlier work) and 168 non-isomorphic torsion groups acting on one of two possible buildings with the smallest thick generalized quadrangle as the link of each vertex. In analogy with the case, we find both torsion and torsion-free groups acting on the same building.

Let χ be the primitive Dirichlet character of conductor 49 defined by χ(3)=ζ for ζ a primitive 42nd root of unity. We explicitly compute the slopes of the U7 operator acting on the space of overconvergent modular forms on X1(49) with weight k and character χ7k−6 or χ8−7k, depending on the embedding of ℚ(ζ) into ℂ7. By applying results of Coleman and of Cohen and Oesterlé, we are then able to deduce the slopes of U7 acting on all classical Hecke newforms of the same weight and character.

We present an efficient algorithm for the condensation of homomorphism spaces. This provides an improvement over the known tensor condensation method which is essentially due to a better choice of bases. We explain the theory behind this approach and describe the implementation in detail. Finally, we give timings to compare with previous methods.

We study the equation a2−2b6=cp and its specialization a2−2=cp, where p is a prime, using the modular method. In particular, we use a ℚ-curve defined over for which the solution (a,b,c)=(±1,±1,−1) gives rise to a CM-form. This allows us to apply the modular method to resolve the equation a2−2b6=cp for p in certain congruence classes. For the specialization a2−2=cp, we use the multi-Frey technique of Siksek to obtain further refined results.

Given a prime q and a negative discriminant D, the CM method constructs an elliptic curve E/Fq by obtaining a root of the Hilbert class polynomial HD(X) modulo q. We consider an approach based on a decomposition of the ring class field defined by HD, which we adapt to a CRT setting. This yields two algorithms, each of which obtains a root of HD mod q without necessarily computing any of its coefficients. Heuristically, our approach uses asymptotically less time and space than the standard CM method for almost all D. Under the GRH, and reasonable assumptions about the size of log q relative to ∣D∣, we achieve a space complexity of O((m+n)log q) bits, where mn=h(D) , which may be as small as O(∣D∣1/4 log q) . The practical efficiency of the algorithms is demonstrated using ∣D∣>1016 and q≈2256, and also ∣D∣>1015 and q≈233220. These examples are both an order of magnitude larger than the best previous results obtained with the CM method.

We describe an effective algorithm to compute a set of representatives for the conjugacy classes of Hall subgroups of a finite permutation or matrix group. Our algorithm uses the general approach of the so-called ‘trivial Fitting model’.

We present an improved algorithm for the computation of Zariski chambers on algebraic surfaces. The new algorithm significantly outperforms the currently available method and therefore allows us to treat surfaces of high Picard number, where huge numbers of chambers occur. As an application, we efficiently compute the number of chambers supported by the lines on the Segre–Schur quartic.

We introduce the computer algebra package PyCox, written entirely in the Python language. It implements a set of algorithms, in a spirit similar to the older CHEVIE system, for working with Coxeter groups and Hecke algebras. This includes a new variation of the traditional algorithm for computing Kazhdan–Lusztig cells and W-graphs, which works efficiently for all finite groups of rank ≤8 (except E8). We also discuss the computation of Lusztig’s leading coefficients of character values and distinguished involutions (which works for E8 as well). Our experiments suggest a re-definition of Lusztig’s ‘special’ representations which, conjecturally, should also apply to the unequal parameter case. Supplementary materials are available with this article.

We determine the 2-modular and 3-modular character tables of the sporadic simple Harada–Norton group and its automorphism group.

The chromatic polynomial P(G,λ) gives the number of ways a graph G can be properly coloured in at most λ colours. This polynomial has been extensively studied in both combinatorics and statistical physics, but there has been little work on its algebraic properties. This paper reports a systematic study of the Galois groups of chromatic polynomials. We give a summary of the Galois groups of all chromatic polynomials of strongly non-clique-separable graphs of order at most 10 and all chromatic polynomials of non-clique-separable θ-graphs of order at most 19. Most of these chromatic polynomials have symmetric Galois groups. We give five infinite families of graphs: one of these families has chromatic polynomials with a dihedral Galois group and two of these families have chromatic polynomials with cyclic Galois groups. This includes the first known infinite family of graphs that have chromatic polynomials with the cyclic Galois group of order 3.

We prove that under any projective embedding of an abelian variety A of dimension g, a complete set of addition laws has cardinality at least g+1, generalizing a result of Bosma and Lenstra for the Weierstrass model of an elliptic curve in ℙ2. In contrast, we prove, moreover, that if k is any field with infinite absolute Galois group, then there exists for every abelian variety A/k a projective embedding and an addition law defined for every pair of k-rational points. For an abelian variety of dimension 1 or 2, we show that this embedding can be the classical Weierstrass model or the embedding in ℙ15, respectively, up to a finite number of counterexamples for ∣k∣≤5 .

Given an elliptic curve E over a field of positive characteristic p, we consider how to efficiently determine whether E is ordinary or supersingular. We analyze the complexity of several existing algorithms and then present a new approach that exploits structural differences between ordinary and supersingular isogeny graphs. This yields a simple algorithm that, given E and a suitable non-residue in 𝔽p2, determines the supersingularity of E in O(n3log 2n) time and O(n) space, where n=O(log p) . Both these complexity bounds are significant improvements over existing methods, as we demonstrate with some practical computations.

From power series expansions of functions on curves over finite fields, one can obtain sequences with perfect or almost perfect linear complexity profile. It has been suggested by various authors to use such sequences as key streams for stream ciphers. In this work, we show how long parts of such sequences can be computed efficiently from short ones. Such sequences should therefore be considered to be cryptographically weak. Our attack leads in a natural way to a new measure of the complexity of sequences which we call expansion complexity.