The Catalan Grenade is Accepting Papers!

-
As an inaugural post to this blog, I will announce that I am perpetually accepting papers! Here at the Catalan Grenade, I'll be going through papers on cool results, old and new, in Combinatorics and Algebra.
Currently, I am a recent graduate from UMass Amherst (Fall 2018), and am waiting to hear back from grad schools. This seems like a fun way to pass the time.

Comments

  1. nadahaageNovember 6, 2022 at 1:50 AM

    Sky River sits on land just lately acquired for the Wilton Rancheria tribe through a federal trust course of. A invoice was proposed in January of 2019 that might've allowed for the regulation of sports activities gambling through a newly-established corporation, 슬롯 머신 however the invoice was denied. First official sportsbook launched in July 2021 and first online sportsbook launched in February 2022. Betting on in-state skilled and collegiate groups is permitted. The state has proposed multiple of} payments, including one in 2021, however all have been shot down.

    ReplyDelete
  2. edmondtadrosNovember 7, 2022 at 12:50 AM

    Get ready begin out|to begin} a live dealer experience and look ahead to} particular live dealer bonus codes to be supplied. This augments their odds of profitable in future, at a real-money casino. Playing on-line brings with it countless benefits, of which the massive array of games, is one such plus level. With hundreds of slots, 먹튀사이트 먹튀프렌즈 Video Poker and desk games available, you're going to get the scope of deciding on quantity of} of them by way of only a click of a mouse. Get a Taste of Bonus Features, jackpot metropolis on-line casino actual money. For the come out guess you'll lose when a two, or 12 is rolled and win if a 7 or 11 is rolled, jackpot metropolis on-line casino actual money.

    ReplyDelete

Post a Comment

Popular posts from this blog

Extension Complexity Part II - Classifying Nonnegative Rank by Randomized Communication

-
A classical result from Yannakakis states that $$\text{xc}(P) = \text{rank}_+(S),$$ where \(P\) is a polytope with slack matrix \(S\). Yannakakis further showed that with nondeterministic communication complexity, one can give a lower bound for the nonnegative rank. This lower bound is sufficient to prove that some polytopes, like the correlation polytope, have exponential extension complexity. However, it fails for many other examples.  In a 2013 paper, "Extended formulations, nonnegative factorizations, and randomized communication protocols," by Faenza, Fiorini, Grappe, and Tiwary, they show that a model of randomized communication complexity can not only lower bound nonnegative rank, but exactly characterize it.  In my communication complexity reading group, I gave a talk presenting this paper and its results. The proofs are extremely elegant and simple, making for a very enjoyable read.  For those interested, here is a link to my lecture notes! 
Read more

Number-on-the-Forehead Communication Complexity

-
 Since the Winter 2020 semester at McGill, I've helped run a Communication Complexity reading group attended by undergraduate and graduate students. Recently, I became particularly excited by the Number-on-the-Forehead model, and gave a talk on it in the reading group.  The idea is quite simple. For 2 player communication, imagine that Alice's input is on top of Bob's forehead, making it easy for Alice to see but impossible for Bob to see. Likewise, Bob's input is on Alice's forehead.  This generalizes to k-player problems where k people stand in a circle, each with a card on their forehead indicating some information that is viewable to everyone but the forehead owner.  If this still doesn't make sense, think of this scene from The Office.  Here are the  lecture notes  I wrote for the talk. I cover basic definitions, Behrend's bound and it's application to the Exactly-N problem, and Ramsey Theoretic lower bounds on cylinders.  As I liked this topic so
Read more