11,205 research outputs found

    BoRa Jeong, Violin

    Get PDF
    Sonata for Piano and Violin No. 2 in G, Op. 13 / Edvard Grieg; String Duo for Violin and Viola in G major, K. 423 / W.A. Mozart; Liebesleid / Fritz Kreisler; Liebesfreud / Fritz Kreisle

    Annie Hyojeong Jeong, Violin

    Get PDF
    Piano Trio in B-flat major, Op. 97 Archduke / Ludwing van Beethoven; *Not performed on recording: Sonata for Piano and Violin No. 8 in G major, Op. 30 No.

    Annie Hyojeong Jeong, Violin

    Get PDF
    Sonata for Piano and Violin in G Major, K. 301 / Wolfgang Amadeus Mozart; Solo Violin Partita No. 3 in E Major, BWV 1006 / Johann Sebastian Bach; Violin Concerto in D Major, Op 35 / Pyotr Ilyich Tchaikovsk

    List Distinguishing Parameters of Trees

    Full text link
    A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D(G), is the minimum number of colors in a distinguishing coloring of G. The distinguishing chromatic number of G, chi_D(G), is the minimum number of colors in a distinguishing coloring of G that is also a proper coloring. Recently the notion of a distinguishing coloring was extended to that of a list distinguishing coloring. Given an assignment L= {L(v) : v in V(G)} of lists of available colors to the vertices of G, we say that G is (properly) L-distinguishable if there is a (proper) distinguishing coloring f of G such that f(v) is in L(v) for all v. The list distinguishing number of G, D_l(G), is the minimum integer k such that G is L-distinguishable for any list assignment L with |L(v)| = k for all v. Similarly, the list distinguishing chromatic number of G, denoted chi_{D_l}(G) is the minimum integer k such that G is properly L-distinguishable for any list assignment L with |L(v)| = k for all v. In this paper, we study these distinguishing parameters for trees, and in particular extend an enumerative technique of Cheng to show that for any tree T, D_l(T) = D(T), chi_D(T)=chi_{D_l}(T), and chi_D(T) <= D(T) + 1.Comment: 10 page

    Common Fixed Point Theorems under Rational Inequality

    Get PDF
    In this paper we establish common fixed point theorems for two pairs of self maps in a complete metric space by using occasionally weakly biased maps satisfying the property (E.A.) using contraction  condition involving rational expressions.  These results partially generalize  Pachpatte [10], Jeong and Rhoades [5] and Kameswari [9]. Keywords: Weakly compatible, occasionally weakly compatible, property (E.A), coincidence point, point of coincidence, common fixed point. AMS (2010) Mathematics Subject Classifications: 47H10

    On the maximum number of rational points on singular curves over finite fields

    Full text link
    We give a construction of singular curves with many rational points over finite fields. This construction enables us to prove some results on the maximum number of rational points on an absolutely irreducible projective algebraic curve defined over Fq of geometric genus g and arithmetic genus π\pi
    • …
    corecore