4,233 research outputs found
Artin's primitive root conjecture -a survey -
This is an expanded version of a write-up of a talk given in the fall of 2000
in Oberwolfach. A large part of it is intended to be understandable by
non-number theorists with a mathematical background. The talk covered some of
the history, results and ideas connected with Artin's celebrated primitive root
conjecture dating from 1927. In the update several new results established
after 2000 are also discussed.Comment: 87 pages, 512 references, to appear in Integer
Manufacturing a mathematical group: a study in heuristics
I examine the way a relevant conceptual novelty in mathematics, that is, the notion of group, has been constructed in order to show the kinds of heuristic reasoning that enabled its manufacturing. To this end, I examine salient aspects of the works of Lagrange, Cauchy, Galois and Cayley (Sect. 2). In more detail, I examine the seminal idea resulting from Lagrange’s heuristics and how Cauchy, Galois and Cayley develop it. This analysis shows us how new mathematical entities are generated, and also how what counts as a solution to a problem is shaped and changed. Finally, I argue that this case study shows us that we have to study inferential micro-structures (Sect. 3), that is, the ways similarities and regularities are sought, in order to understand how theoretical novelty is constructed and heuristic reasoning is put forwar
Four Loop Massless Propagators: a Numerical Evaluation of All Master Integrals
We present numerical results which are needed to evaluate all non-trivial
master integrals for four-loop massless propagators, confirming the recent
analytic results of[1]and evaluating an extra order in \ep expansion for each
master integral
Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries
We propose an efficient framework for enabling secure multi-party numerical
computations in a Peer-to-Peer network. This problem arises in a range of
applications such as collaborative filtering, distributed computation of trust
and reputation, monitoring and other tasks, where the computing nodes is
expected to preserve the privacy of their inputs while performing a joint
computation of a certain function. Although there is a rich literature in the
field of distributed systems security concerning secure multi-party
computation, in practice it is hard to deploy those methods in very large scale
Peer-to-Peer networks. In this work, we try to bridge the gap between
theoretical algorithms in the security domain, and a practical Peer-to-Peer
deployment.
We consider two security models. The first is the semi-honest model where
peers correctly follow the protocol, but try to reveal private information. We
provide three possible schemes for secure multi-party numerical computation for
this model and identify a single light-weight scheme which outperforms the
others. Using extensive simulation results over real Internet topologies, we
demonstrate that our scheme is scalable to very large networks, with up to
millions of nodes. The second model we consider is the malicious peers model,
where peers can behave arbitrarily, deliberately trying to affect the results
of the computation as well as compromising the privacy of other peers. For this
model we provide a fourth scheme to defend the execution of the computation
against the malicious peers. The proposed scheme has a higher complexity
relative to the semi-honest model. Overall, we provide the Peer-to-Peer network
designer a set of tools to choose from, based on the desired level of security.Comment: Submitted to Peer-to-Peer Networking and Applications Journal (PPNA)
200
- …