Zobrazeno 1 - 10
of 4 339
pro vyhledávání: '"Rawson, P."'
Graph neural networks (GNNs) have recently been adapted to temporal settings, often employing temporal versions of the message-passing mechanism known from GNNs. We divide temporal message passing mechanisms from literature into two main types: globa
Externí odkaz:
http://arxiv.org/abs/2408.09918
Autor:
Rawson, James
The distribution of degree $d$ points on curves is well understood, especially for low degrees. We refine this study to include information on the Galois group in the simplest interesting case: $d = 3$. For curves of genus at least 5, we show cubic p
Externí odkaz:
http://arxiv.org/abs/2405.13743
We present the CheckMate tool for automated verification of game-theoretic security properties, with application to blockchain protocols. CheckMate applies automated reasoning techniques to determine whether a game-theoretic protocol model is game-th
Externí odkaz:
http://arxiv.org/abs/2403.10310
Autor:
Rawson, James
Bjorn Poonen asked whether there exists a polynomial giving a surjection $\mathbb{Z} \times \mathbb{Z} \to \mathbb{N}$. We answer this question in the negative, conditional on a conjecture of Vojta. More precisely, we show that if such a function exi
Externí odkaz:
http://arxiv.org/abs/2403.09440
Publikováno v:
International Conference on Automated Deduction (CADE) 2023. LNAI volume 14132, 2023, pp. 23-40
Classically, in saturation-based proof systems, unification has been considered atomic. However, it is also possible to move unification to the calculus level, turning the steps of the unification algorithm into inferences. For calculi that rely on u
Externí odkaz:
http://arxiv.org/abs/2403.04775
Rewriting techniques based on reduction orderings generate "just enough" consequences to retain first-order completeness. This is ideal for superposition-based first-order theorem proving, but for at least one approach to inductive reasoning we show
Externí odkaz:
http://arxiv.org/abs/2402.19199
Autor:
Rawson, James
We develop an effective algorithm to compute the derivative of a Bianchi modular form with respect to weight space as it varies in a $p$-adic family. This method is entirely local at the modular form, and does not compute the family anywhere outside
Externí odkaz:
http://arxiv.org/abs/2402.13799
We propose a new encoding of the first-order connection method as a Boolean satisfiability problem. The encoding eschews tree-like presentations of the connection method in favour of matrices, as we show that tree-like calculi have a number of drawba
Externí odkaz:
http://arxiv.org/abs/2402.10610
Publikováno v:
Automated Deduction -- CADE 29 (2023). Lecture Notes in Computer Science vol 14132. Springer
Subsumption resolution is an expensive but highly effective simplifying inference for first-order saturation theorem provers. We present a new SAT-based reasoning technique for subsumption resolution, without requiring radical changes to the underlyi
Externí odkaz:
http://arxiv.org/abs/2401.17832
Autor:
Lupoian, Elvira, Rawson, James
In this paper we give an algorithm to find the 3-torsion subgroup of the Jacobian of a smooth plane quartic curve. We describe $3-$torsion points in terms of cubics which triply intersect the curve, and use this to define a system of equations whose
Externí odkaz:
http://arxiv.org/abs/2401.13577