S. Reches

activity

20192024

most citedMachine Learning Methods for Management UAV Flocks -- a Survey

31 citations · 46 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

5 papers · 1 filter

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…

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★ 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…

math.CO2019

On the poset of King-Non-Attacking permutations

Eli Bagno, Estrella Eisenberg, Shulamit Reches +1

A king-non-attacking permutation is a permutation $π \in S_{n}$ such that $∣ π (i) - π (i - 1) ∣ \neq = 1$ for each $i \in {2, \dots, n}$ . We investigate the structure of the poset of these perm…