Administrative Appeal in Serbian Law
This paper addresses the issues of concept, features and place of the administrative appeal in Serbian administrative law. Special attention is given to the relation between administrative appeal and judicial review of administrative acts. The paper is part of a wider analysis regarding the effectiveness of administrative appeals in the framework of administrative justice on European level, put forward at the EGPA Conference in Toulouse in 2010. The paper is limited to scrutiny of normative aspects of administrative appeal, with the intention to be followed by an empirical research on its effectiveness.
Serbia as a Part of the European Administrative Space: ADR Tools Applied to Administrative Law
The ADR tools in Serbian administrative law can be looked at in different ways. First, when observed together, analyzed ADR tools are efficient in reducing court workload, and second, they are not of equal importance. While administrative appeal is comprehensively regulated and highly efficient in said regard, the Ombudsman found its place in the overall system of protection of the rights and interests of private parties in their relations with the administration but both in quantitative and qualitative respect falls short in comparison to the protection the administrative appeal provides. On the other hand, mediation is only theoretically present in this legal field.
How to do a p-descent on an elliptic curve
In this paper, we describe an algorithm that reduces the computation of the (full) p-Selmer group of an elliptic curve E over a number field to standard number field computations such as determining the (p-torsion of) the S-class group and a basis of the S-units modulo pth powers for a suitable set S of primes. In particular, we give a result reducing this set S of 'bad primes' to a very small set, which in many cases only contains the primes above p. As of today, this provides a feasible algorithm for performing a full 3-descent on an elliptic curve over Q, but the range of our algorithm will certainly be enlarged by future improvements in computational algebraic number theory. When the Galois module structure of E[p] is favorable, simplifications are possible and p-descents for larger p are accessible even today. To demonstrate how the method works, several worked examples are included.