Preimages under the Bubblesort Operator

نویسندگان

چکیده

We study preimages of permutations under the bubblesort operator $\mathbf{B}$. achieve a description these much more complete than what is known for complicated sorting operators $\mathbf{S}$ (stacksort) and $\mathbf{Q}$ (queuesort). describe explicitly set $\mathbf{B}$ any permutation $\pi$ from left-to-right maxima $\pi$, showing that there are $2^{k-1}$ such if $k$ number maxima. further consider, each $n$, tree $T_n$ recording all size $n$ in its nodes, which an edge child to parent corresponds application (the root being identity permutation), we present several properties trees. In particular, show how subtree rooted at determined by length longest suffix $\pi$.
 Building on this result, determine nodes leaves every height trees, recover (resp. obtain) average leaves) $T_n$.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Preimages

For noninvertible maps, mainly subshifts of finite type and piecewise monotone interval maps, we investigate what happens if we follow backward trajectories, random in the sense that at each step every preimage can be chosen with equal probability. In particular, we ask what happens if we try to compute the entropy this way. It tuns out that instead of the topological entropy we get the metric ...

متن کامل

Practical Preimages for Maraca

The cryptographic hash function Maraca was submitted to the NIST SHA-3 competition [4] by Jenkins [3]. In this work, we show a practical preimage attack on Maraca. Our attack has been implemented and verified experimentally. This shows that Maraca does not achieve several important security properties which a secure cryptographic hash function is expected to offer.

متن کامل

Reeb Spaces and the Robustness of Preimages

Computer Science) Reeb Spaces and the Robustness of Preimages

متن کامل

Preimages for the Tillich-Zémor Hash Function

After 15 years of unsuccessful cryptanalysis attempts by the research community, Grassl et al. have recently broken the collision resistance property of the TillichZémor hash function. In this paper, we extend their cryptanalytic work and consider the preimage resistance of the function. We present two algorithms for computing preimages, each algorithm having its own advantages in terms of spee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2022

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/11390