An Efficient Algorithm for Generating Symmetric Ice Piles Roberto - PowerPoint PPT Presentation

An Efficient Algorithm for Generating Symmetric Ice Piles Roberto Mantaci 1 Paolo Massazza 2 Jean-Baptiste Yunès 1 1 LIAFA, Université Paris Diderot 2 Dipartimento di Scienze Teoriche e Applicate Università degli Studi dell’Insubria-Varese ICTCS 2014 Perugia, September 17-19th 2014 Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 1 / 19

Abstract Our Interest The properties of SIPM k ( n ) , a new granular dynamical system representing symmetric ice piles Goal The design of an efficient (CAT) algorithm which generates SIPM k ( n ) Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 2 / 19

Introduction The Sand Pile Game Sand Piles are integer sequences which describe the states of the Sand Pile Game Initial state: ( n ) , n sand grains in column 0, RFall Rule: in ( s 0 , . . . , s l ) a grain can fall from column i downto i + 1 iff the height difference is at least 2, s i − s i + 1 ≥ 2 (6,3,2) 0 1 2 Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 3 / 19

Introduction Sand Pile Model Definition (SPM ( n ) ) SPM ( n ) is the set of linear partitions of n obtained by closing { ( n ) } w.r.t. RFall.  ( s 0 , . . . , s i − 1 , s i − 1 , s i + 1 + 1 , . . . , s l ) if 0 ≤ i ≤ l ,  RFall ( s , i ) = s i − s i + 1 ≥ 2 ⊥ otherwise  introduced by Back, Tang, Wiesenfeld [’88] deeply investigated by Goles, Kiwi [’92] used to simulate physical phenomena (e.g. avalanches) particular case of the chip firing game Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 4 / 19

Introduction Ice Pile Model Ice grains can slide... RSlide k k’<k i i+k’ Definition (IPM k ( n ) ) For any k > 0, IPM k ( n ) is the set of linear partitions of n obtained by closing { ( n ) } w.r.t. RFall and RSlide k . introduced by Goles, Morvan, Phan [’98] CAT generated by Massazza, Radicioni [2010] Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 5 / 19

Introduction Accessibility in IPM k ( n ) k+2 k+1 k+1 1 h h h−1 k+1 k 1 k 1 1 k h h−1 h−2 k+1 ... 1 h−q+1 h−q Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 6 / 19

Introduction Accessibility in IPM k ( n ) k+2 k+1 k+1 1 h h h−1 k+1 k 1 k 1 1 k h h−1 h−2 k+1 ... 1 h−q+1 h−q Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 7 / 19

Introduction SSPM ( n ) The Symmetric Sand Pile Model SSPM ( n ) introduced by Formenti, Masson, Pisokas [’06] studied by Phan [’08] symmetric version of SPM ( n ) (admits also left moves) Definition (SSPM ( n ) ) SSPM ( n ) is the set of integer sequences obtained by closing { ( n ) } w.r.t. RFall , LFall (indices of columns can be negative). Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 8 / 19

Introduction BSPM ( n ) The Bidimensional Sand Pile Model BSPM ( n ) introduced by Duchi, Mantaci, Phan, Rossin [’06] as a generalization of SPM ( n ) to 2D. Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 9 / 19

Introduction SPM,IPM k , SSPM and BSPM: known results SPM ( n ) IPM k ( n ) SSPM ( n ) BSPM lattice yes yes no no characterization elements elements elements ? fixed point fixed point fixed points ? CAT generation yes yes yes ? Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 10 / 19

Introduction CAT Algorithm for IPM k ( n ) - Spanning Tree CAT Algorithm (Massazza-Radicioni) (10) Spans the poset using a tree; (9,1) Each element is generated applying (8,2) (7,3) (8,1,1) (the rightmost) IPM k ( n ) move to the (6,4) (7,2,1) grand ancestor of the current partition; (5,5) (6,3,1) (7,1,1,1) Partitions are (5,4,1) (6,2,2) generated in increasing neglex order. (5,3,2) (6,2,1,1) (4,4,2) (5,3,1,1) (6,1,1,1,1) (4,3,3) (4,4,1,1) (5,2,2,1) (4,3,2,1) (5,2,1,1,1) (3,3,3,1) (4,2,2,2) (4,3,1,1,1) (3,3,2,2) (4,2,2,1,1) (3,3,2,1,1) (4,2,1,1,1,1) (3,2,2,2,1) (3,3,1,1,1,1) (3,2,2,1,1,1) (2,2,2,2,1,1) (2,2,2,1,1,1,1) Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 11 / 19

Symmetric Ice piles Symmetric Ice piles Definition (SIPM k ( n ) ) SIPM k ( n ) is the set of integer sequences obtained by closing { ( n ) } w.r.t. RFall , LFall , RSlide k , LSlide k RFall(a,0) �� LFall(a,−1) �� −1 0 1 −3 −2 −1 0 1 2 Fall and Slide moves ( k = 3) unimodal sequence of n : a = ( a 0 , . . . , a l ) such that � l i = 0 a i = n and a 0 ≤ a 1 ≤ . . . ≤ a j ≥ a j + i ≥ . . . ≥ a l for some j . A generalized unimodal sequence is a pair ( a , j ) where a is a unimodal sequence (the form) and j an integer (the position). Mantaci, Massazza, Yunès (Paris, Varese) ICTCS 2014 12 / 19

An Efficient Algorithm for Generating Symmetric Ice Piles Roberto - PowerPoint PPT Presentation

An Efficient Algorithm for Generating Symmetric Ice Piles Roberto Mantaci 1 Paolo Massazza 2 Jean-Baptiste Yuns 1 1 LIAFA, Universit Paris Diderot 2 Dipartimento di Scienze Teoriche e Applicate Universit degli Studi dellInsubria-Varese

An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography

An Efficient Gauss-Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations Xin Liu

A divide-and-conquer algorithm for a symmetric eigenproblem Binh T. Nguyen Anh-Duc Luong-Thanh

Backward Secure Dynamic Searchable Symmetric Encryption with Efficient Updates Hyung Tae Lee

Generating Efficient Execution Plans for Vertically Partitioned XML Databases Patrick Kling, M.

An Efficient Algorithm for SPM with CP Problem of Sequential 2 1 1 J. AOGA , T. Guns , P.

Generating Efficient Data Movement Code for Heterogeneous Architectures with Distributed-Memory

Greedy Strategy [14] In the last class Undirected and Symmetric Digraph UDF Search

A New Algorithm for Generating Quadrilateral Meshes and Its Application to FE-Based Image

Applications Monika Henzinger Efficient algorithms Topics : Algorithm analysis and

An Algorithm for Generating t-wise Covering Arrays from Large Feature Models Martin Fagereng

Protection and Security - II Encrypts a block of data at a time (64 bit messages, with 56 bit

Generating random primes faster The standard algorithm to generate random primes: D. J.

An Efficient Loop-Detection Algorithm for SIP Proxies

Outline CHARM: An Efficient Algorithm Introductions for Closed Itemset Mining

A Complete Algorithm for Generating Landmarks Blai Bonet Julio Castillo Universidad Sim on

An Efficient Algorithm for An Efficient Algorithm for Simulating Coalescence with Simulating

An Algorithm for Solving Non-Symmetric Saddle-Point Systems Jaroslav Haslinger, Charles

algorithm of Savage and JaJa [SJ81] uses O(log n) (resp. O((log - Implementation 2 is faster

Experimental evaluation of Navigation piles By Claus Jensen University of Copenhagen Based on

Invisible Formal Methods: Generating Efficient Test Sets With a Model Checker John Rushby with

Recursive Definitions Generating Functions Lecture 18 Generating Functions A generating

Efficient Algorithm for Serial Data Fusion in Wireless Sensor

An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on