This paper presents a mathematical programming model for optimal pavement rehabilitation planning. The model maximized the rehabilitation area through a newly developed permutation algorithm, based on the procedures outlined in the harmony search (HS) algorithm. Additionally, the proposed algorithm was based on an optimal solution method for the problem of multilocation rehabilitation activitie...

Using a blend of combinatorics and geometry, we give an algorithm for algebraically finding all flags in any zero-dimensional intersection of Schubert varieties with respect to three transverse flags, and more generally, any number of flags. In particular, the number of flags in a triple intersection is also a structure constant for the cohomology ring of the flag manifold. Our algorithm is bas...

NORX is one of the fifteen authenticated encryption algorithms that have reached the third round of the CAESAR competition. NORX is built using the sponge-based Monkey Duplex construction. In this note we analyze the core permutation F . We show that it has rotational symmetries on different structure levels. This yields simple distinguishing properties for the permutation, which propagate with...

A classical result of John Dixon (1969) asserts that a pair of random permutations of a set of n elements almost surely generates either the symmetric or the alternating group of degree n. We answer the question, “For what permutation groups G ≤ Sn do G and a random permutation σ ∈ Sn almost surely generate the symmetric or the alternating group?” Extending Dixon’s result, we prove that this is...

Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of pattern containment. These techniques are used to prove a new characterization of vexillary permutations in terms of their principal dual order ideals in a ...

The generic structure of 4-point functions of fields residing in indecomposable representations of arbitrary rank is given. The presented algorithm is illustrated with some non-trivial examples and permutation symmetries are exploited to reduce the number of free structure-functions, which cannot be fixed by global conformal invariance alone.

Motivated by the problem of constructing bijective maps with low differential uniformity, we introduce notion permutation resemblance a function, which looks to measure distance given map is from being permutation. We prove several results concerning permutation resemblance and show how it can ...