E. Eisenberg

activity

20172024

most citedOn the poset of King-Non-Attacking permutations

6 citations · 10 across the 8 of their papers we have counts for

collaborators

8 papers

math.CO2024

Geometric view of interval poset permutations

Eli Bagno, Estrella Eisenberg, Shulamit Reches +1

In a recent study, Tenner introduced the concept of the interval poset of a permutation to effectively represent all intervals and their inclusions within a permutation. In this pa…

cs.DM2024

Interval Posets and Polygon Dissections

Eli Bagno, Estrella Eisenberg, Shulamit Reches +1

The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi…

math.CO2023

Blockwise simple permutations

Eli Bagno, Estrella Eisenberg, Shulamit Reches +1

A permutation is called {\it {block-wise simple}} if it contains no interval of the form $p_{1} \oplus p_{2}$ or $p_{1} ⊖ p_{2}$ . We present this new set of permutations and explore s…

math.CO2020

The poset of king permutations on a cylinder

Eli Bagno, Estrella Eisenberg, Shulamit Reches ans Moriah Sigron

A permutation $σ = [σ_{1}, \dots, σ_{n}] \in S_{n}$ is called a {\em cylindrical king permutation} if $∣ σ_{i + 1} - σ_{i} ∣ > 1$ for each $1 \leq i \leq n - 1$ and $∣ σ_{1} - σ_{n} ∣ > 1$ . The name comes from…

math.CO2020★ 1 cited

Counting King Permutations on the Cylinder

Eli Bagno, Estrella Eisenberg, Shulamit Reches +1

We call a permutation $σ = [σ_{1}, \dots, σ_{n}] \in S_{n}$ a {\em cylindrical king permutation} if $∣ σ_{i} - σ_{i + 1} ∣ > 1$ for each $1 \leq i \leq n - 1$ and $∣ σ_{1} - σ_{n} ∣ > 1$ . We present some results…

math.CO2019★ 3 cited

Separators - a new statistic for permutations

Eli Bagno, Estrella Eisenberg, Shulamit Reches +1

A digit $π_{j}$ in a permutation $π = [π_{1}, \dots, π_{n}] \in S_{n}$ is defined to be a separator of $π$ if by omitting it from $π$ we get a new $2 -$ block. In this work we introduce a new st…