3,531 research outputs found
Solving Sparse Integer Linear Systems
We propose a new algorithm to solve sparse linear systems of equations over
the integers. This algorithm is based on a -adic lifting technique combined
with the use of block matrices with structured blocks. It achieves a sub-cubic
complexity in terms of machine operations subject to a conjecture on the
effectiveness of certain sparse projections. A LinBox-based implementation of
this algorithm is demonstrated, and emphasizes the practical benefits of this
new method over the previous state of the art
A Generic Approach to Searching for Jacobians
We consider the problem of finding cryptographically suitable Jacobians. By
applying a probabilistic generic algorithm to compute the zeta functions of low
genus curves drawn from an arbitrary family, we can search for Jacobians
containing a large subgroup of prime order. For a suitable distribution of
curves, the complexity is subexponential in genus 2, and O(N^{1/12}) in genus
3. We give examples of genus 2 and genus 3 hyperelliptic curves over prime
fields with group orders over 180 bits in size, improving previous results. Our
approach is particularly effective over low-degree extension fields, where in
genus 2 we find Jacobians over F_{p^2) and trace zero varieties over F_{p^3}
with near-prime orders up to 372 bits in size. For p = 2^{61}-1, the average
time to find a group with 244-bit near-prime order is under an hour on a PC.Comment: 22 pages, to appear in Mathematics of Computatio
Modular Las Vegas Algorithms for Polynomial Absolute Factorization
Let f(X,Y) \in \ZZ[X,Y] be an irreducible polynomial over \QQ. We give a
Las Vegas absolute irreducibility test based on a property of the Newton
polytope of , or more precisely, of modulo some prime integer . The
same idea of choosing a satisfying some prescribed properties together with
is used to provide a new strategy for absolute factorization of .
We present our approach in the bivariate case but the techniques extend to the
multivariate case. Maple computations show that it is efficient and promising
as we are able to factorize some polynomials of degree up to 400
-adic Mellin Amplitudes
In this paper, we propose a -adic analog of Mellin amplitudes for scalar
operators, and present the computation of the general contact amplitude as well
as arbitrary-point tree-level amplitudes for bulk diagrams involving up to
three internal lines, and along the way obtain the -adic version of the
split representation formula. These amplitudes share noteworthy similarities
with the usual (real) Mellin amplitudes for scalars, but are also significantly
simpler, admitting closed-form expressions where none are available over the
reals. The dramatic simplicity can be attributed to the absence of descendant
fields in the -adic formulation.Comment: 60 pages, several figures. v2: Minor typos fixed, references adde
Tensor network and (-adic) AdS/CFT
We use the tensor network living on the Bruhat-Tits tree to give a concrete
realization of the recently proposed -adic AdS/CFT correspondence (a
holographic duality based on the -adic number field ). Instead
of assuming the -adic AdS/CFT correspondence, we show how important features
of AdS/CFT such as the bulk operator reconstruction and the holographic
computation of boundary correlators are automatically implemented in this
tensor network.Comment: 59 pages, 18 figures; v3: improved presentation, added figures and
reference
- …