Permutations With Restricted Movement

11/06/2019
by   Dor Elimelech, et al.
0

We study restricted permutations of sets which have a geometrical structure. The study of restricted permutations is motivated by their application in coding for flash memories, and their relevance in different applications of networking technologies and various channels. We generalize the model of Z^d-permutations with restricted movement suggested by Schmidt and Strasser in 2016, to restricted permutations of graphs, and study the new model in a symbolic dynamical approach. We show a correspondence between restricted permutations and perfect matchings. We use the theory of perfect matchings for investigating several two-dimensional cases, in which we compute the exact entropy and propose a polynomial-time algorithm for counting admissible patterns. We prove that the entropy of Z^d-permutations restricted by a set with full affine dimension depends only on the size of the set. We use this result in order to compute the entropy for a class of two-dimensional cases. We discuss the global and local admissibility of patterns, in the context of restricted Z^d-permutations. Finally, we review the related models of injective and surjective restricted functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2020

Counting Maximum Matchings in Planar Graphs Is Hard

Here we prove that counting maximum matchings in planar, bipartite graph...
research
07/08/2019

Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory

Counting homomorphisms from a graph H into another graph G is a fundamen...
research
04/14/2022

On restricted completions of chordal and trivially perfect graphs

Let G be a graph having a vertex v such that H = G - v is a trivially pe...
research
07/01/2021

Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths

We systematically investigate the complexity of counting subgraph patter...
research
06/21/2020

Graphs of relational structures: restricted types

The algebraic approach to the Constraint Satisfaction Problem (CSP) uses...
research
04/07/2022

Lower Bounds for Restricted Schemes in the Two-Adaptive Bitprobe Model

In the adaptive bitprobe model answering membership queries in two bitpr...

Please sign up or login with your details

Forgot password? Click here to reset