https://wiki.math.wisc.edu/api.php?action=feedcontributions&user=Dynerman&feedformat=atomUW-Math Wiki - User contributions [en]2022-10-07T04:10:38ZUser contributionsMediaWiki 1.35.6https://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9253AppliedAlgebraCourse2015-01-27T17:18:24Z<p>Dynerman: /* Homework #1 */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''. <br />
<br />
For now you can disregard the sections on '''Shell''' and '''Git''', just focusing on '''Python''' and an '''Editor'''<br />
<br />
A short summary of these instructions:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but an editor that highlights Python keywords is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through the Beginner Python tutorials below using ipython: as you read, type the commands into ipython. This will help you get a feel for what's happening.<br />
<br />
===Beginner Guide===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
===Intermediate Guide===<br />
http://software-carpentry.org/v5/novice/python/index.html<br />
<br />
===Additional Resources===<br />
https://github.com/UW-Madison-ACI/boot-camps<br />
<br />
=Homework #1=<br />
Download [http://www.math.wisc.edu/~dynerman/square.mat square.mat]</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9252AppliedAlgebraCourse2015-01-27T17:16:06Z<p>Dynerman: /* First steps */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''. <br />
<br />
For now you can disregard the sections on '''Shell''' and '''Git''', just focusing on '''Python''' and an '''Editor'''<br />
<br />
A short summary of these instructions:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but an editor that highlights Python keywords is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through the Beginner Python tutorials below using ipython: as you read, type the commands into ipython. This will help you get a feel for what's happening.<br />
<br />
===Beginner Guide===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
===Intermediate Guide===<br />
http://software-carpentry.org/v5/novice/python/index.html<br />
<br />
===Additional Resources===<br />
https://github.com/UW-Madison-ACI/boot-camps<br />
<br />
=Homework #1=<br />
Download [http://www.math.wisc.edu/~shamgar/square.mat square.mat]</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9251AppliedAlgebraCourse2015-01-27T17:15:30Z<p>Dynerman: /* First steps */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''. <br />
<br />
For now you can disregard the sections on '''Shell''' and '''Git''', just focusing on '''Python''' and an '''Editor'''<br />
<br />
A short summary of these instructions:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but an editor that highlights Python keywords is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through the Beginner Python tutorials below using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
===Beginner Guide===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
===Intermediate Guide===<br />
http://software-carpentry.org/v5/novice/python/index.html<br />
<br />
===Additional Resources===<br />
https://github.com/UW-Madison-ACI/boot-camps<br />
<br />
=Homework #1=<br />
Download [http://www.math.wisc.edu/~shamgar/square.mat square.mat]</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9250AppliedAlgebraCourse2015-01-27T17:14:50Z<p>Dynerman: /* Getting started with Python/Numpy/SciPy */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''. <br />
<br />
For now you can disregard the sections on '''Shell''' and '''Git''', just focusing on '''Python''' and an '''Editor'''<br />
<br />
A short summary of these instructions:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but an editor that highlights Python keywords is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
===Beginner Guide===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
===Intermediate Guide===<br />
http://software-carpentry.org/v5/novice/python/index.html<br />
<br />
===Additional Resources===<br />
https://github.com/UW-Madison-ACI/boot-camps<br />
<br />
=Homework #1=<br />
Download [http://www.math.wisc.edu/~shamgar/square.mat square.mat]</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9249AppliedAlgebraCourse2015-01-27T17:13:07Z<p>Dynerman: /* Getting started with Python/Numpy/SciPy */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''. <br />
<br />
For now you can disregard the sections on '''Shell''' and '''Git''', just focusing on '''Python''' and an '''Editor'''<br />
<br />
A short summary of these instructions:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
===Beginner Guide===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
===Intermediate Guide===<br />
http://software-carpentry.org/v5/novice/python/index.html<br />
<br />
===Additional Resources===<br />
https://github.com/UW-Madison-ACI/boot-camps<br />
<br />
=Homework #1=<br />
Download [http://www.math.wisc.edu/~shamgar/square.mat square.mat]</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9248AppliedAlgebraCourse2015-01-27T17:05:03Z<p>Dynerman: /* Getting started with Python/Numpy/SciPy */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''. For now you can disregard the sections on '''Shell''' and '''Git''', just focusing on '''Python''' and an '''Editor'''<br />
<br />
A short summary of these instructions:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
===Beginner Guide===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
===Intermediate Guide===<br />
http://software-carpentry.org/v5/novice/python/index.html<br />
<br />
===Additional Resources===<br />
https://github.com/UW-Madison-ACI/boot-camps<br />
<br />
=Homework #1=<br />
Download [http://www.math.wisc.edu/~shamgar/square.mat square.mat]</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9243AppliedAlgebraCourse2015-01-26T22:53:06Z<p>Dynerman: /* Homework #1 */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''<br />
<br />
A short summary:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
===Beginner Guide===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
===Intermediate Guide===<br />
http://software-carpentry.org/v5/novice/python/index.html<br />
<br />
===Additional Resources===<br />
https://github.com/UW-Madison-ACI/boot-camps<br />
<br />
=Homework #1=<br />
Download [http://www.math.wisc.edu/~shamgar/square.mat square.mat]</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9242AppliedAlgebraCourse2015-01-26T22:43:11Z<p>Dynerman: </p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''<br />
<br />
A short summary:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
===Beginner Guide===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
===Intermediate Guide===<br />
http://software-carpentry.org/v5/novice/python/index.html<br />
<br />
===Additional Resources===<br />
https://github.com/UW-Madison-ACI/boot-camps<br />
<br />
=Homework #1=</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9241AppliedAlgebraCourse2015-01-26T22:42:47Z<p>Dynerman: /* First steps */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''<br />
<br />
A short summary:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
===Beginner Guide===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
===Intermediate Guide===<br />
http://software-carpentry.org/v5/novice/python/index.html<br />
<br />
===Additional Resources===<br />
https://github.com/UW-Madison-ACI/boot-camps<br />
<br />
http://software-carpentry.org/lessons.html<br />
<br />
==If you've done some programming==<br />
If you have some programming experience, or once you're comfortable with the information above, please follow through this guide:<br />
<br />
http://software-carpentry.org/v5/novice/python/index.html</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9240AppliedAlgebraCourse2015-01-26T22:41:14Z<p>Dynerman: /* If you've no/minimal programming experience */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''<br />
<br />
A short summary:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==First steps==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
=== Beginner Tutorials===<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
==If you've done some programming==<br />
If you have some programming experience, or once you're comfortable with the information above, please follow through this guide:<br />
<br />
http://software-carpentry.org/v5/novice/python/index.html</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9239AppliedAlgebraCourse2015-01-26T22:39:56Z<p>Dynerman: /* Getting started with Python/Numpy/SciPy */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
'''Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md'''<br />
<br />
A short summary:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==If you've no/minimal programming experience==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
==If you've done some programming==<br />
If you have some programming experience, or once you're comfortable with the information above, please follow through this guide:<br />
<br />
http://software-carpentry.org/v5/novice/python/index.html</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9238AppliedAlgebraCourse2015-01-26T22:39:33Z<p>Dynerman: /* Getting started with Python/Numpy/SciPy */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
"""Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md"""<br />
<br />
A short summary:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==If you've no/minimal programming experience==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
==If you've done some programming==<br />
If you have some programming experience, or once you're comfortable with the information above, please follow through this guide:<br />
<br />
http://software-carpentry.org/v5/novice/python/index.html</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9237AppliedAlgebraCourse2015-01-26T22:38:53Z<p>Dynerman: /* Getting started with Python/Numpy/SciPy */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
Follow the instructions here: https://github.com/UW-Madison-ACI/boot-camps/blob/2015-01-13/setup/README.md<br />
<br />
A short summary:<br />
<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==If you've no/minimal programming experience==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
==If you've done some programming==<br />
If you have some programming experience, or once you're comfortable with the information above, please follow through this guide:<br />
<br />
http://software-carpentry.org/v5/novice/python/index.html</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9236AppliedAlgebraCourse2015-01-26T22:19:23Z<p>Dynerman: /* If you've no/minimal programming experience */</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==If you've no/minimal programming experience==<br />
Once Python is installed, you're ready to get started! Open up a command line prompt (e.g. Command Prompt on Windows, Terminal on OS X) and type<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
http://hetland.org/writing/instant-hacking.html<br />
<br />
http://www.ucs.cam.ac.uk/docs/course-notes/unix-courses/PythonAB<br />
<br />
==If you've done some programming==<br />
If you have some programming experience, or once you're comfortable with the information above, please follow through this guide:<br />
<br />
http://software-carpentry.org/v5/novice/python/index.html</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9235AppliedAlgebraCourse2015-01-26T22:17:08Z<p>Dynerman: </p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
1. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
2. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy, such as [http://www.barebones.com/products/textwrangler/ Text Wrangler] or [http://www.sublimetext.com/ Sublime Text]. <br />
<br />
==If you've no/minimal programming experience==<br />
Once Python is installed, you're ready to get started! Open up a terminal window and enter<br />
<br />
ipython<br />
<br />
to start an interactive Python shell. You can begin entering Python commands and manipulating variables immediately.<br />
<br />
If you have no prior programming experience, I recommend you work through a Python tutorial using ipython: as you read, run the commands and get a feel for what's happening.<br />
<br />
==If you've done some programming==<br />
If you have some programming experience, or once you're comfortable with the information above, please follow through this guide:<br />
<br />
http://software-carpentry.org/v5/novice/python/index.html</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9234AppliedAlgebraCourse2015-01-26T22:01:51Z<p>Dynerman: </p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
#. You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
#. You'll need a text editor to write Python in. Any text editor will work, but there are ones that highlight Python keywords which is handy.<br />
<br />
==If you've no/minimal programming experience==<br />
<br />
<br />
==If you've done some programming==<br />
If you have some programming experience, or once you're comfortable with the information above, please follow through this guide:<br />
<br />
http://software-carpentry.org/v5/novice/python/index.html</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=AppliedAlgebraCourse&diff=9232AppliedAlgebraCourse2015-01-26T20:31:28Z<p>Dynerman: Created page with "=Getting started with Python/Numpy/SciPy= ==Install Python== You'll need to install Python on your machine. We recommend the Anaconda python distribution: https://store.cont..."</p>
<hr />
<div>=Getting started with Python/Numpy/SciPy=<br />
<br />
==Install Python==<br />
You'll need to install Python on your machine. We recommend the Anaconda python distribution:<br />
<br />
https://store.continuum.io/cshop/anaconda/<br />
<br />
During installation, make Anaconda your default Python installation (unless you have some reason not to do this).<br />
<br />
==If you've no/minimal programming experience==<br />
<br />
<br />
==If you've done some programming==<br />
If you have some programming experience, or once you're comfortable with the information above, please follow through this guide:<br />
<br />
http://software-carpentry.org/v5/novice/python/index.html</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Algebra&diff=5743Algebra2013-09-01T14:42:36Z<p>Dynerman: /* Research at UW-Madison in algebra */</p>
<hr />
<div>== '''Research at UW-Madison in algebra''' ==<br />
<br />
<br />
UW-Madison offers a large, active, and varied research group in algebra, including researchers in number theory, combinatorics, group theory, algebraic geometry, representation theory, and algebra with applications to science and engineering.<br />
<br />
'''Tenured and tenure-track faculty in algebra'''<br />
<br />
[http://www.math.wisc.edu/~arinkin/ Dima Arinkin]: (Harvard, 2002) Algebraic geometry, geometric representation theory, especially geometric Langlands conjecture.<br />
<br />
[http://pages.cs.wisc.edu/~bach/bach.html Eric Bach:] (Berkeley, 1984) Theoretical computer science, computational number theory, algebraic algorithms, complexity theory, cryptography, six-string automata. (Joint appointment with CS.)<br />
<br />
[http://www.math.wisc.edu/~boston/ Nigel Boston:] (Harvard, 1987) Algebraic number theory, group theory, arithmetic geometry, computational algebra, coding theory, cryptography, and other applications of algebra to electrical engineering. (Joint appointments with ECE and CS.)<br />
<br />
[http://www.math.wisc.edu/~andreic/ Andrei Caldararu:] (Cornell, 2000) Algebraic geometry, homological algebra, string theory.<br />
<br />
[http://www.math.yale.edu/~td252/ Tullia Dymarz:] (Chicago, 2007) Geometric group theory, quasi-isometric rigidity, large scale geometry of finitely generated groups, solvable groups and quasiconformal analysis. <br />
<br />
[http://www.math.wisc.edu/~ellenber/ Jordan Ellenberg:] (Harvard, 1998) Arithmetic geometry and algebraic number theory, especially rational points on varieties over global fields.<br />
<br />
[http://www.math.wisc.edu/~derman/ Daniel Erman:] (Berkeley, 2010) Algebraic geometry and commutative algebra<br />
<br />
[http://www.math.wisc.edu/~shamgar/ Shamgar Gurevich:] (Tel Aviv, 2006) Geometric representation theory, with applications to harmonic analysis, signal processing, mathematical physics, and three-dimensional structuring of molecules.<br />
<br />
[http://www.math.wisc.edu/~terwilli/ Paul Terwilliger:] (Illinois, 1982) Combinatorics, representation theory and special functions. <br />
<br />
[http://www.math.wisc.edu/~mmwood/ Melanie Matchett Wood:] (Princeton, 2009) Number theory and arithmetic geometry.<br />
<br />
[http://www.math.wisc.edu/~thyang/ Tonghai Yang:] (Maryland, 1995) number theory, representation theory, and arithmetic geometry: especially L-functions, Eisenstein series, theta series, Shimura varieties, intersection theory, and elliptic curves.<br />
<br />
<br />
'''Postdoctoral fellows in algebra'''<br />
<!--[http://www.math.wisc.edu/~brownda/ David Brown:] (Berkeley, 2010) Number theory and arithmetic geometry, especially: p-adic cohomology, arithmetic of varieties, stacks, moduli, Galois representations, non-abelian techniques.<br />
<br />
[http://www.math.wisc.edu/~cais/ Bryden Cais:] (Michigan, 2007) Algebraic and arithmetic geometry, with a strong number theory bias.<br />
<br />
[http://www.math.wisc.edu/~ballard/ Matthew Ballard:] (U Washington, 2008) Homological mirror symmetry.--><br />
<br />
[http://www.math.wisc.edu/~rharron/ Robert Harron:] (Princeton, 2009): Algebraic number theory, Iwasawa theory, p-adic Galois representations and automorphic forms.<br />
<!--<br />
[http://www.math.wisc.edu/~klagsbru/ Zev Klagsbrun:] (UC-Irvine, 2011): Algebraic number theory and arithmetic geometry.--><br />
<br />
Parker Lowrey: (University of Texas-Austin, 2010) Algebraic geometry and algebraic topology<br />
<br />
[http://www.math.wisc.edu/~srostami/ Sean Rostami:] (University of Maryland, 2012): representation theory of algebraic groups, local models of Shimura varieties<br />
<br />
[http://www.math.wisc.edu/~josizemore/ Owen Sizemore:] (UCLA, 2012) Operator Algebras, Orbit Equivalence Ergodic Theory, Measure Equivalence Rigidity of Groups<br />
<br />
<br />
'''Seminars in algebra'''<br />
<br />
The weekly schedule at UW features many seminars in the algebraic research areas of the faculty.<br />
<br />
[https://www.math.wisc.edu/wiki/index.php/Algebraic_Geometry_Seminar Algebraic Geometry Seminar] (Fridays at 2:30)<br />
<br />
[http://uw-aas.tumblr.com Applied Algebra Seminar] (Thursdays 11)<br />
<br />
[http://www.math.wisc.edu/~terwilli/combsemsched.html Combinatorics Seminar] (Mondays at 2:25)<br />
<br />
Lie Theory Seminar (Mondays at 1:20 in VV901)<br />
<!--<br />
[https://www.math.wisc.edu/wiki/index.php/Group_Theory_Seminar Group Theory Seminar (mostly local speakers)] (Tuesdays at 4:00)--><br />
<br />
[http://www.math.wisc.edu/wiki/index.php/NTS Number Theory Seminar (outside speakers)](Thursdays at 2:30)<br />
<br />
[http://www.math.wisc.edu/wiki/index.php/NTSGrad Number Theory Seminar (grad student speakers)] (Tuesdays at 2:30)<br />
<br />
[http://silo.ece.wisc.edu/web/content/seminars SILO (Systems, Information, Learning and Optimization)] (Wednesdays at 12:30)<br />
<br />
<br />
<br />
'''Upcoming conferences in algebra held at UW'''<br />
<br />
Midwest Algebraic Geometry Conference for Graduate Students -- watch this space!<br />
<br />
<br />
'''Previous conferences in algebra held at UW'''<br />
<br />
[https://sites.google.com/site/gtntd2013/ Group Theory, Number Theory, and Topology Day], January 2013<br />
<br />
[https://sites.google.com/site/mirrorsymmetryinthemidwest/ Mirror Symmetry in the Midwest], November 2012<br />
<br />
[https://sites.google.com/site/uwmagc/ Midwest Algebraic Geometry Graduate Conference], November 2012<br />
<br />
[http://www.math.wisc.edu/~boston/applalg.html Applied Algebra Days], October 2011<br />
<br />
[https://sites.google.com/site/mntcg2011/ Midwest Number Theory Conference for Graduate Students], November 2011<br />
<br />
[http://sites.google.com/site/uwmagc/ RTG Graduate Student Workshop in Algebraic Geometry], October 2010<br />
<br />
[http://www.math.wisc.edu/~jeanluc/pAconf.html Workshop on Pseudo-Anosovs with Small Dilatation], April 2010<br />
<br />
[http://www.math.wisc.edu/~maxim/Sing10.html Singularities in the Midwest], March 2010<br />
<br />
[http://www.math.wisc.edu/~ellenber/mntcg/index.html RTG Midwest Graduate Student Conference in Number Theory], November 2009<br />
<br />
[http://www.math.wisc.edu/~ellenber/MNTD09.html Midwest Number Theory Day], November 2009<br />
<br />
Miniconference on pro-p groups in number theory, April 2008<br />
<br />
[http://www.math.wisc.edu/~ellenber/ProPday.html Pro-p groups and pro-p algebras in number theory], April 2007<br />
<br />
<br />
'''Graduate study at UW-Madison in algebra'''<br />
<br />
Algebra is among the most popular specializations for UW Ph.D. students. Regularly offered courses include a four-semester sequence in number theory; a two-semester sequence in algebraic geometry; homological algebra; representation theory; advanced topics in group theory. We also regularly offer more advanced topics courses, which in recent years have included the Gross-Zagier formula, classification of algebraic surfaces, and p-adic Hodge theory. Here is [http://www.math.wisc.edu/graduate/gcourses_fall a list of this fall's graduate courses].<br />
<br />
The department holds an [http://www.nsf.gov/awardsearch/showAward.do?AwardNumber=0838210&version=noscript NSF-RTG grant in number theory and algebraic geometry], which funds several research assistantships for graduate students (U.S. citizens and permanent residents) working in those areas. <br />
<br />
Recent Ph.D. graduates from the group have been very successful on the job market; in the last few years, we have sent alumni to postdoctoral fellowships at Berkeley, Harvard, Imperial (UK), MIT, Princeton, Stanford, University of Cologne(Germany), and UT-Austin, to tenure-track jobs at McGill, Wake Forest, Bucknell, the University of New Mexico, Chennai Mathematical Institute (India), and the University of South Carolina, and to non-academic positions at places such as Credit Suisse and the Center for Communications Research, La Jolla.<br />
<br />
<br />
'''Emeritus faculty in algebra'''<br />
<br />
Richard Askey <br />
John Bascom Professor, Ph.D Princeton (1961) <br />
Research: Special Functions<br />
<br />
Steven Bauman <br />
Professor, University of Illinois at Urbana-Champaign (1962) <br />
Research: Finite group theory<br />
<br />
Georgia Benkart <br />
E. B. Van Vleck Professor of Mathematics, Ph.D. Yale University (1974) <br />
Research: Lie Theory, Quantum Groups and Representation Theory.<br />
<br />
Michael Bleicher <br />
Professor, Ph.D. Tulane University and University of Warsaw (1961) <br />
Research: Number theory and convex geometry<br />
<br />
Richard A. Brualdi <br />
Beckwith Bascom Professor of Mathematics, Ph.D. Syracuse University (1964) <br />
Research: Combinatorics, Graph Theory, Matrix Theory, Coding Theory<br />
<br />
Donald Crowe <br />
Professor, Ph.D. University of Michigan (1959) <br />
Research: Classical geometry and African patterns<br />
<br />
Hiroshi Gunji <br />
Professor, Ph.D. Johns Hopkins University (1962) <br />
Research: Algebraic geometry<br />
<br />
I. Martin Isaacs <br />
Professor, Ph.D. Harvard University (1964) <br />
Research: Group Theory, Algebra<br />
<br />
Arnold Johnson <br />
Professor, Ph.D. University of Notre Dame (1965) <br />
Research: Classical Groups<br />
<br />
Lawrence Levy <br />
Professor, Ph.D. University of Illinois at Urbana-Champaign (1961) <br />
Research: Commutative and noncommutative ring theory<br />
<br />
J. Marshall Osborn <br />
Professor, Ph.D. University of Chicago (1957) <br />
Research: Non-associative rings and Lie algebras<br />
<br />
Donald Passman <br />
Richard Brauer Professor of Mathematics, Ph.D. Harvard University (1964) <br />
Research: Associative Rings and Algebras, Group Theory<br />
<br />
Hans Schneider <br />
J. J. Sylvester Professor of Mathematics, Ph.D. University of Edinburgh (1952) <br />
Research: Linear algebra and matrix theory<br />
<br />
Louis Solomon <br />
Professor, Ph.D. Harvard University (1958) <br />
Research: Finite group theory and hyperplane arrangements <br />
<br />
Robert Wilson <br />
Professor, Ph.D. University of Wisconsin-Madison (1969) <br />
Research: Algebra, Math. Education.</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Main_Page&diff=5742Main Page2013-09-01T14:41:47Z<p>Dynerman: /* Math Seminars at UW-Madison */</p>
<hr />
<div>[[image: VV.png|right|frame | Van Vleck Hall]]<br />
== Welcome to the University of Wisconsin Math Department Wiki ==<br />
<br />
This site is by and for the faculty, students and staff of the UW Mathematics Department. It contains useful information about the department, not always available from other sources. Pages can only be edited by members of the department but are viewable by everyone. <br />
<br />
*[[Getting Around Van Vleck]]<br />
<br />
*[[Computer Help]] <br />
<br />
*[[Graduate Student Guide]]<br />
<br />
*[[Teaching Resources]]<br />
<br />
== Research groups at UW-Madison ==<br />
<br />
*[[Algebra]]<br />
*[[Analysis]]<br />
*[[Applied|Applied Mathematics]]<br />
*[[Geometry and Topology]]<br />
* [http://www.math.wisc.edu/~lempp/logic.html Logic]<br />
*[[Probability]]<br />
<br />
== Math Seminars at UW-Madison ==<br />
<br />
*[[Colloquia|Colloquium]]<br />
*[[Algebraic_Geometry_Seminar|Algebraic Geometry Seminar]]<br />
*[[Analysis_Seminar|Analysis Seminar]]<br />
*[[Applied/ACMS|Applied and Computational Math Seminar]]<br />
*[http://uw-aas.tumblr.com Applied Algebra Seminar]<br />
*[[Cookie_seminar|Cookie Seminar]]<br />
*[[Geometry_and_Topology_Seminar|Geometry and Topology Seminar]]<br />
*[[Group_Theory_Seminar|Group Theory Seminar]]<br />
*[[NTS|Number Theory Seminar]]<br />
*[[PDE_Geometric_Analysis_seminar| PDE and Geometric Analysis Seminar]]<br />
*[[Probability_Seminar|Probability Seminar]]<br />
* [http://www.math.wisc.edu/~lempp/conf/swlc.html Southern Wisconsin Logic Colloquium]<br />
<br />
=== Graduate Student Seminars ===<br />
<br />
*[[Graduate_Algebraic_Geometry_Seminar|Graduate Algebraic Geometry Seminar]]<br />
*[[Applied/GPS| GPS Applied Math Seminar]]<br />
*[[NTSGrad|Graduate Number Theory/Representation Theory Seminar]]<br />
*[[Symplectic_Geometry_Seminar|Symplectic Geometry Seminar]]<br />
*[[Math843Seminar| Math 843 Homework Seminar]]<br />
*[[Graduate_student_reading_seminar|Graduate Probability Reading Seminar]]<br />
*[[Summer_stacks|Summer 2012 Stacks Reading Group]]<br />
*[[Graduate_Student_Singularity_Theory]]<br />
*[[Shimura Varieties Reading Group]]<br />
<br />
=== Other ===<br />
*[[Madison Math Circle]]<br />
*[[High School Math Night]]<br />
*[http://www.siam-uw.org/ UW-Madison SIAM Student Chapter]<br />
*[http://www.math.wisc.edu/%7Emathclub/ UW-Madison Math Club]<br />
*[[Putnam Club]]<br />
<br />
== Graduate Program ==<br />
<br />
* [[Algebra Qualifying Exam]]<br />
* Unofficial Student written solutions to the [[http://www.math.wisc.edu/~Strenner/balazs/Analysis_Quals.html Analysis Qualifying Exam]]<br />
<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>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5593Applied Algebra Seminar/Abstracts F132013-08-23T16:15:23Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== September 26 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="center"<br />
| [[Image:Aasf13 jimdemmel.jpg|200px]] [http://www.cs.berkeley.edu/~demmel/ Jim Demmel], UC-Berkeley (Math/CS)<br />
|- valign="top"<br />
|''TBD''<br />
|- valign="top"<br />
|TBD<br />
|}<br />
<br />
== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="center"<br />
| [[Image:Aasf13 andrewbridy.jpg|200px]] [http://www.math.wisc.edu/~bridy/ Andrew Bridy], UW-Madison (Math)<br />
|- valign="top"<br />
|''Functional Graphs of Affine-Linear Transformations over Finite Fields''<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n</math>). I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=File:Aasf13_jimdemmel.jpg&diff=5592File:Aasf13 jimdemmel.jpg2013-08-23T16:14:13Z<p>Dynerman: </p>
<hr />
<div></div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5591Applied Algebra Seminar/Abstracts F132013-08-23T16:13:24Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="center"<br />
| [[Image:Aasf13 andrewbridy.jpg|200px]] [http://www.math.wisc.edu/~bridy/ Andrew Bridy], UW-Madison (Math)<br />
|- valign="top"<br />
|''Functional Graphs of Affine-Linear Transformations over Finite Fields''<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n</math>). I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5590Applied Algebra Seminar/Abstracts F132013-08-23T16:13:01Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="center"<br />
| [[Image:Aasf13 andrewbridy.jpg|200px]] [http://www.math.wisc.edu/~bridy/ Andrew Bridy], UW-Madison (Math)<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n</math>). I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5589Applied Algebra Seminar/Abstracts F132013-08-23T16:11:36Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="center"<br />
| [[Image:Aasf13 andrewbridy.jpg|200px]] [http://www.math.wisc.edu/~bridy/ Andrew Bridy], UW-Madison (Math)<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5588Applied Algebra Seminar/Abstracts F132013-08-23T16:11:25Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="center"<br />
| [[Image:Aasf13 andrewbridy.jpg|200px]] [[http://www.math.wisc.edu/~bridy/ Andrew Bridy]], UW-Madison (Math)<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5587Applied Algebra Seminar/Abstracts F132013-08-23T16:10:59Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="center"<br />
| [[Image:Aasf13 andrewbridy.jpg|200px]] Andrew Bridy<br>UW-Madison<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5586Applied Algebra Seminar/Abstracts F132013-08-23T16:10:48Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="center"<br />
| [[Image:Aasf13 andrewbridy.jpg|200px]]<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5585Applied Algebra Seminar/Abstracts F132013-08-23T16:10:20Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="center"<br />
|Andrew Bridy<br>UW-Madison [[Image:Aasf13 andrewbridy.jpg|right|200px]]<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5584Applied Algebra Seminar/Abstracts F132013-08-23T16:10:11Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|-<br />
|Andrew Bridy<br>UW-Madison [[Image:Aasf13 andrewbridy.jpg|right|200px]]<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5583Applied Algebra Seminar/Abstracts F132013-08-23T16:09:56Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="80%"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison [[Image:Aasf13 andrewbridy.jpg|right|200px]]<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5582Applied Algebra Seminar/Abstracts F132013-08-23T16:09:45Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="70%"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison [[Image:Aasf13 andrewbridy.jpg|right|200px]]<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5581Applied Algebra Seminar/Abstracts F132013-08-23T16:09:37Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" width="40%"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison [[Image:Aasf13 andrewbridy.jpg|right|200px]]<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5580Applied Algebra Seminar/Abstracts F132013-08-23T16:09:01Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" cellwidth="40%"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison [[Image:Aasf13 andrewbridy.jpg|right|200px]]<br />
|- valign="top"<br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5579Applied Algebra Seminar/Abstracts F132013-08-23T16:08:10Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5" cellwidth="40%"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[Image:Aasf13 andrewbridy.jpg|right|200px]]<br />
|}<br />
{|<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5578Applied Algebra Seminar/Abstracts F132013-08-23T16:07:41Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[Image:Aasf13 andrewbridy.jpg|right|200px]]<br />
|}<br />
{|<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5577Applied Algebra Seminar/Abstracts F132013-08-23T16:07:10Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[Image:Aasf13 andrewbridy.jpg|right|200px]]<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5576Applied Algebra Seminar/Abstracts F132013-08-23T16:05:24Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[Image:Aasf13 andrewbridy.jpg|200px]]<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5575Applied Algebra Seminar/Abstracts F132013-08-23T16:05:15Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[Image:Aasf13 andrewbridy.jpg|50px]]<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5574Applied Algebra Seminar/Abstracts F132013-08-23T16:04:57Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[Image:Aasf13 andrewbridy.jpg]]<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5573Applied Algebra Seminar/Abstracts F132013-08-23T16:04:49Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[Images:Aasf13 andrewbridy.jpg]]<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5572Applied Algebra Seminar/Abstracts F132013-08-23T16:04:06Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[File:Aasf13 andrewbridy.jpg]]<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5571Applied Algebra Seminar/Abstracts F132013-08-23T16:03:26Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[Aasf13 andrewbridy.jpg]]<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5570Applied Algebra Seminar/Abstracts F132013-08-23T16:03:17Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[Aasf13 andrewbridy.jpg]<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=File:Aasf13_andrewbridy.jpg&diff=5569File:Aasf13 andrewbridy.jpg2013-08-23T16:02:45Z<p>Dynerman: </p>
<hr />
<div></div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5568Applied Algebra Seminar/Abstracts F132013-08-23T16:00:27Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
|Andrew Bridy<br>UW-Madison<br />
|[[http://www.math.wisc.edu/~bridy/birds.jpg]]<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5567Applied Algebra Seminar/Abstracts F132013-08-23T15:52:29Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\operatorname{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5566Applied Algebra Seminar/Abstracts F132013-08-23T15:50:28Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of <math>\text{GL}_n(q)</math>. This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5565Applied Algebra Seminar/Abstracts F132013-08-23T15:49:53Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of <math>(\mathbb{F}_q)^n</math> as vertices and drawing an edge from <math>v</math> to <math>w</math> if <math>Av = w</math>. In 1959, Elspas determined the "functional graphs" on <math>q^n</math> vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of <math>(\mathbb{F}_q)^n)</math>. I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of <math>(F_q)^n</math> under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of GL_n(q). This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5564Applied Algebra Seminar/Abstracts F132013-08-23T15:48:07Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="5"<br />
|- valign="top"<br />
| '''Title:''' <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
| '''Abstract:''' <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of (\F_q)^n as vertices and drawing an edge from v to w if Av = w. In 1959, Elspas determined the "functional graphs" on q^n vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of (\F_q)^n). I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of (F_q)^n under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of GL_n(q). This is joint work with Eric Bach.<br />
|}</div>Dynermanhttps://wiki.math.wisc.edu/index.php?title=Applied_Algebra_Seminar/Abstracts_F13&diff=5563Applied Algebra Seminar/Abstracts F132013-08-23T15:47:49Z<p>Dynerman: /* October 31 */</p>
<hr />
<div>== October 31 ==<br />
{| cellpadding="2"<br />
|- valign="top"<br />
| Title: <br />
|Functional Graphs of Affine-Linear Transformations over Finite Fields<br />
|- valign="top"<br />
|Abstract: <br />
|A linear transformation <math>A: (\mathbb{F}_q)^n \to (\mathbb{F}_q)^n</math> gives rise to a directed graph by regarding the elements of (\F_q)^n as vertices and drawing an edge from v to w if Av = w. In 1959, Elspas determined the "functional graphs" on q^n vertices that are realized in this way. In doing so he showed that there are many non-similar linear transformations which have isomorphic functional graphs (and so are conjugate by a non-linear permutation of (\F_q)^n). I review some of this work and prove an new upper bound on the number of equivalence classes of affine-linear transformations of (F_q)^n under the equivalence relation of isomorphism of functional graphs. This bound is significantly smaller than the number of conjugacy classes of GL_n(q). This is joint work with Eric Bach.<br />
|}</div>Dynerman