https://www.math.wisc.edu/wiki/api.php?action=feedcontributions&user=Rzachariah&feedformat=atomUW-Math Wiki - User contributions [en]2020-08-13T12:02:50ZUser contributionsMediaWiki 1.30.1https://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19025Applied Algebra Seminar Spring 20202020-02-14T02:26:06Z<p>Rzachariah: /* Spring 2020 Schedule */</p>
<hr />
<div>'''When''': 11:00am, Thursdays<br />
<br />
'''Where''': 901 Van Vleck Hall<br />
<br />
'''List''': mathaas@lists.wisc.edu, to join email join-mathaas@lists.wisc.edu<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Remark''': We usually have a gap of around 2-3 weeks between seminars.<br />
<br />
<br />
== Spring 2020 Schedule ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
!align="left" | host(s) <br />
|-<br />
|February 20<br />
|[https://wid.wisc.edu/people/carla-michini/// Carla Michini (UW Madison)]<br />
|[[#Carla Michini|Short simplex paths in lattice polytopes]]<br />
|Local<br />
|-<br />
|February 27<br />
|<br />
| <br />
|-<br />
|March 5<br />
|<br />
| <br />
|-<br />
|March 12<br />
| [https://www.math.wisc.edu/~rzachariah/// Alisha Zachariah (UW Madison)]<br />
| [[#Alisha Zachariah|Efficient Estimation of a Sparse Delay-Doopler Channel]]<br />
| Local<br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|(Organizer traveling)<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|[https://www.math.tamu.edu/~jml/// JM Landsberg (Texas A&M)]<br />
|[[#JM Landsberg|TBD]]<br />
| Jose<br />
|-|<br />
|April 23<br />
|<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Carla Michini===<br />
'''Short simplex paths in lattice polytopes<br />
'''<br />
<br />
We consider the problem of optimizing a linear function over a lattice polytope P contained in [0,k]^n and defined via m linear inequalities. We design a simplex algorithm that, given an initial vertex, reaches an optimal vertex by tracing a path along the edges of P of length at most O(n^6 k log k). The length of this path is independent on m and is the best possible up to a polynomial function, since it is only polynomially far from the worst case diameter. The number of arithmetic operations needed to compute the next vertex in the path is polynomial in n, m and log k. If k is polynomially bounded by n and m, the algorithm runs in strongly polynomial time. This is a joint work with Alberto Del Pia.<br />
<br />
----<br />
<br />
===Alisha Zachariah===<br />
'''Efficiently Estimating a Sparse Delay-Doppler Channel<br />
''' <br />
<br />
Multiple wireless sensing tasks, e.g., radar detection for driver safety, involve estimating the ”channel” or relationship between signal transmitted and received. In this talk, I will focus on a certain type of channel known as the delay-doppler channel. This channel model starts to be applicable in high frequency carrier settings, which are increasingly common with recent developments in mmWave technology. Moreover, in this setting, both the channel model and existing technologies are amenable to working with signals of large bandwidth, and using such signals is a standard approach to achieving high resolution channel estimation. However, when high resolution is desirable, this approach creates a tension with the desire for efficiency because, in particular, it immediately implies that the signals in play live in a space of very high dimension N (e.g., ~10^6 in some applications), as per the Shannon-Nyquist sampling theorem.<br />
<br />
To address this, I will propose a randomized algorithm for channel estimation in the k-sparse setting (e.g., k objects in radar detection), with sampling and space complexity both on the order of k(log N)^2, and arithmetic complexity on the order of k(log N)^3+k^2, for N sufficiently large. <br />
<br />
While this algorithm seems to be extremely efficient -- to the best of our knowledge, the first of this nature in terms of complexity -- it is just a simple combination of three ingredients, two of which are well-known and widely used, namely digital chirp signals and discrete Gaussian filter functions, and the third being recent developments in Sparse Fast Fourier Transform algorithms.<br />
<br />
----<br />
<br />
== Other events to note ==<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | event/title<br />
!align="left" | speaker<br />
|-<br />
|February 7<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Joe_Kileel_.28Princeton.29/// Talk: Inverse Problems, Imaging and Tensor Decomposition]<br />
|Joe Kileel (Princeton)<br />
|-<br />
|February 10<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Cynthia_Vinzant_.28NCSU.29/// Talk: Matroids, log-concavity, and expanders ]<br />
|Cynthia Vinzant (NCSU)<br />
|-<br />
|}<br />
----</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19024Applied Algebra Seminar Spring 20202020-02-14T02:25:44Z<p>Rzachariah: /* Spring 2020 Schedule */</p>
<hr />
<div>'''When''': 11:00am, Thursdays<br />
<br />
'''Where''': 901 Van Vleck Hall<br />
<br />
'''List''': mathaas@lists.wisc.edu, to join email join-mathaas@lists.wisc.edu<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Remark''': We usually have a gap of around 2-3 weeks between seminars.<br />
<br />
<br />
== Spring 2020 Schedule ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
!align="left" | host(s) <br />
|-<br />
|February 20<br />
|[https://wid.wisc.edu/people/carla-michini/// Carla Michini (UW Madison)]<br />
|[[#Carla Michini|Short simplex paths in lattice polytopes]]<br />
|Local<br />
|-<br />
|February 27<br />
|<br />
| <br />
|-<br />
|March 5<br />
|<br />
| <br />
|-<br />
|March 12<br />
| [https://www.math.wisc.edu/~rzachariah/// Alisha Zacariah (UW Madison)]<br />
| [[#Alisha Zacariah|Efficient Estimation of a Sparse Delay-Doopler Channel]]<br />
| Local<br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|(Organizer traveling)<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|[https://www.math.tamu.edu/~jml/// JM Landsberg (Texas A&M)]<br />
|[[#JM Landsberg|TBD]]<br />
| Jose<br />
|-|<br />
|April 23<br />
|<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Carla Michini===<br />
'''Short simplex paths in lattice polytopes<br />
'''<br />
<br />
We consider the problem of optimizing a linear function over a lattice polytope P contained in [0,k]^n and defined via m linear inequalities. We design a simplex algorithm that, given an initial vertex, reaches an optimal vertex by tracing a path along the edges of P of length at most O(n^6 k log k). The length of this path is independent on m and is the best possible up to a polynomial function, since it is only polynomially far from the worst case diameter. The number of arithmetic operations needed to compute the next vertex in the path is polynomial in n, m and log k. If k is polynomially bounded by n and m, the algorithm runs in strongly polynomial time. This is a joint work with Alberto Del Pia.<br />
<br />
----<br />
<br />
===Alisha Zachariah===<br />
'''Efficiently Estimating a Sparse Delay-Doppler Channel<br />
''' <br />
<br />
Multiple wireless sensing tasks, e.g., radar detection for driver safety, involve estimating the ”channel” or relationship between signal transmitted and received. In this talk, I will focus on a certain type of channel known as the delay-doppler channel. This channel model starts to be applicable in high frequency carrier settings, which are increasingly common with recent developments in mmWave technology. Moreover, in this setting, both the channel model and existing technologies are amenable to working with signals of large bandwidth, and using such signals is a standard approach to achieving high resolution channel estimation. However, when high resolution is desirable, this approach creates a tension with the desire for efficiency because, in particular, it immediately implies that the signals in play live in a space of very high dimension N (e.g., ~10^6 in some applications), as per the Shannon-Nyquist sampling theorem.<br />
<br />
To address this, I will propose a randomized algorithm for channel estimation in the k-sparse setting (e.g., k objects in radar detection), with sampling and space complexity both on the order of k(log N)^2, and arithmetic complexity on the order of k(log N)^3+k^2, for N sufficiently large. <br />
<br />
While this algorithm seems to be extremely efficient -- to the best of our knowledge, the first of this nature in terms of complexity -- it is just a simple combination of three ingredients, two of which are well-known and widely used, namely digital chirp signals and discrete Gaussian filter functions, and the third being recent developments in Sparse Fast Fourier Transform algorithms.<br />
<br />
----<br />
<br />
== Other events to note ==<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | event/title<br />
!align="left" | speaker<br />
|-<br />
|February 7<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Joe_Kileel_.28Princeton.29/// Talk: Inverse Problems, Imaging and Tensor Decomposition]<br />
|Joe Kileel (Princeton)<br />
|-<br />
|February 10<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Cynthia_Vinzant_.28NCSU.29/// Talk: Matroids, log-concavity, and expanders ]<br />
|Cynthia Vinzant (NCSU)<br />
|-<br />
|}<br />
----</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19023Applied Algebra Seminar Spring 20202020-02-14T02:24:47Z<p>Rzachariah: /* Spring 2020 Schedule */</p>
<hr />
<div>'''When''': 11:00am, Thursdays<br />
<br />
'''Where''': 901 Van Vleck Hall<br />
<br />
'''List''': mathaas@lists.wisc.edu, to join email join-mathaas@lists.wisc.edu<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Remark''': We usually have a gap of around 2-3 weeks between seminars.<br />
<br />
<br />
== Spring 2020 Schedule ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
!align="left" | host(s) <br />
|-<br />
|February 20<br />
|[https://wid.wisc.edu/people/carla-michini/// Carla Michini (UW Madison)]<br />
|[[#Carla Michini|Short simplex paths in lattice polytopes]]<br />
|Local<br />
|-<br />
|February 27<br />
|<br />
| <br />
|-<br />
|March 5<br />
|<br />
| <br />
|-<br />
|March 12<br />
| [https://www.math.wisc.edu/~rzachariah/// Alisha Zacaria (UW Madison)]<br />
| [[#Alisha Zacariah|Efficient Estimation of a Sparse Delay-Doopler Channel]]<br />
| Local<br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|(Organizer traveling)<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|[https://www.math.tamu.edu/~jml/// JM Landsberg (Texas A&M)]<br />
|[[#JM Landsberg|TBD]]<br />
| Jose<br />
|-|<br />
|April 23<br />
|<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Carla Michini===<br />
'''Short simplex paths in lattice polytopes<br />
'''<br />
<br />
We consider the problem of optimizing a linear function over a lattice polytope P contained in [0,k]^n and defined via m linear inequalities. We design a simplex algorithm that, given an initial vertex, reaches an optimal vertex by tracing a path along the edges of P of length at most O(n^6 k log k). The length of this path is independent on m and is the best possible up to a polynomial function, since it is only polynomially far from the worst case diameter. The number of arithmetic operations needed to compute the next vertex in the path is polynomial in n, m and log k. If k is polynomially bounded by n and m, the algorithm runs in strongly polynomial time. This is a joint work with Alberto Del Pia.<br />
<br />
----<br />
<br />
===Alisha Zachariah===<br />
'''Efficiently Estimating a Sparse Delay-Doppler Channel<br />
''' <br />
<br />
Multiple wireless sensing tasks, e.g., radar detection for driver safety, involve estimating the ”channel” or relationship between signal transmitted and received. In this talk, I will focus on a certain type of channel known as the delay-doppler channel. This channel model starts to be applicable in high frequency carrier settings, which are increasingly common with recent developments in mmWave technology. Moreover, in this setting, both the channel model and existing technologies are amenable to working with signals of large bandwidth, and using such signals is a standard approach to achieving high resolution channel estimation. However, when high resolution is desirable, this approach creates a tension with the desire for efficiency because, in particular, it immediately implies that the signals in play live in a space of very high dimension N (e.g., ~10^6 in some applications), as per the Shannon-Nyquist sampling theorem.<br />
<br />
To address this, I will propose a randomized algorithm for channel estimation in the k-sparse setting (e.g., k objects in radar detection), with sampling and space complexity both on the order of k(log N)^2, and arithmetic complexity on the order of k(log N)^3+k^2, for N sufficiently large. <br />
<br />
While this algorithm seems to be extremely efficient -- to the best of our knowledge, the first of this nature in terms of complexity -- it is just a simple combination of three ingredients, two of which are well-known and widely used, namely digital chirp signals and discrete Gaussian filter functions, and the third being recent developments in Sparse Fast Fourier Transform algorithms.<br />
<br />
----<br />
<br />
== Other events to note ==<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | event/title<br />
!align="left" | speaker<br />
|-<br />
|February 7<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Joe_Kileel_.28Princeton.29/// Talk: Inverse Problems, Imaging and Tensor Decomposition]<br />
|Joe Kileel (Princeton)<br />
|-<br />
|February 10<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Cynthia_Vinzant_.28NCSU.29/// Talk: Matroids, log-concavity, and expanders ]<br />
|Cynthia Vinzant (NCSU)<br />
|-<br />
|}<br />
----</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19022Applied Algebra Seminar Spring 20202020-02-14T02:24:14Z<p>Rzachariah: /* Alisha Zachariah */</p>
<hr />
<div>'''When''': 11:00am, Thursdays<br />
<br />
'''Where''': 901 Van Vleck Hall<br />
<br />
'''List''': mathaas@lists.wisc.edu, to join email join-mathaas@lists.wisc.edu<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Remark''': We usually have a gap of around 2-3 weeks between seminars.<br />
<br />
<br />
== Spring 2020 Schedule ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
!align="left" | host(s) <br />
|-<br />
|February 20<br />
|[https://wid.wisc.edu/people/carla-michini/// Carla Michini (UW Madison)]<br />
|[[#Carla Michini|Short simplex paths in lattice polytopes]]<br />
|Local<br />
|-<br />
|February 27<br />
|<br />
| <br />
|-<br />
|March 5<br />
|<br />
| <br />
|-<br />
|March 12<br />
| [https://www.math.wisc.edu/~rzachariah/// Alisha Zacaria (UW Madison)]<br />
| [[#Alisha Zacaria|Efficient Estimation of a Sparse Delay-Doopler Channel]]<br />
| Local<br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|(Organizer traveling)<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|[https://www.math.tamu.edu/~jml/// JM Landsberg (Texas A&M)]<br />
|[[#JM Landsberg|TBD]]<br />
| Jose<br />
|-|<br />
|April 23<br />
|<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Carla Michini===<br />
'''Short simplex paths in lattice polytopes<br />
'''<br />
<br />
We consider the problem of optimizing a linear function over a lattice polytope P contained in [0,k]^n and defined via m linear inequalities. We design a simplex algorithm that, given an initial vertex, reaches an optimal vertex by tracing a path along the edges of P of length at most O(n^6 k log k). The length of this path is independent on m and is the best possible up to a polynomial function, since it is only polynomially far from the worst case diameter. The number of arithmetic operations needed to compute the next vertex in the path is polynomial in n, m and log k. If k is polynomially bounded by n and m, the algorithm runs in strongly polynomial time. This is a joint work with Alberto Del Pia.<br />
<br />
----<br />
<br />
===Alisha Zachariah===<br />
'''Efficiently Estimating a Sparse Delay-Doppler Channel<br />
''' <br />
<br />
Multiple wireless sensing tasks, e.g., radar detection for driver safety, involve estimating the ”channel” or relationship between signal transmitted and received. In this talk, I will focus on a certain type of channel known as the delay-doppler channel. This channel model starts to be applicable in high frequency carrier settings, which are increasingly common with recent developments in mmWave technology. Moreover, in this setting, both the channel model and existing technologies are amenable to working with signals of large bandwidth, and using such signals is a standard approach to achieving high resolution channel estimation. However, when high resolution is desirable, this approach creates a tension with the desire for efficiency because, in particular, it immediately implies that the signals in play live in a space of very high dimension N (e.g., ~10^6 in some applications), as per the Shannon-Nyquist sampling theorem.<br />
<br />
To address this, I will propose a randomized algorithm for channel estimation in the k-sparse setting (e.g., k objects in radar detection), with sampling and space complexity both on the order of k(log N)^2, and arithmetic complexity on the order of k(log N)^3+k^2, for N sufficiently large. <br />
<br />
While this algorithm seems to be extremely efficient -- to the best of our knowledge, the first of this nature in terms of complexity -- it is just a simple combination of three ingredients, two of which are well-known and widely used, namely digital chirp signals and discrete Gaussian filter functions, and the third being recent developments in Sparse Fast Fourier Transform algorithms.<br />
<br />
----<br />
<br />
== Other events to note ==<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | event/title<br />
!align="left" | speaker<br />
|-<br />
|February 7<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Joe_Kileel_.28Princeton.29/// Talk: Inverse Problems, Imaging and Tensor Decomposition]<br />
|Joe Kileel (Princeton)<br />
|-<br />
|February 10<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Cynthia_Vinzant_.28NCSU.29/// Talk: Matroids, log-concavity, and expanders ]<br />
|Cynthia Vinzant (NCSU)<br />
|-<br />
|}<br />
----</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19021Applied Algebra Seminar Spring 20202020-02-14T02:23:52Z<p>Rzachariah: /* Alisha Zacaria */</p>
<hr />
<div>'''When''': 11:00am, Thursdays<br />
<br />
'''Where''': 901 Van Vleck Hall<br />
<br />
'''List''': mathaas@lists.wisc.edu, to join email join-mathaas@lists.wisc.edu<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Remark''': We usually have a gap of around 2-3 weeks between seminars.<br />
<br />
<br />
== Spring 2020 Schedule ==<br />
<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | speaker<br />
!align="left" | title<br />
!align="left" | host(s) <br />
|-<br />
|February 20<br />
|[https://wid.wisc.edu/people/carla-michini/// Carla Michini (UW Madison)]<br />
|[[#Carla Michini|Short simplex paths in lattice polytopes]]<br />
|Local<br />
|-<br />
|February 27<br />
|<br />
| <br />
|-<br />
|March 5<br />
|<br />
| <br />
|-<br />
|March 12<br />
| [https://www.math.wisc.edu/~rzachariah/// Alisha Zacaria (UW Madison)]<br />
| [[#Alisha Zacaria|Efficient Estimation of a Sparse Delay-Doopler Channel]]<br />
| Local<br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|(Organizer traveling)<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|[https://www.math.tamu.edu/~jml/// JM Landsberg (Texas A&M)]<br />
|[[#JM Landsberg|TBD]]<br />
| Jose<br />
|-|<br />
|April 23<br />
|<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Carla Michini===<br />
'''Short simplex paths in lattice polytopes<br />
'''<br />
<br />
We consider the problem of optimizing a linear function over a lattice polytope P contained in [0,k]^n and defined via m linear inequalities. We design a simplex algorithm that, given an initial vertex, reaches an optimal vertex by tracing a path along the edges of P of length at most O(n^6 k log k). The length of this path is independent on m and is the best possible up to a polynomial function, since it is only polynomially far from the worst case diameter. The number of arithmetic operations needed to compute the next vertex in the path is polynomial in n, m and log k. If k is polynomially bounded by n and m, the algorithm runs in strongly polynomial time. This is a joint work with Alberto Del Pia.<br />
<br />
----<br />
<br />
===Alisha Zachariah===<br />
'''Efficiently Estimating a Sparse Delay-Doppler Channel<br />
''' <br />
<br />
Multiple wireless sensing tasks, e.g., radar detection for driver safety, involve estimating the ”channel” or relationship between signal transmitted and received. In this talk, I will focus on a certain type of channel, known as the delay-doppler channel. This channel model starts to be applicable in high frequency carrier settings, which are increasingly common with recent developments in mmWave technology. Moreover, in this setting, both the channel model and existing technologies are amenable to working with signals of large bandwidth, and using such signals is a standard approach to achieving high resolution channel estimation. However, when high resolution is desirable, this approach creates a tension with the desire for efficiency because, in particular, it immediately implies that the signals in play live in a space of very high dimension N (e.g., ~10^6 in some applications), as per the Shannon-Nyquist sampling theorem.<br />
<br />
To address this, I will propose a randomized algorithm for channel estimation in the k-sparse setting (e.g., k objects in radar detection), with sampling and space complexity both on the order of k(log N)^2, and arithmetic complexity on the order of k(log N)^3+k^2, for N sufficiently large. <br />
<br />
While this algorithm seems to be extremely efficient -- to the best of our knowledge, the first of this nature in terms of complexity -- it is just a simple combination of three ingredients, two of which are well-known and widely used, namely digital chirp signals and discrete Gaussian filter functions, and the third being recent developments in Sparse Fast Fourier Transform algorithms.<br />
<br />
----<br />
<br />
== Other events to note ==<br />
{| cellpadding="8"<br />
!align="left" | date<br />
!align="left" | event/title<br />
!align="left" | speaker<br />
|-<br />
|February 7<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Joe_Kileel_.28Princeton.29/// Talk: Inverse Problems, Imaging and Tensor Decomposition]<br />
|Joe Kileel (Princeton)<br />
|-<br />
|February 10<br />
|[https://www.math.wisc.edu/wiki/index.php/Colloquia#Cynthia_Vinzant_.28NCSU.29/// Talk: Matroids, log-concavity, and expanders ]<br />
|Cynthia Vinzant (NCSU)<br />
|-<br />
|}<br />
----</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9024Topology Qualifying Exam2014-12-24T05:22:04Z<p>Rzachariah: </p>
<hr />
<div>Here are un-official solutions to the Topology qualifying exam. They were written by Sara Jensen and had been available on her UW page. She was nice enough to pass them on after she graduated. <br />
<br />
Official information about the exam is available at: [http://www.math.wisc.edu/graduate/guide-qe#geomtop www.math.wisc.edu/graduate/guide]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan95.pdf Jan-95], [http://atrium.math.wisc.edu/sites/default/files/aug95.pdf Aug-95]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan96.pdf Jan-96], [http://atrium.math.wisc.edu/sites/default/files/aug96.pdf Aug-96]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug97.pdf Aug-97]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan98.pdf Jan-98], [http://atrium.math.wisc.edu/sites/default/files/aug98.pdf Aug-98]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan99.pdf Jan-99], [http://atrium.math.wisc.edu/sites/default/files/aug99.pdf Aug-99]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan00.pdf Jan-00], [http://atrium.math.wisc.edu/sites/default/files/aug00.pdf Aug-00]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan02.pdf Jan-02], [http://atrium.math.wisc.edu/sites/default/files/aug02.pdf Aug-02]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan03.pdf Jan-03], [http://atrium.math.wisc.edu/sites/default/files/aug03.pdf Aug-03]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan04.pdf Jan-04], [http://atrium.math.wisc.edu/sites/default/files/aug04.pdf Aug-04]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan05.pdf Jan-05], [http://atrium.math.wisc.edu/sites/default/files/aug05.pdf Aug-05]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan06.pdf Jan-06], [http://atrium.math.wisc.edu/sites/default/files/aug06.pdf Aug-06]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan07.pdf Jan-07], [http://atrium.math.wisc.edu/sites/default/files/aug07.pdf Aug-07]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan08.pdf Jan-08], [http://atrium.math.wisc.edu/sites/default/files/aug08.pdf Aug-08]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan09.pdf Jan-09], [http://atrium.math.wisc.edu/sites/default/files/aug09.pdf Aug-09]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan10.pdf Jan-10]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9023Topology Qualifying Exam2014-12-24T05:17:32Z<p>Rzachariah: </p>
<hr />
<div>Here are un-official solutions to the Topology Qual. They were written by Sara Jensen and had been available on her UW page. She was nice enough to pass them on after she graduated. <br />
<br />
Official information about the qual is available at: [http://www.math.wisc.edu/graduate/guide-qe#geomtop www.math.wisc.edu/graduate/guide]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan95.pdf Jan-95], [http://atrium.math.wisc.edu/sites/default/files/aug95.pdf Aug-95]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan96.pdf Jan-96], [http://atrium.math.wisc.edu/sites/default/files/aug96.pdf Aug-96]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug97.pdf Aug-97]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan98.pdf Jan-98], [http://atrium.math.wisc.edu/sites/default/files/aug98.pdf Aug-98]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan99.pdf Jan-99], [http://atrium.math.wisc.edu/sites/default/files/aug99.pdf Aug-99]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan00.pdf Jan-00], [http://atrium.math.wisc.edu/sites/default/files/aug00.pdf Aug-00]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan02.pdf Jan-02], [http://atrium.math.wisc.edu/sites/default/files/aug02.pdf Aug-02]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan03.pdf Jan-03], [http://atrium.math.wisc.edu/sites/default/files/aug03.pdf Aug-03]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan04.pdf Jan-04], [http://atrium.math.wisc.edu/sites/default/files/aug04.pdf Aug-04]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan05.pdf Jan-05], [http://atrium.math.wisc.edu/sites/default/files/aug05.pdf Aug-05]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan06.pdf Jan-06], [http://atrium.math.wisc.edu/sites/default/files/aug06.pdf Aug-06]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan07.pdf Jan-07], [http://atrium.math.wisc.edu/sites/default/files/aug07.pdf Aug-07]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan08.pdf Jan-08], [http://atrium.math.wisc.edu/sites/default/files/aug08.pdf Aug-08]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan09.pdf Jan-09], [http://atrium.math.wisc.edu/sites/default/files/aug09.pdf Aug-09]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan10.pdf Jan-10]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9022Topology Qualifying Exam2014-12-24T05:13:56Z<p>Rzachariah: </p>
<hr />
<div>Here are un-official solutions to the Topology Qual. They were written by Sara Jensen and had been available on her UW page. She was nice enough to pass them on after she graduated. <br />
<br />
Official information about the qual is available at: [http://www.math.wisc.edu/graduate/guide-qe#geomtop www.math.wisc.edu/graduate/guide]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan95.pdf Jan-95], [http://atrium.math.wisc.edu/sites/default/files/aug95.pdf Aug-95]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan96.pdf Jan-96], [http://atrium.math.wisc.edu/sites/default/files/aug96.pdf Aug-96]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan97.pdf Jan-97], [http://atrium.math.wisc.edu/sites/default/files/aug97.pdf Aug-97]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan98.pdf Jan-98], [http://atrium.math.wisc.edu/sites/default/files/aug98.pdf Aug-98]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan99.pdf Jan-99], [http://atrium.math.wisc.edu/sites/default/files/aug99.pdf Aug-99]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan00.pdf Jan-00], [http://atrium.math.wisc.edu/sites/default/files/aug00.pdf Aug-00]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan01.pdf Jan-01], [http://atrium.math.wisc.edu/sites/default/files/aug01.pdf Aug-01]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan02.pdf Jan-02], [http://atrium.math.wisc.edu/sites/default/files/aug02.pdf Aug-02]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan03.pdf Jan-03], [http://atrium.math.wisc.edu/sites/default/files/aug03.pdf Aug-03]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan04.pdf Jan-04], [http://atrium.math.wisc.edu/sites/default/files/aug04.pdf Aug-04]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan05.pdf Jan-05], [http://atrium.math.wisc.edu/sites/default/files/aug05.pdf Aug-05]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan06.pdf Jan-06], [http://atrium.math.wisc.edu/sites/default/files/aug06.pdf Aug-06]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan07.pdf Jan-07], [http://atrium.math.wisc.edu/sites/default/files/aug07.pdf Aug-07]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan08.pdf Jan-08], [http://atrium.math.wisc.edu/sites/default/files/aug08.pdf Aug-08]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan09.pdf Jan-09], [http://atrium.math.wisc.edu/sites/default/files/aug09.pdf Aug-09]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan10.pdf Jan-10], [http://atrium.math.wisc.edu/sites/default/files/aug10.pdf Aug-10]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9021Topology Qualifying Exam2014-12-24T05:13:29Z<p>Rzachariah: </p>
<hr />
<div>Here are un-official solutions to the Topology Qual. They were written by Sara Jensen and had been available on her UW page. She was nice enough to pass them on after she graduated. Official information about the qual is available at: [http://www.math.wisc.edu/graduate/guide-qe#geomtop www.math.wisc.edu/graduate/guide]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan95.pdf Jan-95], [http://atrium.math.wisc.edu/sites/default/files/aug95.pdf Aug-95]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan96.pdf Jan-96], [http://atrium.math.wisc.edu/sites/default/files/aug96.pdf Aug-96]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan97.pdf Jan-97], [http://atrium.math.wisc.edu/sites/default/files/aug97.pdf Aug-97]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan98.pdf Jan-98], [http://atrium.math.wisc.edu/sites/default/files/aug98.pdf Aug-98]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan99.pdf Jan-99], [http://atrium.math.wisc.edu/sites/default/files/aug99.pdf Aug-99]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan00.pdf Jan-00], [http://atrium.math.wisc.edu/sites/default/files/aug00.pdf Aug-00]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan01.pdf Jan-01], [http://atrium.math.wisc.edu/sites/default/files/aug01.pdf Aug-01]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan02.pdf Jan-02], [http://atrium.math.wisc.edu/sites/default/files/aug02.pdf Aug-02]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan03.pdf Jan-03], [http://atrium.math.wisc.edu/sites/default/files/aug03.pdf Aug-03]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan04.pdf Jan-04], [http://atrium.math.wisc.edu/sites/default/files/aug04.pdf Aug-04]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan05.pdf Jan-05], [http://atrium.math.wisc.edu/sites/default/files/aug05.pdf Aug-05]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan06.pdf Jan-06], [http://atrium.math.wisc.edu/sites/default/files/aug06.pdf Aug-06]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan07.pdf Jan-07], [http://atrium.math.wisc.edu/sites/default/files/aug07.pdf Aug-07]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan08.pdf Jan-08], [http://atrium.math.wisc.edu/sites/default/files/aug08.pdf Aug-08]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan09.pdf Jan-09], [http://atrium.math.wisc.edu/sites/default/files/aug09.pdf Aug-09]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/jan10.pdf Jan-10], [http://atrium.math.wisc.edu/sites/default/files/aug10.pdf Aug-10]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9020Topology Qualifying Exam2014-12-24T05:09:44Z<p>Rzachariah: </p>
<hr />
<div>Here are un-official solutions to the Topology Qual. They were written by Sara Jensen and had been available on her UW page. She was nice enough to pass them on after she graduated. Official information about the qual is available at: [http://www.math.wisc.edu/graduate/guide-qe#geomtop www.math.wisc.edu/graduate/guide]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug95.pdf Aug-95], [http://atrium.math.wisc.edu/sites/default/files/jan95.pdf Jan-95] <br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug96.pdf Aug-96]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug97.pdf Aug-97]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug98.pdf Aug-98]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug99.pdf Aug-99]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug00.pdf Aug-00]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug01.pdf Aug-01]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug02.pdf Aug-02]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug03.pdf Aug-03]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug04.pdf Aug-04]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug05.pdf Aug-05]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug06.pdf Aug-06]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug07.pdf Aug-07]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug08.pdf Aug-08]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug09.pdf Aug-09]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug10.pdf Aug-10]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9019Topology Qualifying Exam2014-12-24T05:08:05Z<p>Rzachariah: </p>
<hr />
<div>Here are un-official solutions to the Topology Qual. They were written by Sara Jensen and had been available on her UW page. She was nice enough to pass them on after she graduated. Official information about the qual is available at: [http://www.math.wisc.edu/graduate/guide-qe#geomtop www.math.wisc.edu/graduate/guide]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug95.pdf Aug-95], [http://atrium.math.wisc.edu/sites/default/files/jan95.pdf Jan-95] <br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug96.pdf Aug-96]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug97.pdf Aug-97]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug98.pdf Aug-98]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug99.pdf Aug-99]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug00.pdf Aug-00]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug01.pdf Aug-01]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug02.pdf Aug-02]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug03.pdf Aug-03]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9018Topology Qualifying Exam2014-12-24T05:06:40Z<p>Rzachariah: </p>
<hr />
<div>Here are un-official solutions to the Topology Qual. They were written by Sara Jensen and had been available on her UW page. She was nice enough to pass them on after she graduated. Official information about the qual is available at: [http://www.math.wisc.edu/graduate/guide-qe#geomtop www.math.wisc.edu/graduate/guide]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug95.pdf Aug-95], [http://atrium.math.wisc.edu/sites/default/files/jan95.pdf Jan-95] <br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug96.pdf Aug-96]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug97.pdf Aug-97]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9017Topology Qualifying Exam2014-12-24T05:05:34Z<p>Rzachariah: </p>
<hr />
<div>Here are un-official solutions to the Topology Qual. They were written by Sara Jensen and had been available on her UW page. She was nice enough to pass them on after she graduated. Official information about the qual is available at: [http://www.math.wisc.edu/graduate/guide-qe#geomtop www.math.wisc.edu/graduate/guide]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug95.pdf Aug-95]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug96.pdf Aug-96]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug97.pdf Aug-97]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9016Topology Qualifying Exam2014-12-24T05:04:20Z<p>Rzachariah: </p>
<hr />
<div>Here are un-official solutions to the Topology Qual. They were written by Sara Jensen and had been available on her UW page. She was nice enough to pass them on after she graduated. Official information about the qual is available at: [http://www.math.wisc.edu/graduate/guide-qe#geomtop]<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]<br />
[http://atrium.math.wisc.edu/sites/default/files/aug95.pdf Aug-95]<br />
[http://atrium.math.wisc.edu/sites/default/files/aug96.pdf Aug-96]<br />
[http://atrium.math.wisc.edu/sites/default/files/aug97.pdf Aug-97]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9015Topology Qualifying Exam2014-12-24T04:59:16Z<p>Rzachariah: </p>
<hr />
<div>Here are Sara Jensen's solutions to the Algebraic Topology Qualifying exam. These had been available on her UW page, she was nice enough to pass them on once she had graduated.<br />
<br />
[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9014Topology Qualifying Exam2014-12-24T04:58:54Z<p>Rzachariah: </p>
<hr />
<div>Here are Sara Jensen's solutions to the Algebraic Topology Qualifying exam. These had been available on her UW page, she was nice enough to pass them on once she had graduated.<br />
<br />
[[http://atrium.math.wisc.edu/sites/default/files/aug94.pdf Aug-94]]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Topology_Qualifying_Exam&diff=9013Topology Qualifying Exam2014-12-24T04:57:38Z<p>Rzachariah: Created page with "Here are Sara Jensen's solutions to the Algebraic Topology Qualifying exam. These had been available on her UW page, she was nice enough to pass them on once she had graduate..."</p>
<hr />
<div>Here are Sara Jensen's solutions to the Algebraic Topology Qualifying exam. These had been available on her UW page, she was nice enough to pass them on once she had graduated.<br />
<br />
[[Aug-94]]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Main_Page&diff=8978Main Page2014-12-12T03:46:42Z<p>Rzachariah: /* Graduate Program */</p>
<hr />
<div><br />
== Welcome to the University of Wisconsin Math Department Wiki ==<br />
<br />
This site is by and for the faculty, students and staff of the UW Mathematics Department. It contains useful information about the department, not always available from other sources. Pages can only be edited by members of the department but are viewable by everyone. <br />
<br />
*[[Getting Around Van Vleck]]<br />
<br />
*[[Computer Help]] <br />
<br />
*[[Graduate Student Guide]]<br />
<br />
*[[Teaching Resources]]<br />
<br />
== Research groups at UW-Madison ==<br />
<br />
*[[Algebra]]<br />
*[[Analysis]]<br />
*[[Applied|Applied Mathematics]]<br />
*[https://www.math.wisc.edu/wiki/index.php/Research_at_UW-Madison_in_DifferentialEquations Differential Equations]<br />
*[[Geometry and Topology]]<br />
* [http://www.math.wisc.edu/~lempp/logic.html Logic]<br />
*[[Probability]]<br />
<br />
== Math Seminars at UW-Madison ==<br />
<br />
*[[Colloquia|Colloquium]]<br />
*[[Algebraic_Geometry_Seminar|Algebraic Geometry Seminar]]<br />
*[[Analysis_Seminar|Analysis Seminar]]<br />
*[[Applied/ACMS|Applied and Computational Math Seminar]]<br />
*[http://uw-aas.tumblr.com Applied Algebra Seminar]<br />
*[[Cookie_seminar|Cookie Seminar]]<br />
*[[Geometry_and_Topology_Seminar|Geometry and Topology Seminar]]<br />
*[[Group_Theory_Seminar|Group Theory Seminar]]<br />
*[[NTS|Number Theory Seminar]]<br />
*[[PDE_Geometric_Analysis_seminar| PDE and Geometric Analysis Seminar]]<br />
*[[Probability_Seminar|Probability Seminar]]<br />
* [http://www.math.wisc.edu/~lempp/conf/swlc.html Southern Wisconsin Logic Colloquium]<br />
<br />
=== Graduate Student Seminars ===<br />
<br />
*[[AMS_Student_Chapter_Seminar|AMS Student Chapter Seminar]]<br />
*[[Graduate_Algebraic_Geometry_Seminar|Graduate Algebraic Geometry Seminar]]<br />
*[[Applied/GPS| GPS Applied Math Seminar]]<br />
*[[NTSGrad|Graduate Number Theory/Representation Theory Seminar]]<br />
*[[Symplectic_Geometry_Seminar|Symplectic Geometry Seminar]]<br />
*[[Math843Seminar| Math 843 Homework Seminar]]<br />
*[[Graduate_student_reading_seminar|Graduate Probability Reading Seminar]]<br />
*[[Summer_stacks|Summer 2012 Stacks Reading Group]]<br />
*[[Graduate_Student_Singularity_Theory]]<br />
*[[Shimura Varieties Reading Group]]<br />
<br />
=== Other ===<br />
*[[Madison Math Circle]]<br />
*[[High School Math Night]]<br />
*[http://www.siam-uw.org/ UW-Madison SIAM Student Chapter]<br />
*[http://www.math.wisc.edu/%7Emathclub/ UW-Madison Math Club]<br />
*[[Putnam Club]]<br />
<br />
== Graduate Program ==<br />
<br />
* [[Algebra Qualifying Exam]]<br />
* Unofficial Student written solutions to the [[http://www.math.wisc.edu/~Strenner/balazs/Analysis_Quals.html Analysis Qualifying Exam]]<br />
* [[Topology Qualifying Exam]]<br />
<br />
== Getting started with Wiki-stuff ==<br />
<br />
Consult the [http://meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software.<br />
* [http://www.mediawiki.org/wiki/Manual:Configuration_settings Configuration settings list]<br />
* [http://www.mediawiki.org/wiki/Manual:FAQ MediaWiki FAQ]<br />
* [http://lists.wikimedia.org/mailman/listinfo/mediawiki-announce MediaWiki release mailing list]</div>Rzachariahhttps://www.math.wisc.edu/wiki/index.php?title=Main_Page&diff=8977Main Page2014-12-12T03:46:27Z<p>Rzachariah: /* Graduate Program */</p>
<hr />
<div><br />
== Welcome to the University of Wisconsin Math Department Wiki ==<br />
<br />
This site is by and for the faculty, students and staff of the UW Mathematics Department. It contains useful information about the department, not always available from other sources. Pages can only be edited by members of the department but are viewable by everyone. <br />
<br />
*[[Getting Around Van Vleck]]<br />
<br />
*[[Computer Help]] <br />
<br />
*[[Graduate Student Guide]]<br />
<br />
*[[Teaching Resources]]<br />
<br />
== Research groups at UW-Madison ==<br />
<br />
*[[Algebra]]<br />
*[[Analysis]]<br />
*[[Applied|Applied Mathematics]]<br />
*[https://www.math.wisc.edu/wiki/index.php/Research_at_UW-Madison_in_DifferentialEquations Differential Equations]<br />
*[[Geometry and Topology]]<br />
* [http://www.math.wisc.edu/~lempp/logic.html Logic]<br />
*[[Probability]]<br />
<br />
== Math Seminars at UW-Madison ==<br />
<br />
*[[Colloquia|Colloquium]]<br />
*[[Algebraic_Geometry_Seminar|Algebraic Geometry Seminar]]<br />
*[[Analysis_Seminar|Analysis Seminar]]<br />
*[[Applied/ACMS|Applied and Computational Math Seminar]]<br />
*[http://uw-aas.tumblr.com Applied Algebra Seminar]<br />
*[[Cookie_seminar|Cookie Seminar]]<br />
*[[Geometry_and_Topology_Seminar|Geometry and Topology Seminar]]<br />
*[[Group_Theory_Seminar|Group Theory Seminar]]<br />
*[[NTS|Number Theory Seminar]]<br />
*[[PDE_Geometric_Analysis_seminar| PDE and Geometric Analysis Seminar]]<br />
*[[Probability_Seminar|Probability Seminar]]<br />
* [http://www.math.wisc.edu/~lempp/conf/swlc.html Southern Wisconsin Logic Colloquium]<br />
<br />
=== Graduate Student Seminars ===<br />
<br />
*[[AMS_Student_Chapter_Seminar|AMS Student Chapter Seminar]]<br />
*[[Graduate_Algebraic_Geometry_Seminar|Graduate Algebraic Geometry Seminar]]<br />
*[[Applied/GPS| GPS Applied Math Seminar]]<br />
*[[NTSGrad|Graduate Number Theory/Representation Theory Seminar]]<br />
*[[Symplectic_Geometry_Seminar|Symplectic Geometry Seminar]]<br />
*[[Math843Seminar| Math 843 Homework Seminar]]<br />
*[[Graduate_student_reading_seminar|Graduate Probability Reading Seminar]]<br />
*[[Summer_stacks|Summer 2012 Stacks Reading Group]]<br />
*[[Graduate_Student_Singularity_Theory]]<br />
*[[Shimura Varieties Reading Group]]<br />
<br />
=== Other ===<br />
*[[Madison Math Circle]]<br />
*[[High School Math Night]]<br />
*[http://www.siam-uw.org/ UW-Madison SIAM Student Chapter]<br />
*[http://www.math.wisc.edu/%7Emathclub/ UW-Madison Math Club]<br />
*[[Putnam Club]]<br />
<br />
== Graduate Program ==<br />
<br />
* [[Algebra Qualifying Exam]]<br />
* Unofficial Student written solutions to the [[http://www.math.wisc.edu/~Strenner/balazs/Analysis_Quals.html Analysis Qualifying Exam]]<br />
* [Topology Qualifying Exam]<br />
<br />
== Getting started with Wiki-stuff ==<br />
<br />
Consult the [http://meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software.<br />
* [http://www.mediawiki.org/wiki/Manual:Configuration_settings Configuration settings list]<br />
* [http://www.mediawiki.org/wiki/Manual:FAQ MediaWiki FAQ]<br />
* [http://lists.wikimedia.org/mailman/listinfo/mediawiki-announce MediaWiki release mailing list]</div>Rzachariah