 # Mathematical Sciences Research Institute

Home » MSRI-UP » Schedules » Permutation Patterns for Real-Valued Functions

# Permutation Patterns for Real-Valued Functions

## MSRI-UP 2013: Algebraic Combinatorics June 15, 2013 - July 28, 2013

July 26, 2013 (10:00 AM PDT - 10:45 AM PDT)
Speaker(s): Alicia Arrua (California State Polytechnic University, Pomona), Gustavo Meléndez Ríos (University of Puerto Rico), Lynesia Taylor (Spelman College)
Location: MSRI: Simons Auditorium
Video

#### v1099

Abstract

Consider the sequence [x,f(x),f(f(x))=f2(x),…,fn−1(x)] where f is a real-valued function and n≥2. We can associate a permutation to every such sequence by comparing it with x1<x2<...<xn, where xi=fj−1(x) for some j=1,2,…,n. Permutations that arise from these sequences are called allowed permutations and those that do not are called forbidden permutations.For example, the logistic map, f:[0,1]→[0,1] is defined by f(x)=rx(1−x) where 0≤r≤4, for any x. We focus on enumerating the number of forbidden permutations for the logistic map and other functions, including trigonometric functions. For example, for the n=3 case, we have found that the one-line permutation (321) is a forbidden permutation for the function sin(πx).