146 research outputs found

    Asymptotically Optimal Regenerating Codes Over Any Field

    Get PDF
    The study of regenerating codes has advanced tremendously in recent years. However, most known constructions require large field size and, hence, may be hard to implement in practice. By restructuring a code construction by Rashmi et al. , we obtain two explicit families regenerating codes. These codes approach the cut-set bound as the reconstruction degree increases and may be realized over any given finite field if the file size is large enough. Essentially, these codes constitute a constructive proof that the cut-set bound does not imply a field size restriction, unlike some known bounds for ordinary linear codes. The first construction attains the cut-set bound at the MBR point asymptotically for all parameters, whereas the second one attains the cut-set bound at the MSR point asymptotically for low-rate parameters. Even though these codes require a large file size, this restriction is trivially satisfied in most conceivable distributed storage scenarios, that are the prominent motivation for regenerating codes

    Exact solutions to the focusing nonlinear Schrodinger equation

    Full text link
    A method is given to construct globally analytic (in space and time) exact solutions to the focusing cubic nonlinear Schrodinger equation on the line. An explicit formula and its equivalents are presented to express such exact solutions in a compact form in terms of matrix exponentials. Such exact solutions can alternatively be written explicitly as algebraic combinations of exponential, trigonometric, and polynomial functions of the spatial and temporal coordinates.Comment: 60 pages, 18 figure

    Sign patterns for chemical reaction networks

    Full text link
    Most differential equations found in chemical reaction networks (CRNs) have the form dx/dt=f(x)=Sv(x)dx/dt=f(x)= Sv(x), where xx lies in the nonnegative orthant, where SS is a real matrix (the stoichiometric matrix) and vv is a column vector consisting of real-valued functions having a special relationship to SS. Our main interest will be in the Jacobian matrix, f′(x)f'(x), of f(x)f(x), in particular in whether or not each entry f′(x)ijf'(x)_{ij} has the same sign for all xx in the orthant, i.e., the Jacobian respects a sign pattern. In other words species xjx_j always acts on species xix_i in an inhibitory way or its action is always excitatory. In Helton, Klep, Gomez we gave necessary and sufficient conditions on the species-reaction graph naturally associated to SS which guarantee that the Jacobian of the associated CRN has a sign pattern. In this paper, given SS we give a construction which adds certain rows and columns to SS, thereby producing a stoichiometric matrix S^\widehat S corresponding to a new CRN with some added species and reactions. The Jacobian for this CRN based on S^\hat S has a sign pattern. The equilibria for the SS and the S^\hat S based CRN are in exact one to one correspondence with each equilibrium ee for the original CRN gotten from an equilibrium e^\hat e for the new CRN by removing its added species. In our construction of a new CRN we are allowed to choose rate constants for the added reactions and if we choose them large enough the equilibrium e^\hat e is locally asymptotically stable if and only if the equilibrium ee is locally asymptotically stable. Further properties of the construction are shown, such as those pertaining to conserved quantities and to how the deficiencies of the two CRNs compare.Comment: 23 page
    • …
    corecore