From jn at di.ku.dk Sun Oct 5 21:03:44 2025 From: jn at di.ku.dk (=?UTF-8?Q?Jakob_Nordstr=C3=B6m?=) Date: Sun, 5 Oct 2025 21:03:44 +0200 Subject: [Proof Complexity] MIAO seminar Mon Oct 13 at 10:00 CE(S)T (note the time!) with Marc Vinyals: Lifting with colourful sunflowers Message-ID: <70ebf956-4f00-443e-9e7c-79e5751e3ceb@di.ku.dk> Dear all, On Monday October 13 at 10:00 CE(S)T (note the time!), we will have the pleasure of listening to a presentation by Marc Vinyals from the University of Auckland titled "Lifting with colourful sunflowers". You find the abstract at the bottom of this message. This will be a video seminar at https://lu-se.zoom.us/j/61925271827 . Please feel free to share this information with colleagues who you think might be interested. We are also hoping to record the seminar and post on the MIAO Research YouTube channel https://youtube.com/@MIAOresearch for people who would like to hear the talk but cannot attend. More information about the MIAO seminar series can be found at https://jakobnordstrom.se/miao-seminars/ . In particular, note that tomorrow Monday October 6 at 14:00 we will have a seminar with Bruno Pasqualotto Cavalar on the latest news in circuit complexity. If you do not wish to receive these announcements, or receive several copies of them, please send a message to jn at di.ku.dk. Best regards, Jakob Nordstr?m ********** /Monday Oct 13 at 10:00 (note the time!) on Zoom *Lifting with colourful sunflowers *(Marc Vinyals, University of Auckland) / Query-to-communication lifting is a very useful tool for proving lower bounds and separations in communication complexity, circuit complexity, and proof complexity. However, one perceived drawback is that the bounds obtained through lifting are not very strong in terms of hidden constants. In this talk we discuss monotone circuit lower bounds for natural functions such as clique that not only match but improve previously known bounds. We do this by proving an extension to lifting theorems over non-binary alphabets. Joint work with Susanna de Rezende. Jakob Nordstr?m, Professor University of Copenhagen and Lund University Phone: +45 28 78 38 11 / +46 70 742 21 98 https://jakobnordstrom.se From jibl3azzmenusa at gmail.com Fri Oct 10 20:07:24 2025 From: jibl3azzmenusa at gmail.com (jib l3azz) Date: Fri, 10 Oct 2025 19:07:24 +0100 Subject: [Proof Complexity] =?utf-8?b?2LTZh9in2K/YqSDYp9mE2KPYqNmI2Kkg2YE=?= =?utf-8?b?2Yog2KfZhNmF2LrYsdio?= Message-ID: ????? ?????? ?? ?????? From jibl3azzmenusa at gmail.com Fri Oct 10 20:08:06 2025 From: jibl3azzmenusa at gmail.com (jib l3azz) Date: Fri, 10 Oct 2025 19:08:06 +0100 Subject: [Proof Complexity] =?utf-8?b?2LTZh9in2K/YqSDYp9mE2KPYqNmI2Kkg2YE=?= =?utf-8?b?2Yog2KfZhNmF2LrYsdio?= Message-ID: ?? ?? ????? ?????? ??? ????? ?????? ??????? ????? ????? ????? ?? ???? ?????? ??????? https://www.targir.com/2025/04/blog-post_14.html ??????? ????? ???????? ????? ?????? ?????????? ????????? ???????? ??? ?? ?? ????? ?????? ?? ??????? ????? ?????? ????? ??????? ???? ????? ??? ??? ?????? ?????? ??????? ??????? ??? ????? ?????? ?????????? ?? ??? ??? ???? ??? ???? ???? ?? ????? ????. ????? ??? ??????? ????? ?? ????????? ???????? ???? ???? ??? ????? ?????? ???????. ??????? ???? ?????? ??????? ????? ?????? 1. ??????? ??? ???????? ?? ?????? ??????? ????? ???? ??? ???? ???? ?????? ?? ?? ??????? ???? ??????? ?? ???? ?????? ???????? ????? ???? ??? ??? ???? ?????? ??? ????? ??????. 2. ????? ????? ?? ???? ??? ???? ?? ????? ??? ???? ????? ?????? ??? ???????? ????? ??? ??????? ?????? ??????? ???????. ??????? ?????? ??? ????? ?????? ????: ??? ???? ???? ??????? ????? ??? ???? ?? ??? ??? ????? ????? ??? ??? ??????? ?????????? ???? ??? ???? ??? ??? ????? ?? ????? ???? ?? ??? ????? ??? ????? ?????? ??????. ??????: ??????? ???????? ???? ?? ????? ??????? ??????? ??? ???????? ????? ?????? (?? ????) ????? ???? ??????? ????? ?????? ????? ?? ??????? ???? ????? ???? ?????? ????? ????? ?????? pdf ???? ??? ??????? ??????????? ????? ????? ????? ?????? PDF ???? ???????? ??? ?? ??????? ?????? ?? ??? ??? ??? ??? ?????? ???? ??????? ?????? ?????? ??????? ?????? ?????. ??????? ??????? ??? ????? ?????? ?? ???? ????? ??? ????? ?????? ??????????? ??? ??????? ??? ?????? ?????? ?????? ???? ???????. ?? ?? ??? ?????? ??? ????? ??????? ?? ????? ????? ??? ??? ???????? ???? ???? ?? ?????? ??? ??? ??? ????? ????? ??? ????? ?????. ??? ??? ????? ?????? ???? ???????? ????????? ?????? ?? ????? ??? ??? ?????? ??? ????? ?????? ???? ???????? ????????? ?????? ???? ???? ???? ??????? ???: 1. ??????? ?????? ?????? ????? ?????? ?? ????? ?? ??? ??????? ????????? ????? ????? ???? ??? ??????? ????? ??????? ??? ?? ????? ??: ??????? ???????? ???????? ????? ????? ?? ????? ??????? ????? ???? ?????? ??????? ?????? ?????????? 2. ??????? ??????? ????? ????? ?? ????? ??? ???? ????? ???? ????? ??? ??????? ?? ????? ??????? ??? ????? ?? ????? ?????? ?? ????? ?????? ?????????? ??? ?? ???? ????? ?????? ?????? ?? ??? ??????? ????????? ??????. ????? ?????? ?????? ?? ??? ??????? ?? ????? ????? ?????? ?????? ???? ??? ????? ?? ????? ?????? ?? ???? ?? ??? ??????? ????????. ???? ????? ??????? ?????? ??????? ??????? ???????? ??????? ?????? : ? ????? ??????? ? ? ?????? ??????? ??????? ?????? : ? ????? ????? ???? ? ? ?????? ??????? . ??????? ??????? ??????? ??????? ???????? ??????? ???????? ??????? ???? ????? ???? ????? ??????? ??????? ?????? ?????? ??????? ???????? ??????? ???? ????? ???? ????? ?? ???? ???? ?????? ??? ?????? ????? ?????? ???? ??????? ????? ?????? ???????? ???????? ???? ????????? (??????? ???????) ????? ?????? ???????? ????????_????? ????? ????? ????? ?? ???? ?????? ??????? ????? ????? ?????? ??????? ????? ?????? ??: [??? ???????] ??? ?????: [????? ???????] ??? ??????: [????? ???????] ???? ????? ??????? ??? ?????? ?????: ????? ??????: [????? ?????? ????] ??? ????? ??????? ???????: [??? CIN] ????? ????? ????????: [????? ????? ????? ????] ??????? ??????: [????? ???????] ??????: [?????? ???????] ?????? ????? ???? ?????? ???? ??????? ??????????? ??? ???: ?? ????? (?) ?????? (?): [??? ?????/?] ??????? (?) ??????: [????? ???????] ??: [???? ???????] ??(??) ????/????? ?????????(?)? ??? ????(?) ????? ????? ????? ????? ???? ???? ??????: [??? ????]? ???????? ??????: [????? ????? ????]? ???????? ???? ????? ??????? ???????: [??? CIN ????]. ?????? ???? ????????? ????????? ???????? ???? ??? ?????/?? ????? ?? ??????? ??????? ????? ??? ????? ???? ??? ????? ??? ??????? ?? ??????? ?? ?????? ???????. ??????? ????? ??????: _____________________ ???????: ___________________________ ???????: ____ / ____ / ________ ??????? : ????? ??? ??????? ???????? ??????? ??: ???? ??????? ???????? ????? ??????? ????? ???????? ??????. ?????? ??? ????? ??? ??????? ?????????? (??? ???? ??????) ???? ??? ??? ???????? ??? ????? ????? ?? ??? ??? ????. From jibl3azzmenusa at gmail.com Fri Oct 10 20:08:19 2025 From: jibl3azzmenusa at gmail.com (jib l3azz) Date: Fri, 10 Oct 2025 19:08:19 +0100 Subject: [Proof Complexity] =?utf-8?b?2KfZhti22YUg2YTYrdiz2KfYqCBDYW52YSBQ?= =?utf-8?b?cm8g2YXYrNin2YbZi9inINin2YTYotmG?= Message-ID: ???? ???? ??? ???? Canva Pro ?????? ??? ???? ?????? ?????? ???????? ??????? ?? 2025? ?????? ?? ???? ??????? ???????? ??? ?? ?????. ?? ??? ?????? ???? ?? ????? ?????? ??? ???? ?????? ????? Canva Pro Edu? ??? ???? ????? ?? ???????? ??????? ???????? ??????? ???????. https://www.targir.com/2025/02/canva-pro.html ?? ?? Canva Pro? Canva ???? ????? ?????? ??????? ???? ????? ???? ???????? ??????? ??????? ????????? ???????? ???? ??? ??????. ?????? ??????? ???? ????? ?????? ??????? ????? ???? Canva Pro ????? ???? ?? ????? ???????????? ????? ???????? ??? ????? ???????? ?????? ????? ???? ?????. ????? ???????? ?????? ???????: ???? ?????? ????? ??????? ???? ??????? ??????? ?? 5 ???? ?????. ????? ?????????. Canva Pro: ????? ???? ???? ?? 100 ????? ????? ????? ??????? 1 ???????? ?????? ?????? ??? ????? ?????? ???????. Canva Teams: ???? ????????? ?? ????? ????? ???? ?????? ??????? ????????. Canva Pro Edu: ????? ???????? ???????? ????? ??? ???? ????? Canva Pro ???????? ??? ????? ???????. ??? ???? ??? Canva Pro Edu ??????? ? ??????? ??? ???? ???? ???? ??? ????????. ? ????? ???? ???? ?? ??????? ????? ???????? ?? ????. ? ??? ???? ??????? ????? ????? ???????? ??? Canva Pro Edu ????? ????? ???????. ???? ????? ???????? ? ?? ???? ?????? ?? ?????? ?????? ???????. ? ???? ???????? ????? ???????? (??? edu). ? ???????? ??? ???? ???? ???. ?? ???? ?????? ??? Canva Pro ???? ????? ???? ???? ???? ??????? ?????? ???? 30 ????? ????? ?????? ??? ?????? ??????. ???? ??? ?????? ?????? ????? ???????? ?????? ????? ???????? ??? ???????? ????? ??????. ??? ?????? ??? Canva Pro ???? ?????? ???? ????? ???? ???? ??? ??? ?????? ?????????. ??? ??????? ???? ?????? Canva Pro Edu ?????? ? ????? ??? ???? ?? 100 ????? ???? ????? ?????????. ? ???? ?? 600 ??? ???? ???????. ? ????? ?????? ??? ????? ??????? ?????? ?????? ????????. ? ????? ????? 1 ????????. ? ??????? ????? ??????? ?? ?????? ???????? ??? ?????? ??????. ????? ????? Canva Pro Edu? ??? ?????? ????? ???? ????? Canva Pro ??? ?????? ??? ????? ???????? ?????? ???? ???????? ??????? ?????? ?????? ????? ????????. ?????? ??? ??? ???? ?????? ????? ????? ???? ????? ?????????. ????? ??? ??? ?????? ?? ??????? ??? ???? ????? ?????? ??? Canva Pro ?????? ?? ??? ???? ?????? ??? Canva Pro Edu. ???? ?????? ????? ?? ???? ??????? ??????? ??? ?? ????. ???? ???? ?????? ?? ???? ????? ???? ?? ????? ??????? ????????? ????????? ??????? ??? ????? ??????? ???????? Canva Pro Edu ?? 2025. From jibl3azzmenusa at gmail.com Fri Oct 10 20:08:34 2025 From: jibl3azzmenusa at gmail.com (jib l3azz) Date: Fri, 10 Oct 2025 19:08:34 +0100 Subject: [Proof Complexity] =?utf-8?b?2KPZgdi22YQgMTAg2YXZiNin2YLYuSDZhNmE?= =?utf-8?b?2KjYrdirINi52YYg2LnZhdmEINmB2Yog2KfZhNmF2LrYsdioICgyMDI1?= =?utf-8?q?=29?= Message-ID: ???? 10 ????? ????? ?? ??? ?? ?????? (2025) ??? ??? ?????? ?? ???? ????? ????????? ????? ?? ?? ???????? ??????? ?????? ????? ???????? ?? ???? ???? ??????? ?? ?????? ????? ???? ???? ??? ????? ????? ????????? ??????. ???? ??? ??????? ????? ?????? ?? ???? ??????? ?? ?????? ??????? ???? ?? ?????? ????? ?? ??????? ???????? ????? ????? ???? ??? ????? ???????? ??????? ????? ?????. ??? ??? ???? ?? ????? ?? ??? ?? ????? ????? ????? ???????? ??? ???? ??? ???????? ???? ????? ???????? ?? ??? linkedin ???????. ??? ???? ????? ???? ??? ??????? ?????? ????? ??? ????? ????? ????? ?????. ?? ???? ??? ?????? ???????? ????? ?????? ?????? ??? ????? ?????? ??????? ?????? ???? ????? ??????? ??? ?????? ????? ?????? ??? ???? ??????? ???? ?? ???? ??????. 1. TARGIR.c om ? ??? ???? ?????? ????? ??????? ???? ???? TARGIR ?? ???? ????? ????? ??????? ????? ?? ??????? ??? ???? ??? ??? ?????? ?????? ???? ????? ?? ???? ????? ???????? ???????? ??????. ???? ?????? ?????? ??? ????? ????? ???? ??? ????? ???? ?????? ???? ?????? ????? ????? ?????? ??? ?????? ????? ????? ???????? ?? ????? ??? ????? ??? ????? ???????? ?? ??? ?????? ??????? ???????. ???? ??? ???? ?? ????? ?? ?????? ???????? ?? ???? ?? ????? ?? ??? ??????? ?? ??? ????? ???? ?? ????? ??? ??????? ??????? ?? ?????? ????????? ??? TARGIR ???? ?????? ???? ??????. ??? ???? ?? ??????? ??? ????? ??? ???? ??????? ???? ?????? ??????? ???????? ????? ????????? ???? ?????? ?????? ?? ???? ????? ??????? ?? ?????? ???????. ?????? TARGIR: ??????? ????? ????? ?????? ?? ????? ????????. ????? ??????? ???? ?????? ??? ??????? ?? ??????. ????? ?????? ?????? ???? ????? ????????. ??????? ???? ??????? ??????? ??? ??????? ????????. ???? ??? ?????? ??????? ??? ???? ?? ????? ?? ??????? ?????? ?? ?????? ????????? ???????? ???????? ????????. ???? ?????? ????? ?????? ???? ??????? ??????? ?? ????? ???? ??? kpc ?????? maximus ?????? ?ngha ?????? ???????? ??? ??? ??? ???? uep ???????. ??? ???? ?????? ????? ?? ???????? ????? ??????? ?? ??? ????? ?????? ??? ???? ???????? ???? ???? ????? ?? ???????? ??????? ????????? ??????? ??????. ????? ????? ??????? ??? ??????? ??????? ?? ????? ???????? ??? ????? ??????? ???????? ??????? ????? ???? ???????. ???? ?????? ????? ?? ????? ?????? ??? ???????? ?????? ?????? ??????? ???????? ?????? ???? ???????. ??? ???? ?? ?????? ??? ??????? ???????? ?????? ????? ???????? ????? 2022 ?? ????? ???????? ????? ??? ????? ???? ??????. 2. Rekrute ? ??? ??? ?? ???? ??????? ???? Rekrute ?? ???? ????? ????? ??????? ?? ??????. ???? ????? ?? ????? ???? ?? ?????? ??????? ??????? ???? ??? ????? ???????? ???????? ???????. ????? ??: ???????? ?? ?????? ??????? ????????. ???????? ?? ??? ??? ?? ????? ????? ???????? ???????. 3. Emploi.ma ? ???? ??? ?? ?? ???????? Emploi.ma ???? ?????? ???????? ?? ????? ?? ?? ????? ????????. ???? ?? ????? ???? ??? ??? ???????? ???????? ?? ???? ?????. ??????? ?????? ?? ??????? ?? ????? ?? ??? ?? ????????? ?????? ?? ??? ????? ??? ???? ???? ???: "??? ?? ??? ???? ????? ?? ?????? 2022" ?? "???? ?? ??? ?? ???? ?????? ???????". ????? ???? ??????: ??? ??? ????? ?????? ????? ?????? ???? ????? ????? 100 ???? ?????? ????? ???????? 4. Bayt.com ? ????? ????? ??????? ??????? ??? ?? Bayt.com ??????? ???? ???? ?? ????? ??????? ??? ??? ????? ????? ????? ?? ??????? ??????? ?? ??????? ???? ??????? ????????. ?????: ???? ????? ??????? ???????? ?????? ???????? ???? ??? "??????" ?????? ??? ????? ?????. 5. Job.ma ? ???? ????? ?????? ????????? ????? ??? ??? ??? ??????: "???? ?? ??? ?? ????? ???? 2022" ?? "???? ?? ??? ?? ???????"? ??? Job.ma ?? ?????? ?????? ??. ????? ??? ??? ????? ?????? ?????? ????????? ????????? ?????????. 6. LinkedIn ? ???? ???????? ??????? ?? ?????? ?????? LinkedIn ???? ????? ????? ???? ???? ????? ????? ?? ????? ?? ?????? ?????? ??? ??????? ??? ??????? ?? ??????. ????? ?????? ??? ??? ?? ??? ??????? ?? ??????? ?????? ?? ??????? ???????? ???? ???? ?? ???? ?? ??????? ???????. 7. Indeed ? ???? ??? ???? ??????? ?? ???? Indeed ??????? ????? ???? ???? ??????? ???????? ????? ??????? ???: ????? ?? ??? ????? ?? ????? ??? ?? ??? ?? ???? ????? ??????? morocco ????? ?? ?????? ????? ?? ????? ?? ????? ?? ?????? ?????? 8. Anapec ? ??????? ??????? ??????? ????? ???? ??????? ??????? ?????? ??????? ????????? (Anapec) ???? ?????? ?????? ???? ??????? ??????? ???????? ???? ?? ?????? ?????. ???? ??????: ??? ?? ??? ???? ??????. ??????? ?? ?????? ???? ????? 2021 ?2022. 9. Wadifate ? ????? ?????? ?? ??? ?????? ?????? ??? ?????? ?? ???? ??????? ???????? ?? ??? ???? ????? ??????? ?? ??????? ??????? ?????? ?? ??? ???????? ?? ????? ?? ?????? ?????. ???? ?????? ??????? ?????? ?? ??????? ??????? ?? ????? ???????? ??? ????????? ???????? ????????. ????? ???????? ?????? ??? ??? ??? ???? ??????? ??????? ??????? ??????? ???????? ???????? ??? ??? ????? ???? ?? ????? ???? ??? maximus ?????? kpc ?????? ????? ?????. ??? ???? ?????? ?????? ?? ????? ?????? ??? ?????? ??????? ??????? ????????? ?????. ???? ??? ?????? ???? ???? ??? ?? ???? ?? ?????? ??? ??????? ???????? ?????? ????? ???????? ????? 2022? ??? ???? ??? ????? ?????? ??? ??????? ?? ??? ???????? ?? ??????? ??????. ????? ???? ??????: ??? ??? ????? ?????? ??????? ??????? ?????? ?????? ??????????????? ???????? ???? ??? ???? ????? ?????? ???????? ?? ????????? ?????????? 10. MarocAnnonces ? ??????? ???? ???? ??????? ??? ??? ???? ??????? ????? ??? ?? MarocAnnonces ????? ??? ??? ??? ?? ??????? ?????? ??? ???? ???????? ???????? ??: ??? ?? ??? ???? ?? ???? ?? ?????. ??? ?? ??? ?? ???? ?????? ?? ??????. ???? ?? ??? ?? ?????? ?????. ??????? ??????? ??? ????? ?? ??? ?? ?????? *?? ?? ???? ????? ????? ?? ????? ?? ???????* ?????? ??????: 1. TARGIR.c om ? ??? ???? ?????? ????? ??????? * ?? ?????? ????? ????? ???? ????? ?? ???????* ???? ???? ?????? ?? ??? ????? ?? ?????? ???? ?????? ?????? ?? ?????? ?????? ?????? ????????. *??? ???? ?? ??? ?? ?????? ???? ?? ?????* ?????? ????? ??? Job.ma ?MarocAnnonces? ????? ?????? ???: "??? ?? ??? ???? ?? ????? ???????" ?? "??? ?? ??? ???? ?????? ??????". ????? ?? ?? ?? ???????? ???? ?????? ????? ????? ?? ??? ?? ??????? ??? ????? ???? ????? ????? ????? ???? ???? ??? ??? ?????? ?????? ??????. ???? ??? ???? ?? ????? ?? ?????? ?? ??? ?? ????? ?? ??? ????? ?? ????? ?? ????? ???????? ????? ????? TARGIR.c om ?? ???? ???? ??? ??????? ?????? ?? ??? ???????. ?? ????? ??????? ?? ???? ???? ?????. ???? ?????? ????????? ???? ????? ???????? ??? ??????? ?? ???? ????? ?? ??????! From jn at di.ku.dk Tue Oct 14 16:40:16 2025 From: jn at di.ku.dk (=?UTF-8?Q?Jakob_Nordstr=C3=B6m?=) Date: Tue, 14 Oct 2025 16:40:16 +0200 Subject: [Proof Complexity] MIAO seminar Mon Oct 20 at 14:00 CE(S)T with Sreejata Kishor Bhattacharya and Arkadev Chattopadhyay: Exponential lower bounds on the size of ResLin proofs of nearly quadratic depth Message-ID: <7c1469a4-01f5-4e00-9a3c-c608ffeafeec@di.ku.dk> Dear all, On Monday October 20 at 14:00 CE(S)T, we will have the opportunity to listen to Sreejata Kishor Bhattacharya and Arkadev Chattopadhyay from the? Tata Institute of Fundamental Research Mumbai, who will present a seminar titled? "Exponential lower bounds on the size of ResLin proofs of nearly quadratic depth". You find the abstract at the bottom of this message. This will be a video seminar at https://lu-se.zoom.us/j/61925271827 . Please feel free to share this information with colleagues who you think might be interested. We are also hoping to record the seminar and post on the MIAO Research YouTube channel https://youtube.com/@MIAOresearch for people who would like to hear the talk but cannot attend. More information about the MIAO seminar series can be found at https://jakobnordstrom.se/miao-seminars/ . If you do not wish to receive these announcements, or receive several copies of them, please send a message to jn at di.ku.dk. Best regards, Jakob Nordstr?m ********** /Monday Oct 20 at 14:00 on Zoom *Exponential lower bounds on the size of ResLin proofs of nearly quadratic depth *(Sreejata Kishor Bhattacharya and Arkadev Chattopadhyay, Tata Institute of Fundamental Research Mumbai) / Itsykson and Sokolov (2014) identified resolution over parities, that we call ResLin, as a natural and simple fragment of AC0[2]-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on a recent line of work, Efremenko and Itsykson (2025) proved lower bounds of the form exp(N^(Omega(1)), on the size of ResLin proofs whose depth is upper bounded by O(N log N), where N is the number of variables of the unsatisfiable CNF formula. The hard formula they used was Tseitin on an appropriately expanding graph, lifted by a 2-stifling gadget. They posed the natural problem of proving super-polynomial lower bounds on the size of proofs that are N^{1+eps} deep, for any constant eps > 0. We provide a significant improvement by proving a lower bound on size of the form exp( Omega(N^eps),? as long as the depth of the ResLin proofs are O(N^{2-eps}) for? every eps > 0. Our hard formula is again Tseitin on an expander graph, albeit lifted with a different type of gadget. Our gadget needs to have small correlation with all parities. An important ingredient in our work is to show that arbitrary distributions lifted with such gadgets fool "safe" affine spaces, an idea which originates in the earlier work of Bhattacharya, Chattopadhyay and Dvorak (2024). Jakob Nordstr?m, Professor University of Copenhagen and Lund University Phone: +45 28 78 38 11 / +46 70 742 21 98 https://jakobnordstrom.se From igorcarb at gmail.com Tue Oct 21 10:01:55 2025 From: igorcarb at gmail.com (Igor Carboni Oliveira) Date: Tue, 21 Oct 2025 09:01:55 +0100 Subject: [Proof Complexity] Upcoming talk: Davi Castro-Silva (University of Cambridge) Message-ID: Hi everyone, We will have our next presentation on *Thursday (23/October)* at *5pm London time*. ------------------------------------------------------------------------ *Speaker:* Davi Castro-Silva (University of Cambridge) *Title:* Polynomial Freiman-Ruzsa Algorithms *Abstract:* In a recent breakthrough in additive combinatorics, Gowers, Green, Manners, and Tao resolved the long-standing Polynomial Freiman?Ruzsa (PFR) conjecture, which characterizes approximate subgroups with only polynomial loss in parameters. This theorem bridges combinatorial and algebraic notions of structure and has wide-ranging implications across combinatorics and theoretical computer science. In this talk, I will introduce the context of the PFR theorem and describe recent joint work with Jop Bri?t, Srinivasan Arunachalam, Arkopal Dutt, and Tom Gur, in which we develop efficient algorithms for several equivalent formulations of the PFR theorem, making this deep structural result algorithmically accessible. ------------------------------------------------------------------------ You can find more information about the talk at https://sites.google.com/view/igorcarbonioliveira/online-complexity-seminar (The Zoom link is available on the same page.) Best regards, Igor From jn at di.ku.dk Tue Oct 28 14:22:48 2025 From: jn at di.ku.dk (=?UTF-8?Q?Jakob_Nordstr=C3=B6m?=) Date: Tue, 28 Oct 2025 14:22:48 +0100 Subject: [Proof Complexity] MIAO seminar Thu Oct 30 at 13:15 CET (note the time!): Proof complexity as a computational lens Message-ID: <6b573ff0-cc3b-478d-a8c1-39cec2d6c1fe@di.ku.dk> Dear all, With apologies for the short notice, this Thursday October 30 at 13:15 CET /(note the time!) /there will be a seminar titled "Proof complexity as a computational lens" given by yours truly. You find the abstract at the bottom of this message. We will run this as a MIAO hybrid seminar at Lund University. Local participants are warmly welcome to seminar room E:2116 at Ole R?mers v?g 3, while other participants are equally warmly welcome to join virtually at https://lu-se.zoom.us/j/61925271827 . This is expected to be a ca-2-hour tutorial-style seminar, which will double as the first introductory lecture of a seminar course with the same name that will be given in Copenhagen and Lund during the winter of 2025/26. The course will focus on the part of proof complexity that can also be used to analyze SAT solvers, Gr?bner basis algorithms, 0-1 linear programming solvers, and other combinatorial solving algorithms. More about the course can be found at https://jakobnordstrom.se/teaching/proofcplx25/ , but please feel free to reach out if you are interested in information about, e.g., how to follow lectures remotely. Please feel free to share this information with colleagues who you think might be interested. As usual, we are also hoping to record the seminar and post on the MIAO Research YouTube channel https://youtube.com/@MIAOresearch for people who would like to hear the talk but cannot attend. More information about the MIAO seminar series can be found at https://jakobnordstrom.se/miao-seminars/ . If you do not wish to receive these announcements, or receive several copies of them, please send a message to jn at di.ku.dk. Best regards, Jakob Nordstr?m ********** /Thursday Oct 30 at 13:15 (note the time!) in seminar room E:2116, Ole R?mers v?g 3, Lund University, and on Zoom *Proof complexity as a computational lens *(Jakob Nordstr?m, University of Copenhagen and Lund University) / This seminar will give an overview of proof complexity with a focus on "algorithmically relevant" proof systems that, besides offering interesting objects for mathematical study, can also be used to analyze real-world combinatorial solving algorithms. We will talk about proof systems [and corresponding algorithms] such as resolution [DPLL and conflict-driven clause learning SAT solving], Nullstellensatz and polynomial calculus [linear algebra and Gr?bner basis computations], and cutting planes [pseudo-Boolean solving and 0-1 integer linear programming]. Time permitting, we will also discuss briefly proof systems such as Sherali-Adams and sum of squares [linear programming and semidefinite programming hierarchies], stabbing planes [0-1 ILP], and extended resolution [SAT pre- and inprocessing]. Jakob Nordstr?m, Professor University of Copenhagen and Lund University Phone: +45 28 78 38 11 / +46 70 742 21 98 https://jakobnordstrom.se