The Coleman integral is a $p$ -adic line integral that encapsulates various quantities of number theoretic interest. Building on the work of Harrison [J. Symbolic Comput. 47 (2012) no. 1, 89–101], we extend the Coleman integration algorithms in Balakrishnan et al. [Algorithmic number theory, Lecture Notes in Computer Science 6197 (Springer, 2010) 16–31] and Balakrishnan [ANTS-X: Proceedings of the Tenth Algorithmic Number Theory Symposium, Open Book Series 1 (Mathematical Sciences Publishers, 2013) 41–61] to even-degree models of hyperelliptic curves. We illustrate our methods with numerical examples computed in Sage.

For an elliptic curve $E/\mathbb{Q}$ without complex multiplication we study the distribution of Atkin and Elkies primes $\ell$ , on average, over all good reductions of $E$ modulo primes $p$ . We show that, under the generalized Riemann hypothesis, for almost all primes $p$ there are enough small Elkies primes $\ell$ to ensure that the Schoof–Elkies–Atkin point-counting algorithm runs in $(\log p)^{4+o(1)}$ expected time.

We present a computer algebra package based onMagma for performing computations in rational Cherednik algebras with arbitrary parameters and in Verma modules for restricted rational Cherednik algebras. Part of this package is a new general Las Vegas algorithm for computing the head and the constituents of a module with simple head in characteristic zero, which we develop here theoretically. This algorithm is very successful when applied to Verma modules for restricted rational Cherednik algebras and it allows us to answer several questions posed by Gordon in some specific cases. We can determine the decomposition matrices of the Verma modules, the graded $G$ -module structure of the simple modules, and the Calogero–Moser families of the generic restricted rational Cherednik algebra for around half of the exceptional complex reflection groups. In this way we can also confirm Martino’s conjecture for several exceptional complex reflection groups.

Supplementary materials are available with this article.

Here we determine up to conjugacy all the maximal subgroups of the finite exceptional group of Lie-type $E_{7}(2)$ .

Supplementary materials are available with this article.

Our main purpose in this paper is to propose the piecewise Legendre spectral-collocation method to solve Volterra integro-differential equations. We provide convergence analysis to show that the numerical errors in our method decay in $h^{m}N^{-m}$ -version rate. These results are better than the piecewise polynomial collocation method and the global Legendre spectral-collocation method. The provided numerical examples confirm these theoretical results.

We construct explicit bases for spaces of overconvergent $p$ -adic modular forms when $p=2,3$ and study their interaction with the Atkin operator. This results in an extension of Lauder’s algorithms for overconvergent modular forms. We illustrate these algorithms with computations of slope sequences of some $2$ -adic eigencurves and the construction of Chow–Heegner points on elliptic curves via special values of Rankin triple product L-functions.

Bertrand Russell offered an influential paradox of propositions in Appendix B of The Principles of Mathematics, but there is little agreement as to what to conclude from it. We suggest that Russell’s paradox is best regarded as a limitative result on propositional granularity. Some propositions are, on pain of contradiction, unable to discriminate between classes with different members: whatever they predicate of one, they predicate of the other. When accepted, this remarkable fact should cast some doubt upon some of the uses to which modern descendants of Russell’s paradox of propositions have been put in recent literature.

This paper focuses on an infinite-server queue modulated by an independently evolving finite-state Markovian background process, with transition rate matrix Q≡(q ij )i,j=1 d . Both arrival rates and service rates are depending on the state of the background process. The main contribution concerns the derivation of central limit theorems (CLTs) for the number of customers in the system at time t≥0, in the asymptotic regime in which the arrival rates λi are scaled by a factor N, and the transition rates q ij by a factor N α, with α∈ℝ+. The specific value of α has a crucial impact on the result: (i) for α>1 the system essentially behaves as an M/M/∞ queue, and in the CLT the centered process has to be normalized by √N; (ii) for α<1, the centered process has to be normalized by N 1−α/2, with the deviation matrix appearing in the expression for the variance.

Is evidential support transitive? The answer is negative when evidential support is understood as confirmation so that X evidentially supports Y if and only if p(Y | X) > p(Y). I call evidential support so understood “support” (for short) and set out three alternative ways of understanding evidential support: support-t (support plus a sufficiently high probability), support-t* (support plus a substantial degree of support), and support-tt* (support plus both a sufficiently high probability and a substantial degree of support). I also set out two screening-off conditions (under which support is transitive): SOC1 and SOC2. It has already been shown that support-t is non-transitive in the general case (where it is not required that SOC1 holds and it is not required that SOC2 holds), in the special case where SOC1 holds, and in the special case where SOC2 holds. I introduce two rather weak adequacy conditions on support measures and argue that on any support measure meeting those conditions it follows that neither support-t* nor support-tt* is transitive in the general case, in the special case where SOC1 holds, or in the special case where SOC2 holds. I then relate some of the results to Douven’s evidential support theory of conditionals along with a few rival theories.

To expand the toolbox available to network science, we study the isomorphism between distance and Fuzzy (proximity or strength) graphs. Distinct transitive closures in Fuzzy graphs lead to closures of their isomorphic distance graphs with widely different structural properties. For instance, the All Pairs Shortest Paths (APSP) problem, based on the Dijkstra algorithm, is equivalent to a metric closure, which is only one of the possible ways to calculate shortest paths in weighted graphs. We show that different closures lead to different distortions of the original topology of weighted graphs. Therefore, complex network analyses that depend on the calculation of shortest paths on weighted graphs should take into account the closure choice and associated topological distortion. We characterize the isomorphism using the max-min and Dombi disjunction/conjunction pairs. This allows us to: (1) study alternative distance closures, such as those based on diffusion, metric, and ultra-metric distances; (2) identify the operators closest to the metric closure of distance graphs (the APSP), but which are logically consistent; and (3) propose a simple method to compute alternative path length measures and corresponding distance closures using existing algorithms for the APSP. In particular, we show that a specific diffusion distance is promising for community detection in complex networks, and is based on desirable axioms for logical inference or approximate reasoning on networks; it also provides a simple algebraic means to compute diffusion processes on networks. Based on these results, we argue that choosing different distance closures can lead to different conclusions about indirect associations on network data, as well as the structure of complex networks, and are thus important to consider.

We show that overshoots over Erlang random variables give rise to a natural generalization of the stationary excess operator and its iterates. The new operators can be used to derive expansions for the expectation Eg(X) of a non-negative random variable, similar to Taylor-like expansions encountered when studying stationary excess operators.

Alternating renewal processes have been widely used to model social and scientific phenomenal where independent “on” and “off” states alternate. In this paper, we study a model where the value of a process cumulates and declines according to two modes of compound Poisson processes with respect to an underlying alternating renewal process. The model discussed in the present paper can be used as a revenue management model applied to inventory or to finance. The exact distribution of the process is derived as well as the double Laplace transform with respect to the level and time of the process.