Events for 02/20/2019 from all calendars
Number Theory Seminar
Time: 1:45PM - 2:45PM
Location: BLOC 220
Speaker: Matt Papanikolas, Texas A&M University
Title: Hyperderivative power sums and Carlitz multiplication coefficients
Abstract: We will discuss connections among hyperderivatives of polynomials over finite fields, q-th powers of polynomials, and specializations of Vandermonde matrices. From these relations we will construct formuls for Carlitz multiplication coefficients using hyperderivatives and symmetric polynomials, and we will obtain precise identities for hyperderivative power sums in terms of the inverse of the Vandermonde matrix. We will further discuss a new proof of a theorem of Thakur that gives exact formulas for Anderson's special log-algebraic polynomials for the Carlitz module.
URL: Event link
Noncommutative Geometry Seminar
Time: 2:00PM - 3:00PM
Location: BLOC 628
Speaker: Qin Wang, East China Normal University
Title: The coarse Novikov conjecture and Banach spaces with property (H)
Abstract: The coarse Novikov conjecture is a geometric analogue of the strong Novikov conjecture, while property (H) is a geometric condition for Banach spaces introduced by G. Kasparov and G. Yu in studying the strong Novikov conjecture. In this talk, I will discuss applications of coarse embeddings or fibred coarse embeddings of metric spaces into Banach spaces with property (H) to the coarse Novikov conjecture.
First Year Graduate Student Seminar
Time: 5:30PM - 6:30PM
Location: BLOC 628
Speaker: Student panel
Title: Panel discussion: choosing an advisor
AMUSE
Time: 6:00PM - 7:00PM
Location: BLOC 220
Speaker: Dr. Jean-Francois Chamberland, Department of Electrical and Computer Engineering, TAMU
Title: Isn’t It Odd that Flipping Coins Can Enable the Internet of Tomorrow?
Abstract: This talk will survey how various mathematical notions, including random coin flipping and linear algebra, can help design the Internet of tomorrow. It will introduce a new scheme for the unsourced multiple-access communication problem whereby devices sends data wirelessly to the cloud. The envisioned divide-and-conquer approach leverages recent advances in compressive sensing and introduces a novel error correction paradigm to produce an uncoordinated access scheme, along with a computationally efficient decoding algorithm. Within this framework, every active device first partitions its data into several sub-blocks and, subsequently, adds redundancy using a linear block code. The original messages are obtained by connecting pieces together using a low-complexity, tree-based algorithm. Hopefully, this will help attendees grow their understanding of possible applications for fundamental notions in math.