IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v232y2014icp1249-1261.html
   My bibliography  Save this article

Parallel and sequential dynamics of two discrete models of signed integer partitions

Author

Listed:
  • Chiaselotti, G.
  • Gentile, T.
  • Oliverio, P.A.

Abstract

In this paper we complete and generalize some previous results concerning the computing of the sequential and parallel convergent time for two discrete dynamical system of signed integer partitions. We also refine the concept of parallel convergent time for a finite graded partially ordered set (briefly poset) X which is also a discrete dynamical model. To this aim we define the concept of fundamental sequence of X and we compute this sequence in two particularly important cases. In the first case, when X is the finite lattice S(n,r) of all the signed integer partitions ar,…,a1,b1,…,bn-r such that r⩾ar⩾⋯⩾a1⩾0⩾b1⩾⋯⩾bn-r⩾-(n-r), where n⩾r⩾0 and the unique part that can be repeated is 0. In the second case, when X is the sub-lattice S(n,d,r) of all the signed integer partitions of S(n,r) having exactly d non-zero parts. The relevance of the previous lattices as discrete dynamical models is related to their link with some unsolved extremal combinatorial sum problems.

Suggested Citation

  • Chiaselotti, G. & Gentile, T. & Oliverio, P.A., 2014. "Parallel and sequential dynamics of two discrete models of signed integer partitions," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 1249-1261.
    • Handle: RePEc:eee:apmaco:v:232:y:2014:i:c:p:1249-1261
    DOI: 10.1016/j.amc.2014.01.118
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314001635
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2014.01.118?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. G. Chiaselotti & G. Marino & C. Nardi, 2012. "A Minimum Problem for Finite Sets of Real Numbers with Nonnegative Sum," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-15, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Juan A. Aledo & Ali Barzanouni & Ghazaleh Malekbala & Leila Sharifan & Jose C. Valverde, 2020. "On the Periodic Structure of Parallel Dynamical Systems on Generalized Independent Boolean Functions," Mathematics, MDPI, vol. 8(7), pages 1-14, July.
    2. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2017. "On the Periods of Parallel Dynamical Systems," Complexity, Hindawi, vol. 2017, pages 1-6, January.
    3. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2019. "Predecessors Existence Problems and Gardens of Eden in Sequential Dynamical Systems," Complexity, Hindawi, vol. 2019, pages 1-10, March.
    4. Juan A. Aledo & Luis G. Diaz & Silvia Martinez & Jose C. Valverde, 2020. "Coexistence of Periods in Parallel and Sequential Boolean Graph Dynamical Systems over Directed Graphs," Mathematics, MDPI, vol. 8(10), pages 1-14, October.
    5. Aledo, Juan A. & Diaz, Luis G. & Martinez, Silvia & Valverde, Jose C., 2019. "Solution to the predecessors and Gardens-of-Eden problems for synchronous systems over directed graphs," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 22-28.
    6. Chiaselotti, G. & Gentile, T. & Infusino, F. & Oliverio, P.A., 2018. "Dependency and accuracy measures for directed graphs," Applied Mathematics and Computation, Elsevier, vol. 320(C), pages 781-794.
    7. Aledo, Juan A. & Diaz, Luis G. & Martinez, Silvia & Valverde, Jose C., 2019. "Dynamical attraction in parallel network models," Applied Mathematics and Computation, Elsevier, vol. 361(C), pages 874-888.
    8. Sanahuja, Silvia M., 2016. "New rough approximations for n-cycles and n-paths," Applied Mathematics and Computation, Elsevier, vol. 276(C), pages 96-108.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:232:y:2014:i:c:p:1249-1261. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.