We investigated maximal Prym varieties on finite fields by attaining their upper bounds on the number of rational points. This concept gave us a motivation for defining a generalized definition of maximal curves i.e. maximal morphisms. By MAGMA, we give some non-trivial examples of maximal morphisms that results in non-trivial examples of maximal Prym varieties.

background numerous studies were carried out to develop more sophisticated dressings to expedite healing processes and diminish the bacterial burden in burn wounds. this study assessed the healing effect of nettle extract on second degree burns wound in rats in comparison with silver sulfadiazine and vaseline. methods forty rats were randomly assigned to four equal groups. a deep second-degree ...

We classify, up to isomorphism, maximal curves covered by the Hermit-ian curve H by a prime degree Galois covering. We also compute the genus of maximal curves obtained by the quotient of H by several automorphisms groups. Finally we discuss the value for the third largest genus that a maximal curve can have.

Abstract We study the size of shadow k -uniform hypergraphs with bounded degree. Lower bounds on ratio and hypergraph are given as a function degree bound . show that cliques extremal for long range bounds, but not every bound. give general, sharp lower show, sometimes we can get by deleting disjoint maximal matchings from clique

In this paper a brief historical survey of the development of quadrature rules with multiple nodes and the maximal algebraic degree of exactness is given. The natural generalization of such rules are quadrature rules with multiple nodes and the maximal degree of exactness in some functional spaces that are different from the space of algebraic polynomial. For that purpose we present a generaliz...

Maximization of the entropy rate is an important issue to design diffusion processes aiming at a well-mixed state. We demonstrate that it is possible to construct maximal-entropy random walks with only local information on the graph structure. In particular, we show that an almost maximal-entropy random walk is obtained when the step probabilities are proportional to a power of the degree of th...