Displaying similar documents to “Weierstrass points on trigonal curves of genus five”

Rational points on X 0 + ( N ) and quadratic -curves

Steven D. Galbraith (2002)

Journal de théorie des nombres de Bordeaux

Similarity:

The rational points on X 0 ( N ) / W N in the case where N is a composite number are considered. A computational study of some of the cases not covered by the results of Momose is given. Exceptional rational points are found in the cases N = 91 and N = 125 and the j -invariants of the corresponding quadratic -curves are exhibited.

Galois covers between K 3 surfaces

Gang Xiao (1996)

Annales de l'institut Fourier

Similarity:

We give a classification of finite group actions on a K 3 surface giving rise to K 3 quotients, from the point of view of their fixed points. It is shown that except two cases, each such group gives rise to a unique type of fixed point set.

CAPS in Z(2,n)

Kurz, Sascha (2009)

Serdica Journal of Computing

Similarity:

We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.

Knowledge discovery in data using formal concept analysis and random projections

Cherukuri Aswani Kumar (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper our objective is to propose a random projections based formal concept analysis for knowledge discovery in data. We demonstrate the implementation of the proposed method on two real world healthcare datasets. Formal Concept Analysis (FCA) is a mathematical framework that offers a conceptual knowledge representation through hierarchical conceptual structures called concept lattices. However, during the design of a concept lattice, complexity plays a major role.

Solving the Task Assignment Problem with a Variable Neighborhood Search

Kratica, Jozef, Savić, Aleksandar, Filipović, Vladimir, Milanović, Marija (2010)

Serdica Journal of Computing

Similarity:

In this paper a variable neighborhood search (VNS) approach for the task assignment problem (TAP) is considered. An appropriate neighborhood scheme along with a shaking operator and local search procedure are constructed specifically for this problem. The computational results are presented for the instances from the literature, and compared to optimal solutions obtained by the CPLEX solver and heuristic solutions generated by the genetic algorithm. It can be seen that the proposed...