• On Dykstra’s Algorithm with Bregman Projections 

      [OWP-2024-04] Pinto, Pedro; Pischke, Nicholas (Mathematisches Forschungsinstitut Oberwolfach, 2024-04-16)
      We provide quantitative results on the asymptotic behavior of Dykstra’s algorithm with Bregman projections, a combination of the well-known Dykstra’s algorithm and the method of cyclic Bregman projections, designed to find ...
    • On Overgroups of Distinguished Unipotent Elements in Reductive Groups and Finite Groups of Lie Type 

      [OWP-2024-05] Bate, Michael; Böhm, Sören; Martin, Benjamin; Röhrle, Gerhard (Mathematisches Forschungsinstitut Oberwolfach, 2024-06-18)
      Suppose G is a simple algebraic group defined over an algebraically closed field of good characteristic p. In 2018 Korhonen showed that if H is a connected reductive subgroup of G which contains a distinguished unipotent ...
    • Proof Mining and the Convex Feasibility Problem : the Curious Case of Dykstra's Algorithm 

      [OWP-2024-06] Pinto, Pedro (Mathematisches Forschungsinstitut Oberwolfach, 2024-07-15)
      In a recent proof mining application, the proof-theoretical analysis of Dykstra's cyclic projections algorithm resulted in quantitative information expressed via primitive recursive functionals in the sense of Gödel. This ...
    • The Subgroup Structure of Pseudo-Reductive Groups 

      [OWP-2024-08] Bate, Michael; Martin, Benjamin; Röhrle, Gerhard; Sercombe, Damian (Mathematisches Forschungsinstitut Oberwolfach, 2024-07-31)
      Let $k$ be a field. We investigate the relationship between subgroups of a pseudo-reductive $k$-group $G$ and its maximal reductive quotient $G'$, with applications to the subgroup structure of $G$. Let $k'/k$ be the minimal ...