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.

let $g$ be a $p$-group of order $p^n$ and $phi$=$phi(g)$ be the frattini subgroup of $g$. it is shown that the nilpotency class of $autf(g)$, the group of all automorphisms of $g$ centralizing $g/ fr(g)$, takes the maximum value $n-2$ if and only if $g$ is of maximal class. we also determine the nilpotency class of $autf(g)$ when $g$ is a finite abelian $p$-group.

‎‎Set X = { M11‎, ‎M12‎, ‎M22‎, ‎M23‎, ‎M24‎, ‎Zn‎, ‎T4n‎, ‎SD8n‎, ‎Sz(q)‎, ‎G2(q)‎, ‎V8n}‎, where M11‎, M12‎, M22‎, ‎M23‎, ‎M24 are Mathieu groups and Zn‎, T4n‎, SD8n‎, ‎Sz(q)‎, G2(q) and V8n denote the cyclic‎, ‎dicyclic‎, ‎semi-dihedral‎, ‎Suzuki‎, ‎Ree and a group of order 8n presented by                                      V8n = < a‎, ‎b | a^{2n} = b^{4} = e‎, ‎ aba = b^{-1}‎, ‎ab^{...

Let A be a finite subset of the group Z2. Let C = {c0, c1, . . . , cs−1} be a finite set of s distinct points in the plane. For every 0 ≤ i ≤ s− 1, we define Di = {a− a′ : a ∈ A, a′ ∈ A, a + a′ = 2ci} and Rs(A) = |D0 ∪D1 ∪ · · · ∪ Ds−1|. In [1, 2], we found the maximal value of Rs(A) in cases s = 1, s = 2 and s = 3 and studied the structure of A assuming that R3(A) is equal or close to its maxi...

The n-dimensional hypercube Qn has many maximal independent sets of vertices. We study the cardinality of those maximal independent sets which are balanced , i.e. exactly half of whose vertices have even weight, obtaining both upper and lower bounds for the maximum value. For n ≤ 7 we obtain the exact value. For all odd n, we conjecture that the exact value is 2n−1 − ( n−1 (n−1)/2 ) . We also c...

There are two basic theorems. Let G be a strong parapolar space with these three properties: (1) For each point x and symplecton S, x is collinear to some point of S. (2) The set of points at distance at most two from a point forms a geometric hyperplane. (3) If every symplecton has rank at least three, every maximal singular subspace has finite projective rank. Then G is either D6; 6;A5; 3 or ...

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

Reshef et al. presented a novel measure of dependence the maximal information coefficient (MIC) aimed to capture a wide range of associations between pairs of variables, and a statistical test for independence based on MIC. They defined a concept of equitability and claim that non-equitable methods are less practical for data exploration. By simple power comparisons, we show that this conclusio...

Reshef et al. presented a novel measure of dependence the maximal information coefficient (MIC) aimed to capture a wide range of associations between pairs of variables, and a statistical test for independence based on MIC. They defined a concept of equitability and claim that non-equitable methods are less practical for data exploration. By simple power comparisons, we show that this conclusio...