Jul 26, 2013
Friday

08:45 AM  09:00 AM


Opening Remarks

 Location
 SLMath: Eisenbud Auditorium
 Video

 Abstract
 
 Supplements



09:00 AM  09:45 AM


On the Schur Positivity of Differences of Products of Schur Functions
Jeremiah Emidih (University of California, Riverside), Nadine Jansen (North Carolina Agricultural and Technical State University), Jeremy Meza (Carnegie Mellon University)

 Location
 SLMath: Eisenbud Auditorium
 Video

 Abstract
The Schur functions are a basis for the ring of symmetric functions indexed by partitions of nonnegative integers. A symmetric function f is called Schur positive if when expressed as a linear combination of Schur functions
f=∑λcλsλ
each coefficient cλ is nonnegative. We wish to investigate expressions of the form
sλcsλ−sμcsμ
where λ partitions n and μ partitions n1 and the complements λc,μc are taken over a sufficiently large m×m square. We give a necessary condition that if (1) is Schur positive, then μ is contained in λ. Furthermore, we show how conjugating partitions preserve Schur positivity. Lastly, we incorporate the Littlewood Richardson rule to show that particular classes of λ of μ are never Schur positive.
 Supplements



10:00 AM  10:45 AM


Permutation Patterns for RealValued Functions
Alicia Arrua (California State Polytechnic University, Pomona), Gustavo Meléndez Ríos (University of Puerto Rico), Lynesia Taylor (Spelman College)

 Location
 SLMath: Eisenbud Auditorium
 Video

 Abstract
Consider the sequence [x,f(x),f(f(x))=f2(x),…,fn−1(x)] where f is a realvalued 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 oneline permutation (321) is a forbidden permutation for the function sin(πx).
 Supplements



11:00 AM  11:45 AM


The Algebra of Set Partitions
Ryan Contreras (Boston College), Isabel Corona (Metropolitan State University of Denver), Matt Sarmiento (Columbia University)

 Location
 SLMath: Eisenbud Auditorium
 Video

 Abstract
A set partition of [n] = {1, 2, ...,n} is a collection of nonempty disjoint subsets of [n], called blocks, whose union is [n]. A block permutation of [n] consists of two set partitions A and B of [n] having the same number of blocks,and a bijection f : A > B. We consider the set BPn = {f : A > B f is a block permutation}. The elements in BPn can be visualized as graphs having two rows of n labeled vertices, corresponding to A and B. The connected components of each row are determined by connecting the vertices within each block of A and B. We then connect each block of A to the block of B which it maps to under f. The product g · f of two block permutations f : A > B and g : C > D of [n] is obtained by gluing the bottom of a graph representing f to the top of a graph representing g, and connecting each block of A to a block in D. We show that BPn is closed under this operation, and hence is a monoid. We have found a set of generators and seek to find a presentation for BPn. We also describe a Hopf algebra structure on BPn.
 Supplements



01:00 PM  01:45 PM


The lattice of set partitions and transition matrices of symmetric functions
Alexandria Burnley (University of Illinois at UrbanaChampaign), Aquia Richburg (Morehouse College), Simone SisnerosThiry (California State University, East Bay)

 Location
 SLMath: Eisenbud Auditorium
 Video

 Abstract
Block tabloids are a combinatorial object introduced by O. Egecioglu and J. Remmel through which the transition matrices between the bases m,e,p and h of the commuting symmetric functions may be defined. There is an alternative way to describe the transition matrices using symmetric functions in noncommuting variables and the lattice of set partitions. Our goal is to study functions on the lattice of set partitions that arise as entries in the transition matrices. Our research explores the relationship between brick tabloids and functions on the lattice of set partitions. For example, we study Nλ(μ), the number of set partitions of type μ that are larger than or equal to a set partition of type λ, and nλ(μ), the number of set partitions of type μ that are less than or equal to a set partition of type λ.
 Supplements



02:00 PM  02:45 PM


Chromatic Symmetric Functions of Trees and Unicycles
Damien Gonzales (University of California, Berkeley), Arman Green (Morehouse College), Caprice Stanley (North Carolina State University)

 Location
 SLMath: Eisenbud Auditorium
 Video

 Abstract
Given any simple graph, there is a corresponding symmetric function called the chromatic symmetric function (CSF). Introduced by Richard Stanley in 1995, the CSF of a graph G = (V(G), E(G)) is defined as follows:
XG=∑κ∏v∈V(G)xκ(v)
where the sum is over all proper colorings κ of G. A proper coloring is a labeling of a graph such that no two adjacent vertices have the same label. In Geoffrey Scott's senior thesis, published in 2008, several open problems in graph theory were presented. In our poster, we investigate these open problems and generalize some of his results. Our goal is to find necessary conditions for any two graphs that will ensure that they have the same CSF. We first consider two special types of graphs: trees and unicycles and write a program in SAGE to compare the CSF for any simple graph, and thus, compile a library of graphs with a small number of vertices alongside their CSFs.
 Supplements



03:00 PM  03:45 PM


Number of permutations with same peak set for signed permutations
Francis Castro (Massachusetts Institute of Technology), Jose Pastrana (University of Puerto Rico), Rita Zevallos (Swarthmore College)

 Location
 SLMath: Eisenbud Auditorium
 Video

 Abstract
Let Bn be the group of all signed permutations of [n]. A signed permutation has a peak in a position i=2,…,n−1 if πi−1<πi>πi+1. Let P(π) be the set of peaks of π, P(S,n) be the set of signed permutations π∈Bn such that P(π)=S, and #P(S,n) be the cardinality of P(S,n). We show #P(∅,n)=22n−1 and #P(S,n)=p(n)22n−S−1 where p(n) is some polynomial. We also consider the case in which we add a zero at the beginning of the permutation to also allow peaks at position i=1.
 Supplements



04:00 PM  04:30 PM


Closing Remarks

 Location
 SLMath: Eisenbud Auditorium
 Video


 Abstract
 
 Supplements



