143,302 research outputs found

    Remark on a Paper of Yu on Heilbronn's Exponential Sum

    Get PDF
    AbstractWe show that Sh(a)=∑pn=1e(anhp/p2)⪡(h, p−1)11/16p7/8, sharpening a result of Yu

    Producing innovation: Comments on Lee and Yu (2010)

    Get PDF
    The purpose of the article being reviewed (Lee and Yu, 2010), a survey by questionnaire with 182 valid responses, is to analyze “how different relationship styles of employees in the hi-tech industry influence innovation performance” and indeed its conclusions are that “the relationship style of an organization has a significant positive effect on innovation performance”. We see Lee and Yu (2010) as being similar to another highly cited article by Morgan and Hunt in so far as both articles are about relationships, cooperation and trust

    Reply to "Comment on 'Topological stability of the half-vortices in spinor exciton-polariton condensates'"

    Full text link
    In a recent work [H. Flayac, I.A. Shelykh, D.D. Solnyshkov and G. Malpuech, Phys. Rev. B 81, 045318 (2010)], we have analyzed the effect of the TE-TM splitting on the stability of the exciton-polariton vortex states. We considered classical vortex solutions having cylindrical symmetry and we found that the so-called half-vortex states [Yu. G. Rubo, Phys. Rev. Lett. 99, 106401 (2007)] are not solutions of the stationary Gross-Pitaevskii equation. In their Comment [M. Toledo Solano, Yu.G. Rubo, Phys. Rev. B 82, 127301 (2010)], M. Toledo Solano and Yuri G. Rubo claim that this conclusion is misleading and pretend to demonstrate the existence of static half-vortices in an exciton-polariton condensate in the presence of TE-TM splitting. In this reply we explain why this assertion is not demonstrated satisfactorily.Comment: 3 Pages, no figur

    Triangles in graphs without bipartite suspensions

    Full text link
    Given graphs TT and HH, the generalized Tur\'an number ex(n,T,H)(n,T,H) is the maximum number of copies of TT in an nn-vertex graph with no copies of HH. Alon and Shikhelman, using a result of Erd\H os, determined the asymptotics of ex(n,K3,H)(n,K_3,H) when the chromatic number of HH is greater than 3 and proved several results when HH is bipartite. We consider this problem when HH has chromatic number 3. Even this special case for the following relatively simple 3-chromatic graphs appears to be challenging. The suspension H^\widehat H of a graph HH is the graph obtained from HH by adding a new vertex adjacent to all vertices of HH. We give new upper and lower bounds on ex(n,K3,H^)(n,K_3,\widehat{H}) when HH is a path, even cycle, or complete bipartite graph. One of the main tools we use is the triangle removal lemma, but it is unclear if much stronger statements can be proved without using the removal lemma.Comment: New result about path with 5 edges adde
    corecore