Angeline Rao

Learn More
This paper shows that the general hypersurface of degree ≥ 6 in projective four space cannot support an indecom-posable rank two vector bundle which is Arithmetically Cohen-Macaulay and four generated. Equivalently, the equation of the hypersurface is not the Pfaffian of a four by four minimal skew-symmetric matrix.
a r t i c l e i n f o a b s t r a c t An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of +1 or −1, and each adjacency is signed the negative of the product of the incidences. An oriented hypergraph is balanced if the product of the adjacencies in each circle is positive. We provide a combinatorial interpretation for(More)
The asymptotic behavior of solutions of Volterra integro-differential equations of the form f* x'(t) = A(t)x(t) + K(t,s)x(s)ds + F(t) Jo is discussed in which A is not necessarily a stable matrix. An equivalent equation which involves an arbitrary function is derived and a proper choice of this function would pave a way for the new coefficient matrix B(More)
On P 3 , we show that mathematical instantons in characteristic two are unobstructed. We produce upper bounds for the dimension of the moduli space of stable rank two bundles on P 3 in characteristic two. In cases where there is a phenomenon of good reduction modulo two, these give similar results in characteristic zero. We also give an example of a(More)
This research represents a novel identification of gender by using different features of fingerprints. Fingerprints are the biometric system provides an automatic recognition of an individual based on some unique features of an individual. Gender classification using fingerprints can be done by using spatial domain approach or frequency domain approach or(More)
Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An n-ary Huffman tree is a connected, cycle-lacking graph where each vertex can have either n " children " vertices connecting to it, or 0 children. Vertices with 0 children are called leaves. We let(More)