We show that there is a reflection type bijection between the indecomposable summands of two multiplicity free tilting modules X and Y. This fixes common Y sends projective (resp., injective) exactly one module to non-projective non-injective) other. Moreover, this interchanges possible non-isomorphic complements an almost complete module.

Ensuring safe and comfortable conditions for pedestrians necessitates specific strategies at intersections service interchanges where traffic interact in complex ways with other modes of transportation. This study aims to investigate pedestrian performance the new Super Diverging Diamond Interchange (Super DDI) using real-world locations (i.e., I-225 Mississippi Ave, I-25 120th Hampden Ave Denv...

We address the problem of finding the minimal number of block interchanges required to transform a duplicated unilinear genome into a single tandem duplicated unilinear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem. This is the revised and extended version of [8].

We study the problem of computing the minimal number of adjacent, non-intersecting block interchanges required to transform a permutation into the identity permutation. In particular, we use the graph of a permutation to compute that number for a particular class of permutations in linear time and space, and derive a new tight upper bound on the so-called transposition distance.

Let L denote the free Lie ring of rank 2r with free generators xi , yi (1 i r), and let τ be the automorphism of L that interchanges xi and yi for all i . We construct a Z-basis of L that consists of pairs of elements which are interchanged by τ , and elements upon which τ acts as multiplication by −1.

We construct a uniform model for highest weight crystals and $B(\infty)$ generalized Kac--Moody algebras using rigged configurations. also show an explicit description of the $\ast$-involution on configurations $B(\infty)$: that interchanges rigging corigging. do this by giving recognition theorem $\ast$-involution. As consequence, we characterize $B(\lambda)$ as subcrystal

We address the problem of finding the minimal number of block interchanges (exchange of two intervals) required to transform a duplicated linear genome into a tandem duplicated linear genome. We provide a formula for the distance as well as a polynomial time algorithm for the sorting problem.