sponsored by the

Embry-Riddle Aeronautical University

Department of Mathematics


Archive of Some Previous Speakers and Talks

We welcome participants from other universities and research institutions . If you are interested in giving a talk at our seminar, please feel free to contact us (

Talks (Fall 2017- Spring 2018 )

4:00 pm on Thursday, September 14, 2017 (AC-247)
Speaker:  Tomasz Odrzygozdzi, Institute of Mathematics PAN, Poland
Title: Exotic Property (T)

Abstract:   I will introduce the concept of Kazhdan’s Property (T), which is one of the main concerns of modern  Geometric Group Theory. This is a property which on one  hand has a number of applications but on the other it’s very  hard to provide examples of (apart from some trivial cases).  I will try to explain why Kazhdan’s Property is so exotic and  important.

Date: 4:00 pm on Tuesday, October 24, 2017 (AC-247)
Speaker:  Sam Spiro, UCSD
Title: Polynomial Relations of Matrices of Graphs


Date: 3:00 pm on Friday, November 10, 2017 (AC-247)
Speaker:  Chi-Kwong Li , College of William and Mary, Virginia
Title: Numerical Ranges and Dilations





Talks (Fall 2016- Spring 2017 )


----Second Biannual Paxxon  Conference on Algebra and Discrete Mathematics---

4:15 pm on Friday, October 21, 2016 (AC-247)
Speaker: Christopher Briggs, ERAU- Prescott
Title: A growth dichotomy for group algebras of free abelian by infinite cyclic groups

Abstract:  Growth in groups was introduced by Milnor in 1968.The growth of a group is closely related to the growth of its associated group algebra over a field of characteristic zero. We recall some major historical results on growth in groups, then focus on Gromov's concept of uniform exponential growth. We strengthen a result of Alperin by proving the group algebra of a free abelian by infinite cyclic group over a field of characteristic zero is of polynomially bounded or uniform exponential growth. 

----Conference of groups, rings and group rings West Kobe Mathematics Seminar---


4:15 pm on Monday, April 17, 2017 (AC-115)
Speaker: Sirani K. M. Perera , ERAU- DB
Title: Structured Matrices Approach to Fast and Stable Algorithms



Date: 4:15 pm on Thursday  June 8, 2017 (AC-115)
Speaker: Kazu Nishinaka
Title: TBA


----The Fifth Annual Conference for the Exchange of Mathematical Ideas ----



Talks (Fall 2015 - Spring 2016)

4:10 pm on Friday, August 28, 2015 (AC-247)
Speaker: Paul Hriljac, ERAU- Prescott
Title: Digital Smoothing and the Discrete Log problem for Elliptic Curves

Abstract:  I will explain the discrete log problem and why it’s relevant to cryptography. I will then go on to introduce digital signal processing to the study of elliptic curves over finite fields. After that I will show how digital smoothing operators can be used to attack the discrete log problem in a new way.

4:10 pm on Friday, September 25, 2015 (AC-247)
Speaker: Christopher Briggs, ERAU- Prescott
Title: On Uniform Exponential Growth of Poly-Z Algebras

Abstract:  The growth of groups and their group algebras are closely connected; results on the group algebra strengthen results on the group. We discuss some results in pursuit of an analog to the 2008 result of Breuillard and Gelander on the uniform exponential growth of linear groups. We discuss a theorem on the growth of a semidirect product of a linear group by an infinite cyclic group, and use this to demonstrate uniform exponential growth of some poly-Z algebras. We offer conjectures on a path forward and discuss challenges in considering algebra growth versus group growth.


Date: 4:10 pm on Friday, October 16, 2015 (AC-247)
Speaker: Keke Wang, ERAU- Prescott
Title: The Discharging Method and 3-Connected Essentially 10-Connected Line Graphs

Abstract:  We use the discharging method to prove that every 3-connected, essentially 10-connected line graph is hamiltonian connected.


Date: 4:10 pm on Friday, November 6, 2015 (AC-247)
Speaker: Edward Poon, ERAU- Prescott
Title: Generalized Numerical Radius Isometries

Abstract:  The numerical range of a bounded operator T acting on a complex Hilbert space H is the collection of numbers (Tx, x), where (  ,  ) denotes the inner product on H and x ranges over the unit vectors of H.  The numerical radius of T is the supremum of the moduli of elements of the numerical range of T, and defines a norm on B(H).  There are many generalizations of numerical range and numerical radius; most such generalizations have associated semi-norms, if not norms.  We investigate the problem of when is a linear map an isometry for a certain generalized numerical radii.

12:01 pm on Wednesday, February 17, 2016  (AC-247)
Speaker: Christopher Briggs,, ERAU- Prescott
Title: A strategy for the card game Set

Abstract:  The card game set has entertained mathematicians and laypeople alike for decades. Much literature on the game concerns the probability of a set existing in a given hand; little has been written about mathematically-informed strategic play. In this talk we introduce the game and discuss some historical results, then develop and prove the worth of a strategy of play. We explore the properties of some algebraic objects which naturally arise from the investigation.

12:01 pm on Wednesday, March 2, 2016  (AC-247)
Speaker: Brent, Solie,, ERAU- Prescott
Title: Cellular Automata on Groups

Abstract: The study of cellular automata has a long history in mathematics, dating back to the work of von Neumann. The classical example of a cellular automaton is Conway's Game of Life, which is played on the integer lattice \mathbb{Z}^2, where which each point is considered to have one of two states: alive or dead. After one unit of time has elapsed, a cell’s new state is determined by its current state and the current state of its neighbors. Viewed globally, the Game of Life takes the form of a mapping \tau : \mathcal{C} \rightarrow \mathcal{C}, where \mathcal{C} is the space of all possible configurations of living and dead cells on \mathbb{Z}^2.

Early questions about the Game of Life concerned the existence of patterns which exist only in a cellular automaton’s initial configuration. Such patterns are fittingly called Garden of Eden patterns. In the 1960s, Moore and Myhill proved that the Game of Life admits Garden of Eden patterns if and only if it admits mutually erasable patterns. More recent results extend this characterization to cellular automata supported on spaces much more general than \mathbb{Z}^2. In particular, we will discuss an result of Ceccherini-Silberstein, Machi, and Scarabotti that proves a Moore-Myhill-type characterization for cellular automata played on finitely generated amenable groups.