{"id":266,"date":"2009-11-23T17:00:28","date_gmt":"2009-11-24T00:00:28","guid":{"rendered":"http:\/\/www.glencora.org\/?p=266"},"modified":"2009-11-23T17:00:28","modified_gmt":"2009-11-24T00:00:28","slug":"nth-semi-regular-combinatorial-potlatch","status":"publish","type":"post","link":"https:\/\/blogs.oregonstate.edu\/glencora\/2009\/11\/23\/nth-semi-regular-combinatorial-potlatch\/","title":{"rendered":"nth Combinatorial Potlatch"},"content":{"rendered":"

The Combinatorial Potlatch<\/a> is a semi-regular (which for last 7 years has been yearly!) one-day workshop in combinatorics held in Cascadia<\/a>. \u00a0It is very informal (no name tags!), very relaxed (only three talks!) and runs on next to no funding*. \u00a0The latest installment was this past weekend in Vancouver, BC, held at Simon Fraser University’s downtown campus.<\/p>\n

\"Participants<\/p>\n

I gave a version of my talk on constrained knapsack problems<\/a> (joint work with Brent Heeringa and Gordon Wilfong). \u00a0It was a lot of fun! \u00a0The discrete math crowd was fun and patiently sat through my discussions of applications and algorithms and approximations until I finally got to the meat of the talk. \u00a0I don’t normally attend discrete math events, but this was a great way to meet people in the area who are graph-minded that I otherwise might not meet. \u00a0I also hope that all their best undergraduates will be pointed my way for grad school (hint hint hint).<\/p>\n

Louis Deaett (University of Victoria) gave a talk on a (orthogonal) generalization of graph colouring to vector colours where one must assign linearly independent vectors to adjacent vertices while minimizing the dimension of the vectors. \u00a0This is certainly not something I had ever dreamt of before. \u00a0Only after having let the problem stew for a couple of days am I wondering if a notion can be (or already has been) used in the frequency assignment problem. \u00a0Rather than a node transmitting over one frequency, transmit over several; use independence to overcome interference.<\/p>\n

Omer Angel (University of British Columbia) spoke on graphs that look the same everywhere from a local perspective. \u00a0Given a local pattern centred at a vertex, what kind of graph is such that every vertex has the same local pattern? \u00a0Can the graph be finite? Must it be infinite? \u00a0For example, if the local pattern is a degree-2 star, then the graph could be a cycle or an infinite path – there is no way of telling which it is. \u00a0Certainly, I thought, you could never tell if it is finite or infinite. \u00a0Not true.<\/p>\n

So, thank you\u00a0Nancy Ann Neudauer for inviting me, Luis Goddyn for arranging the superb location, and Rob Beezer for quickly correcting that I am a proud beaver, not a duck.<\/p>\n

* The host institution provides a room and math-fuel (coffee).<\/p>\n","protected":false},"excerpt":{"rendered":"

The Combinatorial Potlatch is a semi-regular (which for last 7 years has been yearly!) one-day workshop in combinatorics held in Cascadia. \u00a0It is very informal (no name tags!), very relaxed (only three talks!) and runs on next to no funding*. \u00a0The latest installment was this past weekend in Vancouver, BC, held at Simon Fraser University’s […]<\/p>\n","protected":false},"author":3747,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[106152,106180,106190,97048],"class_list":["post-266","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-combinatorial","tag-potlatch","tag-tcs","tag-workshop"],"_links":{"self":[{"href":"https:\/\/blogs.oregonstate.edu\/glencora\/wp-json\/wp\/v2\/posts\/266","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogs.oregonstate.edu\/glencora\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.oregonstate.edu\/glencora\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/glencora\/wp-json\/wp\/v2\/users\/3747"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/glencora\/wp-json\/wp\/v2\/comments?post=266"}],"version-history":[{"count":0,"href":"https:\/\/blogs.oregonstate.edu\/glencora\/wp-json\/wp\/v2\/posts\/266\/revisions"}],"wp:attachment":[{"href":"https:\/\/blogs.oregonstate.edu\/glencora\/wp-json\/wp\/v2\/media?parent=266"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/glencora\/wp-json\/wp\/v2\/categories?post=266"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.oregonstate.edu\/glencora\/wp-json\/wp\/v2\/tags?post=266"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}