Resume

• 2007

  Doctor of Philosophy (Ph.D.)

  I studied character theory of finite solvable groups

  specifically the character degree graph. The character degree graph consists of the set of vertices: the set of all primes that divide a character degree

  and the set of edges: two primes are adjacent if their product divides a character degree. I studied the case when the character degree graph has diameter three. I found that the graphs satisfied a very specific structure

  that the groups had exactly one normal non-abelian Sylow p-subgroup P

  and the prime p associated with that subgroup is known in the graph structure. Finally I found that if the graph of G/P' is considered

  that graph is disconnected and thus one of 6 known families of groups. It follows that the graphs with diameter three have Fitting height three.

  Mathematics

  Doctor of Philosophy (Ph.D.)

  Dissertation: Prime Character Degree Graphs of Finite Solvable Groups having Diameter Three.\nAdvisor: Mark Lewis

  Mathematics

  Kent State University

• 2005

  Master’s Degree

  Mathematics

  Wayne State University

  Machine Learning

  EMYQ2UAY3T4A

  Coursera

• Microsoft Excel

  Matlab

  Data Analysis

  Statistics

  Python

  Machine Learning

  Qualitative Research

  Teaching

  Microsoft Office

  Research

  Character Degree Graphs of Finite Solvable Groups with Diameter three

  Let G be a solvable group and let Δ(G) be the character degree graph of G. The vertices of Δ(G) are the primes dividing character degrees of G and there is an edge between two primes if they divide a common character degree of G. In this paper

  we show that the group G has exactly one normal non-abelian Sylow p-subgroup and that prime is specified in the graph. The graph has two disjoint subgraphs that are themselves complete with the smaller subgraph having size n and the larger having size larger than 2^n. Further

  the group has Fitting height 3.

  Character Degree Graphs of Finite Solvable Groups with Diameter three

  Let G be a solvable group and let Δ(G) be the character degree graph of G. The vertices of Δ(G) are the primes dividing character degrees of G and there is an edge between two primes if they divide a common character degree of G. In this paper

  we show that the Taketa inequality dl(G) ≤ | cd(G)| holds when G is a solvable group whose degree graph Δ(G) has diameter 3.

  The Taketa Problem and Character Degree Graphs with Diameter Three

  Looking for a position where I can use my analytical skills to have a positive impact in the world.

  Catherine

  Sass

  Self Employed

  Texas State University

  Independent verification of algorithms and calculations\n- Verified algorithms for generating and evaluating data\n- Utilized Matlab and SQL to automate verification\n- Documented findings and results\nResearch project I\n- Investigated and documented rules and procedures related to Expected Investment Period\n- Applied calculus and statistical techniques to proprietary data\n- Utilized Matlab to create visual representation of applied techniques\n- Documented findings and results\nResearch project II\n- Investigated a time value problem using statistical techniques\n- Utilized Python to parse

  organize

  and clean data\n- Utilized Python to automate calculations on large data sets\n- Documented findings and results

  Analytics Consultant

  Cleveland/Akron

  Ohio Area

  Self Employed

  San Marcos

  Texas

  I taught courses in College Algebra

  Business and Economics I & II

  and Trigonometry.

  Instructor

  Texas State University