https://www.math.wisc.edu/wiki/api.php?action=feedcontributions&user=Jose&feedformat=atomUW-Math Wiki - User contributions [en]2020-02-26T08:00:09ZUser contributionsMediaWiki 1.30.1https://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Days_Tensors&diff=19144Applied Algebra Days Tensors2020-02-25T22:00:40Z<p>Jose: </p>
<hr />
<div>'''Event Title''': Applied Algebra Days IV: Tensors<br />
<br />
'''When''': Friday April 17, 2020 with an arrival day on April 16, 2020.<br />
<br />
'''Where''': TBD<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Abstract''': At this event we aim to bring several researchers and students together to discuss theoretical and applied aspects of tensors. <br />
<br />
<br />
== April 17, 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 />
|9am<br />
|<br />
|<br />
|-<br />
|9:30am<br />
|<br />
|<br />
|-<br />
|10am<br />
|<br />
| <br />
|-<br />
|10:30am<br />
|<br />
| <br />
|-<br />
|11am<br />
|<br />
| <br />
|-<br />
|1:30pm<br />
| <br />
| <br />
| <br />
|-<br />
|2:30pm <br />
|<br />
| <br />
|-<br />
|4pm<br />
| JM Landsberg (Colloquium)<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Name===<br />
'''Title<br />
'''<br />
<br />
TBD.<br />
<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Days_Tensors&diff=19142Applied Algebra Days Tensors2020-02-25T21:09:07Z<p>Jose: </p>
<hr />
<div>'''Event Title''': Applied Algebra Days IV: Tensors<br />
<br />
'''When''': Friday April 17, 2020<br />
<br />
'''Where''': TBD<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Abstract''': At this event we aim to bring several researchers and students together to discuss theoretical and applied aspects of tensors. <br />
<br />
<br />
== April 17, 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 />
|9am<br />
|<br />
|<br />
|-<br />
|9:30am<br />
|<br />
|<br />
|-<br />
|10am<br />
|<br />
| <br />
|-<br />
|10:30am<br />
|<br />
| <br />
|-<br />
|11am<br />
|<br />
| <br />
|-<br />
|1:30pm<br />
| <br />
| <br />
| <br />
|-<br />
|2:30pm <br />
|<br />
| <br />
|-<br />
|4pm<br />
| JM Landsberg (Colloquium)<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Name===<br />
'''Title<br />
'''<br />
<br />
TBD.<br />
<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Days_Tensors&diff=19141Applied Algebra Days Tensors2020-02-25T21:04:25Z<p>Jose: </p>
<hr />
<div>'''Event Title''': Applied Algebra Days IV: Tensor Day<br />
<br />
'''When''': Friday April 17, 2020<br />
<br />
'''Where''': TBD<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Abstract''': At this event we aim to bring several researchers and students together to discuss theoretical and applied aspects of tensors. <br />
<br />
<br />
== April 17, 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 />
|9am<br />
|<br />
|<br />
|-<br />
|9:30am<br />
|<br />
|<br />
|-<br />
|10am<br />
|<br />
| <br />
|-<br />
|10:30am<br />
|<br />
| <br />
|-<br />
|11am<br />
|<br />
| <br />
|-<br />
|1:30pm<br />
| <br />
| <br />
| <br />
|-<br />
|2:30pm <br />
|<br />
| <br />
|-<br />
|4pm<br />
| JM Landsberg (Colloquium)<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Name===<br />
'''Title<br />
'''<br />
<br />
TBD.<br />
<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Days_Tensors&diff=19140Applied Algebra Days Tensors2020-02-25T21:00:15Z<p>Jose: </p>
<hr />
<div>'''Event Title''': Applied Algebra Days 4: Tensor Day<br />
<br />
'''When''': Friday April 17, 2020<br />
<br />
'''Where''': TBD<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Abstract''': At this event we aim to bring several researchers and students together to discuss various perspectives on tensors. <br />
<br />
<br />
== April 17, 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 />
|9am<br />
|<br />
|<br />
|-<br />
|9:30am<br />
|<br />
|<br />
|-<br />
|10am<br />
|<br />
| <br />
|-<br />
|10:30am<br />
|<br />
| <br />
|-<br />
|11am<br />
|<br />
| <br />
|-<br />
|1:30pm<br />
| <br />
| <br />
| <br />
|-<br />
|2:30pm <br />
|<br />
| <br />
|-<br />
|4pm<br />
| JM Landsberg (Colloquium)<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Name===<br />
'''Title<br />
'''<br />
<br />
TBD.<br />
<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Days_Tensors&diff=19139Applied Algebra Days Tensors2020-02-25T20:55:18Z<p>Jose: /* April 17, 2020 Schedule */</p>
<hr />
<div>'''Event Title''': Applied Algebra Days 4: Tensor Day<br />
<br />
'''When''': Friday April 17, 2020<br />
<br />
'''Where''': TBD<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Abstract''': At this event we aim to bring several researchers and students together to discuss various perspectives on tensors. <br />
<br />
<br />
== April 17, 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 />
|9am<br />
|<br />
|<br />
|-<br />
|9:30am<br />
|<br />
|<br />
|-<br />
|10am<br />
|<br />
| <br />
|-<br />
|10:30am<br />
|<br />
| <br />
|-<br />
|11am<br />
|<br />
| <br />
|-<br />
|1:30pm<br />
| <br />
| <br />
| <br />
|-<br />
|2:30pm <br />
|<br />
| <br />
|-<br />
|4pm<br />
|<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Name===<br />
'''Title<br />
'''<br />
<br />
TBD.<br />
<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Days_Tensors&diff=19138Applied Algebra Days Tensors2020-02-25T20:54:27Z<p>Jose: </p>
<hr />
<div>'''Event Title''': Applied Algebra Days 4: Tensor Day<br />
<br />
'''When''': Friday April 17, 2020<br />
<br />
'''Where''': TBD<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Abstract''': At this event we aim to bring several researchers and students together to discuss various perspectives on tensors. <br />
<br />
<br />
== April 17, 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 />
|9am<br />
|<br />
|<br />
|<br />
|-<br />
|10am<br />
|<br />
| <br />
|-<br />
|11am<br />
|<br />
| <br />
|-<br />
|1:30pm<br />
| <br />
| <br />
| <br />
|-<br />
|2:30pm <br />
|<br />
| <br />
|-<br />
|4pm<br />
|<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Name===<br />
'''Title<br />
'''<br />
<br />
TBD.<br />
<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Days_Tensors&diff=19137Applied Algebra Days Tensors2020-02-25T20:53:20Z<p>Jose: Created page with "'''When''': Friday April 17, 2020 '''Where''': TBD '''Contact''': Shamgar Gurevich, Jose Israel Rodriguez '''Abstract''': At this event we aim to bring several research..."</p>
<hr />
<div>'''When''': Friday April 17, 2020<br />
<br />
'''Where''': TBD<br />
<br />
'''Contact''': Shamgar Gurevich, Jose Israel Rodriguez<br />
<br />
'''Abstract''': At this event we aim to bring several researchers and students together to discuss various perspectives on tensors. <br />
<br />
<br />
== April 17, 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 />
|9am<br />
|<br />
|<br />
|<br />
|-<br />
|10am<br />
|<br />
| <br />
|-<br />
|11am<br />
|<br />
| <br />
|-<br />
|1:30pm<br />
| <br />
| <br />
| <br />
|-<br />
|2:30pm <br />
|<br />
| <br />
|-<br />
|4pm<br />
|<br />
| <br />
|-<br />
|}<br />
<br />
== Abstracts ==<br />
===Name===<br />
'''Title<br />
'''<br />
<br />
TBD.<br />
<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19136Applied Algebra Seminar Spring 20202020-02-25T20:29:08Z<p>Jose: /* Other events to note */</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 />
|April 17<br />
|[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Days_Tensors /// Applied Algebra Days 4 - Tensors ]<br />
| Several talks on tensors <br />
|-<br />
|}<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19135Applied Algebra Seminar Spring 20202020-02-25T20:28:38Z<p>Jose: /* Other events to note */</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 />
|April 17<br />
|[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Days_Tensors /// Applied Algebra Days - Tensors ]<br />
| Several talks on tensors <br />
|-<br />
|}<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19134Applied Algebra Seminar Spring 20202020-02-25T20:28:05Z<p>Jose: /* Other events to note */</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 />
|April 17<br />
|[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Days_Tensors /// Tensor Day ]<br />
| Several talks on tensors <br />
|-<br />
|}<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Main_Page&diff=19133Main Page2020-02-25T20:26:46Z<p>Jose: /* Math Seminars at UW-Madison */</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 />
*[[Connecting/Using our research servers]]<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 />
*[[Dynamics Special Lecture]]<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 />
*[[Algebra_and_Algebraic_Geometry_Seminar|Algebra and Algebraic Geometry Seminar]]<br />
*[[Analysis_Seminar|Analysis Seminar]]<br />
*[[Applied/ACMS|Applied and Computational Math Seminar]]<br />
*[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Seminar_Spring_2020 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 />
*[[Matroids_seminar|Matroids seminar]]<br />
*[[Networks_Seminar|Networks 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 />
*[[Research Recruitment Seminar]]<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 />
*[[Graduate_Applied_Algebra_Seminar|Graduate Applied Algebra Seminar]]<br />
*[[Applied/GPS| GPS Applied Math Seminar]]<br />
*[[NTSGrad_Fall_2019|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 />
*[[Graduate/Postdoc Topology and Singularities Seminar]]<br />
*[[Shimura Varieties Reading Group]]<br />
*[[Summer graduate harmonic analysis seminar]]<br />
*[[Graduate Logic Seminar]]<br />
*[[SIAM Student Chapter Seminar]]<br />
*[[Summer 2019 Algebraic Geometry Reading Group]]<br />
*[[CCA Reading Group]]<br />
<br />
=== Other ===<br />
*[https://sites.google.com/site/uwmadisondrp/home Directed Reading Program]<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 />
*[[Undergraduate Math Competition]]<br />
*[[Basic Linux Seminar]]<br />
*[[Basic HTML Seminar]]<br />
<br />
== Graduate Program ==<br />
<br />
* [[Algebra Qualifying Exam]]<br />
* [[Analysis Qualifying Exam]]<br />
* [[Topology Qualifying Exam]]<br />
<br />
== Undergraduate Program ==<br />
<br />
* [[Overview of the undergraduate math program|Overview]]<br />
* [[Groups looking to hire students as tutors]]<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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19132Applied Algebra Seminar Spring 20202020-02-25T20:23:27Z<p>Jose: /* Other events to note */</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 />
|April 17<br />
|[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Days_Tensors /// Event: Talks on several aspects of tensors ]<br />
|<br />
|-<br />
|}<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19131Applied Algebra Seminar Spring 20202020-02-25T20:22:12Z<p>Jose: /* Other events to note */</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 />
|April 17<br />
|[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Days_Tensors/// Event: Talks on several aspects of tensors ]<br />
|<br />
|-<br />
|}<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19020Applied Algebra Seminar Spring 20202020-02-14T01:42:17Z<p>Jose: /* 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 Zacaria===<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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19002Applied Algebra Seminar Spring 20202020-02-11T19:59:50Z<p>Jose: /* Abstracts */</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 Zacaria===<br />
'''Efficient Estimation of a Sparse Delay-Doopler Channel<br />
'''<br />
<br />
TBD<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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19001Applied Algebra Seminar Spring 20202020-02-11T19:59:01Z<p>Jose: /* 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 Zacaria===<br />
'''Efficient Estimation of a Sparse Delay-Doopler Channel<br />
'''<br />
<br />
TBD<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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=19000Applied Algebra Seminar Spring 20202020-02-11T19:58:43Z<p>Jose: /* Abstracts */</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 Zacaria===<br />
'''Efficient Estimation of a Sparse Delay-Doopler Channel<br />
'''<br />
<br />
I will present parts from my talk in the upcoming CISS EE conference at Princeton (https://ee-ciss.princeton.edu).<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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18999Applied Algebra Seminar Spring 20202020-02-11T19:55:57Z<p>Jose: /* 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 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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18988Applied Algebra Seminar Spring 20202020-02-10T20:11:38Z<p>Jose: /* 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 />
|<br />
| <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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18987Applied Algebra Seminar Spring 20202020-02-10T20:11:16Z<p>Jose: /* 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 />
|<br />
| <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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18984Applied Algebra Seminar Spring 20202020-02-10T19:13:49Z<p>Jose: </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 />
|<br />
| <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 />
|Reserved<br />
|<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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18983Applied Algebra Seminar Spring 20202020-02-10T19:10:33Z<p>Jose: /* 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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|Reserved<br />
|<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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18982Applied Algebra Seminar Spring 20202020-02-10T19:10:22Z<p>Jose: /* 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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|Reserved]<br />
|<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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18981Applied Algebra Seminar Spring 20202020-02-10T19:10:02Z<p>Jose: /* 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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|Reserved]<br />
|<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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18980Applied Algebra Seminar Spring 20202020-02-10T19:09:46Z<p>Jose: /* 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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|Reserved]<br />
|<br />
|Jose<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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18979Applied Algebra Seminar Spring 20202020-02-10T19:08:48Z<p>Jose: /* 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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|(Reserved)<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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18978Applied Algebra Seminar Spring 20202020-02-10T19:08:27Z<p>Jose: /* 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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|(Reserved)<br />
|-Jose <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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18977Applied Algebra Seminar Spring 20202020-02-10T19:08:10Z<p>Jose: /* 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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|(Reserved)<br />
|-<br />
| Jose <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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18976Applied Algebra Seminar Spring 20202020-02-10T19:07:52Z<p>Jose: </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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|(Reserved)<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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar&diff=18937Applied Algebra Seminar2020-02-05T22:54:48Z<p>Jose: Redirected page to Applied Algebra Seminar Spring 2020</p>
<hr />
<div>#REDIRECT [[Applied_Algebra_Seminar_Spring_2020]]</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar&diff=18936Applied Algebra Seminar2020-02-05T22:54:04Z<p>Jose: Replaced content with "#REDIRECT https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Seminar_Spring_2020"</p>
<hr />
<div>#REDIRECT [[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Seminar_Spring_2020]]</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar&diff=18935Applied Algebra Seminar2020-02-05T22:53:44Z<p>Jose: </p>
<hr />
<div>#REDIRECT [[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Seminar_Spring_2020]]<br />
<br />
<br />
*'''When:''' Thursdays, 11am-12pm<br />
*'''Where:''' tbd<br />
<br />
= Fall 2013 Semester =<br />
<br />
<center><br />
<br />
{| style="color:black; font-size:120%" border="0" cellpadding="14" cellspacing="5"<br />
|-<br />
| bgcolor="#D0D0D0" width="300" align="center"|'''Date'''<br />
| bgcolor="#F0A0A0" width="300" align="center"|'''Speaker'''<br />
| bgcolor="#BCD2EE" width="300" align="center"|'''Title (click to see abstract)'''<br />
|- <br />
| bgcolor="#E0E0E0"| Sep 12 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.wisc.edu/~nan/ Ting-Ting Nan] <br> UW-Madison (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 12 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Sep 26 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.cs.berkeley.edu/~demmel/ Jim Demmel] <br> UC-Berkeley (Mathematics/Computer Science)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 26 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Oct 3 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.tamu.edu/~sottile/ Frank Sottile] <br> Texas A&M (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 3 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| October 17 (Thurs.) <br> '''Applied Algebra Minisymposium'''<br />
| bgcolor="#F0B0B0"| [http://homepages.math.uic.edu/~lizgross/Home.html Elizabeth Gross] <br> NCSU (Mathematics) <br><br> [http://www-personal.umich.edu/~vinzant/ Cynthia Vinzant] <br> University of Michigan (Mathematics) <br><br> [http://www.math.wisc.edu/~craciun/ Gheorge Craciun] <br> UW-Madison (Mathematics/Biomolecular Chemistry)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 17 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Oct 31 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.wisc.edu/~bridy/ Andrew Bridy] <br> UW-Madison (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 31 | <font color="black"><em>Functional Graphs of Affine-Linear Transformations over Finite Fields</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early November TBD<br />
| bgcolor="#F0B0B0"| TBD <br> Local<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Dec 5 (Thurs.)<br />
| bgcolor="#F0B0B0"| [https://sites.google.com/site/cgkoay/pr Cheng Guan Koay] <br> UW-Madison (Medical Physics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#December 5 | <font color="black"><em>tba</em></font>]]<br />
|}<br />
</center><br />
<!--<nowiki>*</nowiki> Not yet confirmed--><br />
<br />
<br />
<br><br />
<!--<br />
= Spring 2014 Semester =<br />
<br />
<center><br />
<br />
{| style="color:black; font-size:120%" border="0" cellpadding="14" cellspacing="5"<br />
|-<br />
| bgcolor="#D0D0D0" width="300" align="center"|'''Date'''<br />
| bgcolor="#F0A0A0" width="300" align="center"|'''Speaker'''<br />
| bgcolor="#BCD2EE" width="300" align="center"|'''Title (click to see abstract)'''<br />
|-<br />
| bgcolor="#E0E0E0"| Late January<br />
| bgcolor="#F0B0B0"| [http://www.maths.usyd.edu.au/u/afish/ Sasha Fish] <br> University of Sydney<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early February<br />
| bgcolor="#F0B0B0"| David Dynerman <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Late February<br />
| bgcolor="#F0B0B0"| Cynthia Vinzant <br> University of Michigan<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early March<br />
| bgcolor="#F0B0B0"| Rob Nowak <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Late March<br />
| bgcolor="#F0B0B0"| Kejia Wang <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| April 10 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.cs.uchicago.edu/people/risi/ Risi Kondor] <br> University of Chicago<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| May 1 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.stat.uchicago.edu/~lekheng/ Lek-Heng Lim] <br> University of Chicago<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| May 8 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.ma.utexas.edu/users/rward/ Rachel Ward] <br> UT-Austin<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|}<br />
<br />
</center><br />
<br />
<br><br />
--><br />
<br />
= Organizers =<br />
If you have any questions, or '''would like to speak in this seminar''', please contact the organizers:<br />
<br />
* [http://www.math.wisc.edu/~shamgar/ Shamgar Gurevich]<br />
* [http://www.math.wisc.edu/~boston/ Nigel Boston]<br />
* [http://www.math.wisc.edu/~dynerman/ David Dynerman]<br />
----<br />
Return to the [[Algebra|Algebra Group Page]]</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar&diff=18934Applied Algebra Seminar2020-02-05T22:47:19Z<p>Jose: Redirected page to Https://www.math.wisc.edu/wiki/index.php/Applied Algebra Seminar Spring 2020</p>
<hr />
<div>#REDIRECT [[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Seminar_Spring_2020]]<br />
<br />
*'''When:''' Thursdays, 11am-12pm<br />
*'''Where:''' tbd<br />
<br />
= Fall 2013 Semester =<br />
<br />
<center><br />
<br />
{| style="color:black; font-size:120%" border="0" cellpadding="14" cellspacing="5"<br />
|-<br />
| bgcolor="#D0D0D0" width="300" align="center"|'''Date'''<br />
| bgcolor="#F0A0A0" width="300" align="center"|'''Speaker'''<br />
| bgcolor="#BCD2EE" width="300" align="center"|'''Title (click to see abstract)'''<br />
|- <br />
| bgcolor="#E0E0E0"| Sep 12 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.wisc.edu/~nan/ Ting-Ting Nan] <br> UW-Madison (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 12 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Sep 26 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.cs.berkeley.edu/~demmel/ Jim Demmel] <br> UC-Berkeley (Mathematics/Computer Science)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 26 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Oct 3 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.tamu.edu/~sottile/ Frank Sottile] <br> Texas A&M (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 3 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| October 17 (Thurs.) <br> '''Applied Algebra Minisymposium'''<br />
| bgcolor="#F0B0B0"| [http://homepages.math.uic.edu/~lizgross/Home.html Elizabeth Gross] <br> NCSU (Mathematics) <br><br> [http://www-personal.umich.edu/~vinzant/ Cynthia Vinzant] <br> University of Michigan (Mathematics) <br><br> [http://www.math.wisc.edu/~craciun/ Gheorge Craciun] <br> UW-Madison (Mathematics/Biomolecular Chemistry)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 17 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Oct 31 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.wisc.edu/~bridy/ Andrew Bridy] <br> UW-Madison (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 31 | <font color="black"><em>Functional Graphs of Affine-Linear Transformations over Finite Fields</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early November TBD<br />
| bgcolor="#F0B0B0"| TBD <br> Local<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Dec 5 (Thurs.)<br />
| bgcolor="#F0B0B0"| [https://sites.google.com/site/cgkoay/pr Cheng Guan Koay] <br> UW-Madison (Medical Physics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#December 5 | <font color="black"><em>tba</em></font>]]<br />
|}<br />
</center><br />
<!--<nowiki>*</nowiki> Not yet confirmed--><br />
<br />
<br />
<br><br />
<!--<br />
= Spring 2014 Semester =<br />
<br />
<center><br />
<br />
{| style="color:black; font-size:120%" border="0" cellpadding="14" cellspacing="5"<br />
|-<br />
| bgcolor="#D0D0D0" width="300" align="center"|'''Date'''<br />
| bgcolor="#F0A0A0" width="300" align="center"|'''Speaker'''<br />
| bgcolor="#BCD2EE" width="300" align="center"|'''Title (click to see abstract)'''<br />
|-<br />
| bgcolor="#E0E0E0"| Late January<br />
| bgcolor="#F0B0B0"| [http://www.maths.usyd.edu.au/u/afish/ Sasha Fish] <br> University of Sydney<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early February<br />
| bgcolor="#F0B0B0"| David Dynerman <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Late February<br />
| bgcolor="#F0B0B0"| Cynthia Vinzant <br> University of Michigan<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early March<br />
| bgcolor="#F0B0B0"| Rob Nowak <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Late March<br />
| bgcolor="#F0B0B0"| Kejia Wang <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| April 10 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.cs.uchicago.edu/people/risi/ Risi Kondor] <br> University of Chicago<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| May 1 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.stat.uchicago.edu/~lekheng/ Lek-Heng Lim] <br> University of Chicago<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| May 8 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.ma.utexas.edu/users/rward/ Rachel Ward] <br> UT-Austin<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|}<br />
<br />
</center><br />
<br />
<br><br />
--><br />
<br />
= Organizers =<br />
If you have any questions, or '''would like to speak in this seminar''', please contact the organizers:<br />
<br />
* [http://www.math.wisc.edu/~shamgar/ Shamgar Gurevich]<br />
* [http://www.math.wisc.edu/~boston/ Nigel Boston]<br />
* [http://www.math.wisc.edu/~dynerman/ David Dynerman]<br />
----<br />
Return to the [[Algebra|Algebra Group Page]]</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar&diff=18933Applied Algebra Seminar2020-02-05T22:46:36Z<p>Jose: </p>
<hr />
<div>*'''When:''' Thursdays, 11am-12pm<br />
*'''Where:''' tbd<br />
<br />
= Fall 2013 Semester =<br />
<br />
<center><br />
<br />
{| style="color:black; font-size:120%" border="0" cellpadding="14" cellspacing="5"<br />
|-<br />
| bgcolor="#D0D0D0" width="300" align="center"|'''Date'''<br />
| bgcolor="#F0A0A0" width="300" align="center"|'''Speaker'''<br />
| bgcolor="#BCD2EE" width="300" align="center"|'''Title (click to see abstract)'''<br />
|- <br />
| bgcolor="#E0E0E0"| Sep 12 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.wisc.edu/~nan/ Ting-Ting Nan] <br> UW-Madison (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 12 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Sep 26 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.cs.berkeley.edu/~demmel/ Jim Demmel] <br> UC-Berkeley (Mathematics/Computer Science)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 26 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Oct 3 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.tamu.edu/~sottile/ Frank Sottile] <br> Texas A&M (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 3 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| October 17 (Thurs.) <br> '''Applied Algebra Minisymposium'''<br />
| bgcolor="#F0B0B0"| [http://homepages.math.uic.edu/~lizgross/Home.html Elizabeth Gross] <br> NCSU (Mathematics) <br><br> [http://www-personal.umich.edu/~vinzant/ Cynthia Vinzant] <br> University of Michigan (Mathematics) <br><br> [http://www.math.wisc.edu/~craciun/ Gheorge Craciun] <br> UW-Madison (Mathematics/Biomolecular Chemistry)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 17 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Oct 31 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.wisc.edu/~bridy/ Andrew Bridy] <br> UW-Madison (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 31 | <font color="black"><em>Functional Graphs of Affine-Linear Transformations over Finite Fields</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early November TBD<br />
| bgcolor="#F0B0B0"| TBD <br> Local<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Dec 5 (Thurs.)<br />
| bgcolor="#F0B0B0"| [https://sites.google.com/site/cgkoay/pr Cheng Guan Koay] <br> UW-Madison (Medical Physics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#December 5 | <font color="black"><em>tba</em></font>]]<br />
|}<br />
</center><br />
<!--<nowiki>*</nowiki> Not yet confirmed--><br />
<br />
<br />
<br><br />
<!--<br />
= Spring 2014 Semester =<br />
<br />
<center><br />
<br />
{| style="color:black; font-size:120%" border="0" cellpadding="14" cellspacing="5"<br />
|-<br />
| bgcolor="#D0D0D0" width="300" align="center"|'''Date'''<br />
| bgcolor="#F0A0A0" width="300" align="center"|'''Speaker'''<br />
| bgcolor="#BCD2EE" width="300" align="center"|'''Title (click to see abstract)'''<br />
|-<br />
| bgcolor="#E0E0E0"| Late January<br />
| bgcolor="#F0B0B0"| [http://www.maths.usyd.edu.au/u/afish/ Sasha Fish] <br> University of Sydney<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early February<br />
| bgcolor="#F0B0B0"| David Dynerman <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Late February<br />
| bgcolor="#F0B0B0"| Cynthia Vinzant <br> University of Michigan<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early March<br />
| bgcolor="#F0B0B0"| Rob Nowak <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Late March<br />
| bgcolor="#F0B0B0"| Kejia Wang <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| April 10 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.cs.uchicago.edu/people/risi/ Risi Kondor] <br> University of Chicago<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| May 1 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.stat.uchicago.edu/~lekheng/ Lek-Heng Lim] <br> University of Chicago<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| May 8 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.ma.utexas.edu/users/rward/ Rachel Ward] <br> UT-Austin<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|}<br />
<br />
</center><br />
<br />
<br><br />
--><br />
<br />
= Organizers =<br />
If you have any questions, or '''would like to speak in this seminar''', please contact the organizers:<br />
<br />
* [http://www.math.wisc.edu/~shamgar/ Shamgar Gurevich]<br />
* [http://www.math.wisc.edu/~boston/ Nigel Boston]<br />
* [http://www.math.wisc.edu/~dynerman/ David Dynerman]<br />
----<br />
Return to the [[Algebra|Algebra Group Page]]</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar&diff=18932Applied Algebra Seminar2020-02-05T22:46:04Z<p>Jose: Redirected page to Https://www.math.wisc.edu/wiki/index.php/Applied Algebra Seminar Spring 2020</p>
<hr />
<div>#REDIRECT [[https://www.math.wisc.edu/wiki/index.php/Applied_Algebra_Seminar_Spring_2020]]<br />
*'''When:''' Thursdays, 11am-12pm<br />
*'''Where:''' tbd<br />
<br />
= Fall 2013 Semester =<br />
<br />
<center><br />
<br />
{| style="color:black; font-size:120%" border="0" cellpadding="14" cellspacing="5"<br />
|-<br />
| bgcolor="#D0D0D0" width="300" align="center"|'''Date'''<br />
| bgcolor="#F0A0A0" width="300" align="center"|'''Speaker'''<br />
| bgcolor="#BCD2EE" width="300" align="center"|'''Title (click to see abstract)'''<br />
|- <br />
| bgcolor="#E0E0E0"| Sep 12 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.wisc.edu/~nan/ Ting-Ting Nan] <br> UW-Madison (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 12 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Sep 26 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.cs.berkeley.edu/~demmel/ Jim Demmel] <br> UC-Berkeley (Mathematics/Computer Science)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 26 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Oct 3 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.tamu.edu/~sottile/ Frank Sottile] <br> Texas A&M (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 3 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| October 17 (Thurs.) <br> '''Applied Algebra Minisymposium'''<br />
| bgcolor="#F0B0B0"| [http://homepages.math.uic.edu/~lizgross/Home.html Elizabeth Gross] <br> NCSU (Mathematics) <br><br> [http://www-personal.umich.edu/~vinzant/ Cynthia Vinzant] <br> University of Michigan (Mathematics) <br><br> [http://www.math.wisc.edu/~craciun/ Gheorge Craciun] <br> UW-Madison (Mathematics/Biomolecular Chemistry)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 17 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Oct 31 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.math.wisc.edu/~bridy/ Andrew Bridy] <br> UW-Madison (Mathematics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#October 31 | <font color="black"><em>Functional Graphs of Affine-Linear Transformations over Finite Fields</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early November TBD<br />
| bgcolor="#F0B0B0"| TBD <br> Local<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| Dec 5 (Thurs.)<br />
| bgcolor="#F0B0B0"| [https://sites.google.com/site/cgkoay/pr Cheng Guan Koay] <br> UW-Madison (Medical Physics)<br />
| bgcolor="#BCE2FE"|[[Applied Algebra Seminar/Abstracts F13#December 5 | <font color="black"><em>tba</em></font>]]<br />
|}<br />
</center><br />
<!--<nowiki>*</nowiki> Not yet confirmed--><br />
<br />
<br />
<br><br />
<!--<br />
= Spring 2014 Semester =<br />
<br />
<center><br />
<br />
{| style="color:black; font-size:120%" border="0" cellpadding="14" cellspacing="5"<br />
|-<br />
| bgcolor="#D0D0D0" width="300" align="center"|'''Date'''<br />
| bgcolor="#F0A0A0" width="300" align="center"|'''Speaker'''<br />
| bgcolor="#BCD2EE" width="300" align="center"|'''Title (click to see abstract)'''<br />
|-<br />
| bgcolor="#E0E0E0"| Late January<br />
| bgcolor="#F0B0B0"| [http://www.maths.usyd.edu.au/u/afish/ Sasha Fish] <br> University of Sydney<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early February<br />
| bgcolor="#F0B0B0"| David Dynerman <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Late February<br />
| bgcolor="#F0B0B0"| Cynthia Vinzant <br> University of Michigan<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Early March<br />
| bgcolor="#F0B0B0"| Rob Nowak <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| Late March<br />
| bgcolor="#F0B0B0"| Kejia Wang <br> UW-Madison<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|-<br />
| bgcolor="#E0E0E0"| April 10 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.cs.uchicago.edu/people/risi/ Risi Kondor] <br> University of Chicago<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| May 1 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.stat.uchicago.edu/~lekheng/ Lek-Heng Lim] <br> University of Chicago<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|- <br />
| bgcolor="#E0E0E0"| May 8 (Thurs.)<br />
| bgcolor="#F0B0B0"| [http://www.ma.utexas.edu/users/rward/ Rachel Ward] <br> UT-Austin<br />
| bgcolor="#BCE2FE"|[[NTS Fall 2013/Abstracts#September 5 | <font color="black"><em>tba</em></font>]]<br />
|}<br />
<br />
</center><br />
<br />
<br><br />
--><br />
<br />
= Organizers =<br />
If you have any questions, or '''would like to speak in this seminar''', please contact the organizers:<br />
<br />
* [http://www.math.wisc.edu/~shamgar/ Shamgar Gurevich]<br />
* [http://www.math.wisc.edu/~boston/ Nigel Boston]<br />
* [http://www.math.wisc.edu/~dynerman/ David Dynerman]<br />
----<br />
Return to the [[Algebra|Algebra Group Page]]</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18931Applied Algebra Seminar Spring 20202020-02-05T22:23:44Z<p>Jose: /* Other events to note */</p>
<hr />
<div>== 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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|<br />
| <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 />
== 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>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18928Applied Algebra Seminar Spring 20202020-02-05T22:17:04Z<p>Jose: /* Spring 2020 Schedule */</p>
<hr />
<div>== 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 />
|<br />
| <br />
|-<br />
|March 19 <br />
|Spring Break<br />
| <br />
|-<br />
|March 26<br />
|<br />
| <br />
|-<br />
|April 2<br />
|<br />
| <br />
|-<br />
|April 9<br />
|<br />
| <br />
|-<br />
|April 16<br />
|<br />
| <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 />
== 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 />
|}<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18927Applied Algebra Seminar Spring 20202020-02-05T22:13:52Z<p>Jose: /* Other events to note */</p>
<hr />
<div>== 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 />
|}<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 />
== 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 />
|}<br />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18926Applied Algebra Seminar Spring 20202020-02-05T22:13:40Z<p>Jose: /* Also of note */</p>
<hr />
<div>== 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 />
|}<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 />
== Other events to note ==<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 />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18925Applied Algebra Seminar Spring 20202020-02-05T22:13:16Z<p>Jose: /* A */</p>
<hr />
<div>== 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 />
|}<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 />
== Also of note ==<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 />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18924Applied Algebra Seminar Spring 20202020-02-05T22:12:58Z<p>Jose: /* Advertisements */</p>
<hr />
<div>== 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 />
|}<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 />
== A ==<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 />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18923Applied Algebra Seminar Spring 20202020-02-05T22:12:32Z<p>Jose: /* Abstracts */</p>
<hr />
<div>== 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 />
|}<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 />
== Advertisements ==<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 />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18922Applied Algebra Seminar Spring 20202020-02-05T22:12:02Z<p>Jose: /* Advertisements */</p>
<hr />
<div>== 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 />
|}<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 />
== 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 />
----</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18921Applied Algebra Seminar Spring 20202020-02-05T22:11:28Z<p>Jose: /* Advertisements */</p>
<hr />
<div>== 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 />
|}<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 />
==Advertisements==<br />
'''Advertisements'''<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 />
|}</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18920Applied Algebra Seminar Spring 20202020-02-05T22:11:01Z<p>Jose: /* Advertisements */</p>
<hr />
<div>== 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 />
|}<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 />
==Advertisements==<br />
Advertisements<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 />
|}</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18919Applied Algebra Seminar Spring 20202020-02-05T22:10:37Z<p>Jose: /* Advertisements */</p>
<hr />
<div>== 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 />
|}<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 />
==Advertisements==<br />
<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 />
|}</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18918Applied Algebra Seminar Spring 20202020-02-05T22:10:30Z<p>Jose: /* Advertisements */</p>
<hr />
<div>== 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 />
|}<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 />
==Advertisements==<br />
<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 />
|}</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18917Applied Algebra Seminar Spring 20202020-02-05T22:09:57Z<p>Jose: </p>
<hr />
<div>== 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 />
|}<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 />
==Advertisements==<br />
==Advertisements==<br />
<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 />
|}</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18916Applied Algebra Seminar Spring 20202020-02-05T22:09:30Z<p>Jose: </p>
<hr />
<div>== 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 />
|}<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 />
==Advertisements==<br />
<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 />
|}</div>Josehttps://www.math.wisc.edu/wiki/index.php?title=Applied_Algebra_Seminar_Spring_2020&diff=18915Applied Algebra Seminar Spring 20202020-02-05T22:08:00Z<p>Jose: /* Advertisements */</p>
<hr />
<div>== 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 />
|}<br />
<br />
==Advertisements==<br />
==Advertisements==<br />
<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 />
|}<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.</div>Jose