A discrete dynamical model of signed partitions

9Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We use a discrete dynamical model with three evolution rules in order to analyze the structure of a partially ordered set of signed integer partitions whose main properties are actually not known. This model is related to the study of some extremal combinatorial sum problems. © 2013 G. Chiaselotti et al.

References Powered by Scopus

The lattice of integer partitions

128Citations
N/AReaders
Get full text

Parallel dynamical systems over directed dependency graphs

32Citations
N/AReaders
Get full text

Parallel discrete dynamical systems on independent local functions

29Citations
N/AReaders
Get full text

Cited by Powered by Scopus

The adjacency matrix of a graph as a data table: a geometric perspective

31Citations
N/AReaders
Get full text

Graph dynamical systems with general Boolean states

26Citations
N/AReaders
Get full text

Parallel dynamical systems over graphs and related topics: A survey

25Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Chiaselotti, G., Marino, G., Oliverio, P. A., & Petrassi, D. (2013). A discrete dynamical model of signed partitions. Journal of Applied Mathematics, 2013. https://doi.org/10.1155/2013/973501

Readers' Seniority

Tooltip

Professor / Associate Prof. 2

67%

Researcher 1

33%

Readers' Discipline

Tooltip

Physics and Astronomy 1

33%

Computer Science 1

33%

Mathematics 1

33%

Save time finding and organizing research with Mendeley

Sign up for free