scholarly journals The point decomposition problem over hyperelliptic curves

2017 ◽  
Vol 86 (10) ◽  
pp. 2279-2314
Author(s):  
Jean-Charles Faugère ◽  
Alexandre Wallet
2015 ◽  
Vol 2015 ◽  
pp. 1-6
Author(s):  
Seungkook Park

We present an infinite family of hyperelliptic curves of genus two over a finite field of even characteristic which are suitable for the vector decomposition problem.


2015 ◽  
Vol 18 (1) ◽  
pp. 258-265 ◽  
Author(s):  
Jennifer S. Balakrishnan

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.


2008 ◽  
Vol 2 (8) ◽  
pp. 859-885 ◽  
Author(s):  
Yann Bugeaud ◽  
Maurice Mignotte ◽  
Samir Siksek ◽  
Michael Stoll ◽  
Szabolcs Tengely

1934 ◽  
Vol 30 (2) ◽  
pp. 170-177 ◽  
Author(s):  
J. Bronowski

The surfaces whose prime-sections are hyperelliptic curves of genus p have been classified by G. Castelnuovo. If p > 1, they are the surfaces which contain a (rational) pencil of conics, which traces the on the prime-sections. Thus, if we exclude ruled surfaces, they are rational surfaces. The supernormal surfaces are of order 4p + 4 and lie in space [3p + 5]. The minimum directrix curve to the pencil of conics—that is, the curve of minimum order which meets each conic in one point—may be of any order k, where 0 ≤ k ≤ p + 1. The prime-sections of these surfaces are conveniently represented on the normal rational ruled surfaces, either by quadric sections, or by quadric sections residual to a generator, according as k is even or odd.


2005 ◽  
Vol 16 (05) ◽  
pp. 897-912 ◽  
Author(s):  
MICHAEL DOMARATZKI ◽  
KAI SALOMAA

The decidability of the shuffle decomposition problem for regular languages is a long standing open question. We consider decompositions of regular languages with respect to shuffle along a regular set of trajectories and obtain positive decidability results for restricted classes of trajectories. Also we consider decompositions of unary regular languages. Finally, we establish in the spirit of the Dassow-Hinz undecidability result an undecidability result for regular languages shuffled along a fixed linear context-free set of trajectories.


Sign in / Sign up

Export Citation Format

Share Document