
Gábor Braun
I approach problems from a strong algebraic viewpoint, searching for structure and operations and how they combine. My interests span from abstract algebra through topology/geometry to convex optimization.
Contact
- office
- Room 3035 at
ZIB
Room MA MA605 at TUB - email shown with JavaScript enabled
email shown with JavaScript enabled - languages
- Hungarian, English, and German
Curriculum vitae
- since 2021
- Member of MATH+
- since 2020
- Researcher at ZIB
- 2013 to 2018
- Researcher at GT
- 2011 to 2013
- Lecturer at University of Leipzig
- 2009 to 2011
- Researcher at DUE
- 2007 to 2010
- Researcher at Alfréd Rényi Institute of Mathematics
- 2004 to 2007
- Researcher at Eötvös Loránd University
- 2003 to 2004
- Researcher at Alfréd Rényi Institute of Mathematics
- 2002 to 2003
- Research Assistant at DUE
- Apr 2003
- Ph.D. in Mathematics at DUE
- Jan 2002
- M.Sc. in Mathematics at Eötvös Loránd University
Publications and preprints
Preprints and reports
- Braun, G. (2008). Geometry of splice-quotient singularities.
[arXiv]
[BibTeX]
@misc{2008_Braun_Splicequotientsingularities, archiveprefix = {arXiv}, eprint = {0812.4403}, arxiv = {arXiv:0812.4403}, primaryclass = {math.AG}, author = {Braun, Gábor}, title = {Geometry of splice-quotient singularities}, date = {2008-12-23} } - Braun, G., and Pokutta, S. (2009). A polyhedral approach to computing border bases.
[arXiv]
[BibTeX]
@misc{2010_BraunPokutta_PolyhedralApproach, archiveprefix = {arXiv}, eprint = {0911.0859}, arxiv = {arXiv:0911.0859}, primaryclass = {math.AC}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {A polyhedral approach to computing border bases}, date = {2009-11-04} } - Braun, G., and Pokutta, S. (2015). An information diffusion Fano inequality.
[arXiv]
[BibTeX]
@misc{2015_BraunPokutta_Informationdiffusionfano, archiveprefix = {arXiv}, eprint = {1504.05492}, arxiv = {arXiv:1504.05492}, primaryclass = {cs.IT}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {An information diffusion Fano inequality}, date = {2015-04-21} } - Braun, G., and Pokutta, S. (2016). An efficient high-probability algorithm for Linear Bandits.
[arXiv]
[BibTeX]
@misc{2016_BraunPokutta_Highprobabilitylinearbandits, archiveprefix = {arXiv}, eprint = {1610.02072}, arxiv = {arXiv:1610.02072}, primaryclass = {cs.DS}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {An efficient high-probability algorithm for Linear Bandits}, date = {2016-10-06} } - Braun, G., and Pokutta, S. (2021). Dual Prices for Frank–Wolfe Algorithms.
[arXiv]
[BibTeX]
@misc{2021_BraunPokutta_DualpricesFrankwolfe, archiveprefix = {arXiv}, eprint = {2101.02087}, arxiv = {arXiv:2101.02087}, primaryclass = {math.OC}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {Dual Prices for Frank--Wolfe Algorithms}, date = {2021-01-06} }
Conference contributions
- Braun, G., Pokutta, S., Tu, D., and Wright, S. (2019). Blended Conditional Gradients: the unconditioning of conditional gradients. Proceedings of the 36th International Conference on Machine Learning, 97, 735–743.
Associated with ICML 2019.
[URL]
[arXiv]
[summary]
[slides]
[poster]
[code]
[BibTeX]
@inproceedings{2018_BraunPokuttaTuStephen_Blendedconditionalgradients, year = {2019}, booktitle = {Proceedings of the 36th International Conference on Machine Learning}, series = {Proceedings of Machine Learning Research}, volume = {97}, pages = {735--743}, url = {https://proceedings.mlr.press/v97/braun19a}, archiveprefix = {arXiv}, eprint = {1805.07311}, arxiv = {arXiv:1805.07311}, primaryclass = {math.OC}, author = {Braun, Gábor and Pokutta, Sebastian and Tu, Dan and Wright, Stephen}, title = {Blended Conditional Gradients: the unconditioning of conditional gradients}, code = {https://github.com/pokutta/bcg}, poster = {https://app.box.com/s/nmmm671jd72i397nysa8emfnzh1hn6hf}, slides = {https://app.box.com/s/xbx3z7ws6dxvl3rzgj4jp6forigycooe}, summary = {https://pokutta.com/blog/research/2019/02/18/bcg-abstract.html} } - Braun, G., Pokutta, S., and Zink, D. (2017). Lazifying Conditional Gradient Algorithms. Proceedings of the 34th International Conference on Machine Learning, 70, 566–575.
Associated with ICML 2017.
[URL]
[arXiv]
[slides]
[poster]
[BibTeX]
@inproceedings{2016_BraunPokuttaZink_Lazifyinggradientalgorithms:1, year = {2017}, booktitle = {Proceedings of the 34th International Conference on Machine Learning}, series = {Proceedings of Machine Learning Research}, volume = {70}, pages = {566--575}, url = {https://proceedings.mlr.press/v70/braun17a}, archiveprefix = {arXiv}, eprint = {1610.05120}, arxiv = {arXiv:1610.05120}, primaryclass = {cs.DS}, author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel}, title = {Lazifying Conditional Gradient Algorithms}, poster = {https://app.box.com/s/lysscdg17ytpz7mqr0tu2djffyqvkl6a}, slides = {https://app.box.com/s/zsp0hixjz2ha23u1vuyosijjkjdh8k} } - Braun, G., Pokutta, S., and Roy, A. (2016). Strong Reductions for Extended Formulations. Integer Programming and Combinatorial Optimization, 9682, 350–361.
Associated with IPCO 2016.
DOI: 10.1007/978-3-319-33461-5_29
[arXiv]
[BibTeX]
@inproceedings{2015_BraunPokuttaRoy_Strongreductions:1, year = {2016}, booktitle = {Integer Programming and Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {9682}, publisher = {Springer Science+Business Media}, month = may, pages = {350--361}, doi = {10.1007/978-3-319-33461-5_29}, archiveprefix = {arXiv}, eprint = {1512.04932}, arxiv = {arXiv:1512.04932}, primaryclass = {cs.CC}, author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko}, title = {Strong Reductions for Extended Formulations} } - Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2016). The matching problem has no small symmetric SDP. Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1067–1078.
Associated with SODA 2016.
DOI: 10.1137/1.9781611974331.ch75
[arXiv]
[BibTeX]
@inproceedings{2015_BraunEtAl_MatchingproblemSdp:1, year = {2016}, booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms}, publisher = {Society for Industrial and Applied Mathematics}, pages = {1067--1078}, doi = {10.1137/1.9781611974331.ch75}, archiveprefix = {arXiv}, eprint = {1504.00703}, arxiv = {arXiv:1504.00703}, primaryclass = {cs.CC}, author = {Braun, Gábor and Brown-Cohen, Jonah and Huq, Arefin and Pokutta, Sebastian and Raghavendra, Prasad and Roy, Aurko and Weitz, Benjamin and Zink, Daniel}, title = {The matching problem has no small symmetric SDP} } - Braun, G., Pokutta, S., and Zink, D. (2015). Inapproximability of combinatorial problems via small LPs and SDPs. Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, 107–116.
Associated with STOC 2015.
DOI: 10.1145/2746539.2746550
[arXiv]
[video]
[BibTeX]
@inproceedings{2014_BraunPokuttaZink_Affinereductions:1, year = {2015}, booktitle = {Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing}, publisher = {Association for Computing Machinery}, month = jun, pages = {107--116}, doi = {10.1145/2746539.2746550}, archiveprefix = {arXiv}, eprint = {1410.8816}, arxiv = {arXiv:1410.8816}, primaryclass = {cs.CC}, author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel}, title = {Inapproximability of combinatorial problems via small LPs and SDPs}, video = {https://youtu.be/MxLEticZ8RY} } - Braun, G., and Pokutta, S. (2015). The matching polytope does not admit fully-polynomial size relaxation schemes. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 837–846.
Associated with SODA 2015.
DOI: 10.1137/1.9781611973730.57
[URL]
[arXiv]
[BibTeX]
@inproceedings{2014_BraunPokutta_Matchingpolytope:1, year = {2015}, booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms}, publisher = {Society for Industrial and Applied Mathematics}, pages = {837--846}, doi = {10.1137/1.9781611973730.57}, url = {https://eccc.weizmann.ac.il/report/2013/056}, archiveprefix = {arXiv}, eprint = {1403.6710}, arxiv = {arXiv:1403.6710}, primaryclass = {cs.CC}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {The matching polytope does not admit fully-polynomial size relaxation schemes} } - Braun, G., Fiorini, S., and Pokutta, S. (2014). Average Case Polyhedral Complexity of the Maximum Stable Set Problem. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014), 28, 515–530.
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.515
[URL]
[arXiv]
[BibTeX]
@inproceedings{2013_BraunSamuelPokutta_Averagepolyhedralcomplexity:1, year = {2014}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, series = {Leibniz International Proceedings in Informatics}, volume = {28}, publisher = {Schloss Dagstuhl – Leibniz Center for Informatics}, month = sep, pages = {515--530}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.515}, url = {https://drops.dagstuhl.de/opus/volltexte/2014/4720}, archiveprefix = {arXiv}, eprint = {1311.4001}, arxiv = {arXiv:1311.4001}, primaryclass = {cs.CC}, author = {Braun, Gábor and Fiorini, Samuel and Pokutta, Sebastian}, title = {Average Case Polyhedral Complexity of the Maximum Stable Set Problem} } - Braun, G., Pokutta, S., and Xie, Y. (2014). Info-greedy sequential adaptive compressed sensing. 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), 858–865.
Associated with Allerton 2014.
DOI: 10.1109/ALLERTON.2014.7028544
[arXiv]
[BibTeX]
@inproceedings{2014_BraunPokuttaYao_Infogreedycompressedsensing:1, year = {2014}, booktitle = {2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)}, publisher = {Institute of Electrical and Electronics Engineers}, pages = {858--865}, doi = {10.1109/ALLERTON.2014.7028544}, archiveprefix = {arXiv}, eprint = {1407.0731}, arxiv = {arXiv:1407.0731}, primaryclass = {cs.IT}, author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao}, title = {Info-greedy sequential adaptive compressed sensing} } - Braun, G., and Pokutta, S. (2013). Common Information and Unique Disjointness. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 688–697.
Associated with FOCS 2013.
DOI: 10.1109/FOCS.2013.79
[URL]
[BibTeX]
@inproceedings{2016_BraunPokutta_CommoninformationDisjointness:1, year = {2013}, booktitle = {2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, publisher = {Institute of Electrical and Electronics Engineers}, pages = {688--697}, doi = {10.1109/FOCS.2013.79}, url = {https://eccc.weizmann.ac.il/report/2013/056}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {Common Information and Unique Disjointness} } - Braun, G., and Pokutta, S. (2012). An Algebraic Approach to Symmetric Extended Formulations. Combinatorial Optimization, 7422, 141–152.
Associated with ISCO 2012.
DOI: 10.1007/978-3-642-32147-4_14
[arXiv]
[BibTeX]
@inproceedings{2012_BraunPokutta_Algebraicsymmetricformulations, year = {2012}, booktitle = {Combinatorial Optimization}, series = {Lecture Notes in Computer Science}, volume = {7422}, publisher = {Springer Science+Business Media}, month = apr, pages = {141--152}, doi = {10.1007/978-3-642-32147-4_14}, archiveprefix = {arXiv}, eprint = {1206.6318}, arxiv = {arXiv:1206.6318}, primaryclass = {cs.CC}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {An Algebraic Approach to Symmetric Extended Formulations} } - Braun, G., Fiorini, S., Pokutta, S., and Steurer, D. (2012). Approximation Limits of Linear Programs (Beyond Hierarchies). 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 480–489.
Associated with FOCS 2012.
DOI: 10.1109/FOCS.2012.10
[arXiv]
[BibTeX]
@inproceedings{2012_BraunSamuelPokuttaSteurer_Approximationlimits:1, year = {2012}, booktitle = {2012 IEEE 53rd Annual Symposium on Foundations of Computer Science}, publisher = {Institute of Electrical and Electronics Engineers}, pages = {480--489}, doi = {10.1109/FOCS.2012.10}, archiveprefix = {arXiv}, eprint = {1204.0957}, arxiv = {arXiv:1204.0957}, primaryclass = {cs.CC}, author = {Braun, Gábor and Fiorini, Samuel and Pokutta, Sebastian and Steurer, David}, title = {Approximation Limits of Linear Programs (Beyond Hierarchies)} } - Braun, G., and Pokutta, S. (2010). Rank of random half-integral polytopes. Electronic Notes in Discrete Mathematics, 36, 415–422.
Associated with ISCO 2010.
DOI: 10.1016/j.endm.2010.05.053
[URL]
[BibTeX]
@article{2011_BraunPokutta_Randomhalfintegralpolytopes:1, year = {2010}, date = {2010-08-01}, journal = {Electronic Notes in Discrete Mathematics}, volume = {36}, month = aug, pages = {415--422}, doi = {10.1016/j.endm.2010.05.053}, url = {https://optimization-online.org/?p=2010/11/2813}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {Rank of random half-integral polytopes} }
Articles, chapters and books
- Braun, G., Pokutta, S., and Weismantel, R. (2027). Alternating linear minimization: Inspired by von Neumann’s alternating projections. Discrete Applied Mathematics, 397, 438–451.
DOI: 10.1016/j.dam.2026.09.022
[arXiv]
[slides]
[video]
[BibTeX]
@article{2022_BraunPokuttaWeismantel_Alternatingminimization, year = {2027}, date = {2027-01-01}, journal = {Discrete Applied Mathematics}, volume = {397}, pages = {438--451}, doi = {10.1016/j.dam.2026.09.022}, archiveprefix = {arXiv}, eprint = {2212.02933}, arxiv = {arXiv:2212.02933}, primaryclass = {math.OC}, author = {Braun, Gábor and Pokutta, Sebastian and Weismantel, Robert}, title = {Alternating linear minimization: Inspired by von Neumann's alternating projections}, slides = {https://pokutta.com/slides/20230327-icerm.pdf}, video = {https://icerm.brown.edu/programs/sp-s23/w2/#schedule-item-4945} } - Braun, G., Halbey, J., Pokutta, S., and Woodstock, Z. (2026). Flexible block-iterative analysis for the Frank-Wolfe algorithm. Journal of Optimization Theory and Applications, 210(2), 37.
DOI: 10.1007/s10957-026-03068-1
[URL]
[arXiv]
[BibTeX]
@article{2024_BraunHalbeyPokuttaWoodstock_Blockiterativeanalysis, year = {2026}, date = {2026-07-31}, journal = {Journal of Optimization Theory and Applications}, volume = {210}, number = {2}, pages = {37}, doi = {10.1007/s10957-026-03068-1}, url = {https://link.springer.com/article/10.1007/s10957-026-03068-1}, archiveprefix = {arXiv}, eprint = {2409.06931}, arxiv = {arXiv:2409.06931}, primaryclass = {math.OC}, author = {Braun, Gábor and Halbey, Jannis and Pokutta, Sebastian and Woodstock, Zev}, title = {Flexible block-iterative analysis for the Frank-Wolfe algorithm} } - Braun, G., Carderera, A., Combettes, C., Hassani, H., Karbasi, A., Mokhtari, A., and Pokutta, S. (2025). Conditional Gradient Methods: From Core Principles to AI Applications. Society for Industrial and Applied Mathematics.
DOI: 10.1137/1.9781611978568
[arXiv]
[BibTeX]
@book{2022_BraunEtAl_Conditionalgradient, year = {2025}, series = {MOS-SIAM Series on Optimization}, publisher = {Society for Industrial and Applied Mathematics}, doi = {10.1137/1.9781611978568}, archiveprefix = {arXiv}, eprint = {2211.14103}, arxiv = {arXiv:2211.14103}, primaryclass = {math.OC}, author = {Braun, Gábor and Carderera, Alejandro and Combettes, Cyrille and Hassani, Hamed and Karbasi, Amin and Mokhtari, Aryan and Pokutta, Sebastian}, title = {Conditional Gradient Methods: From Core Principles to AI Applications} } - Braun, G., Guzmán, C., and Pokutta, S. (2024). Corrections to “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.” IEEE Transactions on Information Theory, 70(7), 5408–5409.
DOI: 10.1109/TIT.2024.3357200
[BibTeX]
@article{2024_BraunGuzmanPokutta_Oraclecomplexity, year = {2024}, date = {2024-06-21}, journal = {IEEE Transactions on Information Theory}, month = jul, volume = {70}, number = {7}, pages = {5408--5409}, doi = {10.1109/TIT.2024.3357200}, author = {Braun, Gábor and Guzmán, Cristóbal and Pokutta, Sebastian}, title = {Corrections to “Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory”} } - Braun, G., Pokutta, S., and Zink, D. (2019). Affine Reductions for LPs and SDPs. Mathematical Programming, Series A, 173(1-2), 281–312.
DOI: 10.1007/s10107-017-1221-9
[URL]
[arXiv]
[BibTeX]
@article{2014_BraunPokuttaZink_Affinereductions, year = {2019}, journal = {Mathematical Programming, Series A}, volume = {173}, number = {1-2}, pages = {281--312}, doi = {10.1007/s10107-017-1221-9}, url = {https://rdcu.be/EPf9}, archiveprefix = {arXiv}, eprint = {1410.8816}, arxiv = {arXiv:1410.8816}, primaryclass = {cs.CC}, author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel}, title = {Affine Reductions for LPs and SDPs} } - Braun, G., Pokutta, S., and Zink, D. (2019). Lazifying Conditional Gradient Algorithms. Journal of Machine Learning Research, 20(71), 1–42.
[URL]
[arXiv]
[BibTeX]
@article{2016_BraunPokuttaZink_Lazifyinggradientalgorithms, year = {2019}, journal = {Journal of Machine Learning Research}, volume = {20}, number = {71}, pages = {1--42}, url = {https://jmlr.org/papers/v20/18-114.html}, archiveprefix = {arXiv}, eprint = {1610.05120}, arxiv = {arXiv:1610.05120}, primaryclass = {cs.DS}, author = {Braun, Gábor and Pokutta, Sebastian and Zink, Daniel}, title = {Lazifying Conditional Gradient Algorithms} } - Braun, G., Schultz, P., and Strüngmann, L. (2019). Decompositions of torsion-free abelian groups. Journal of Algebra, 528, 72–84.
DOI: 10.1016/j.jalgebra.2019.02.035
[arXiv]
[BibTeX]
@article{2018_BraunSchultzStruengmann_Torsionfreedecompositions, year = {2019}, journal = {Journal of Algebra}, volume = {528}, pages = {72--84}, doi = {10.1016/j.jalgebra.2019.02.035}, archiveprefix = {arXiv}, eprint = {1810.09644}, arxiv = {arXiv:1810.09644}, primaryclass = {math.GR}, author = {Braun, Gábor and Schultz, Phill and Strüngmann, Lutz}, title = {Decompositions of torsion-free abelian groups} } - Braun, G., Pokutta, S., and Roy, A. (2018). Strong reductions for extended formulations. Mathematical Programming, Series B, 172(1-2), 591–620.
DOI: 10.1007/s10107-018-1316-y
[arXiv]
[BibTeX]
@article{2015_BraunPokuttaRoy_Strongreductions, year = {2018}, journal = {Mathematical Programming, Series B}, month = nov, volume = {172}, number = {1-2}, pages = {591--620}, doi = {10.1007/s10107-018-1316-y}, archiveprefix = {arXiv}, eprint = {1512.04932}, arxiv = {arXiv:1512.04932}, primaryclass = {cs.CC}, author = {Braun, Gábor and Pokutta, Sebastian and Roy, Aurko}, title = {Strong reductions for extended formulations} } - Braun, G., Brown-Cohen, J., Huq, A., Pokutta, S., Raghavendra, P., Roy, A., Weitz, B., and Zink, D. (2017). The matching problem has no small symmetric SDP. Mathematical Programming, Series A, 165(2), 643–662.
DOI: 10.1007/s10107-016-1098-z
[arXiv]
[BibTeX]
@article{2015_BraunEtAl_MatchingproblemSdp, year = {2017}, journal = {Mathematical Programming, Series A}, month = oct, volume = {165}, number = {2}, pages = {643--662}, doi = {10.1007/s10107-016-1098-z}, archiveprefix = {arXiv}, eprint = {1504.00703}, arxiv = {arXiv:1504.00703}, primaryclass = {cs.CC}, author = {Braun, Gábor and Brown-Cohen, Jonah and Huq, Arefin and Pokutta, Sebastian and Raghavendra, Prasad and Roy, Aurko and Weitz, Benjamin and Zink, Daniel}, title = {The matching problem has no small symmetric SDP} } - Braun, G., Guzmán, C., and Pokutta, S. (2017). Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory. IEEE Transactions on Information Theory, 63(7), 4709–4724.
DOI: 10.1109/TIT.2017.2701343
[URL]
[arXiv]
[BibTeX]
@article{2014_BraunGuzmanPokutta_Lowerboundsoraclecomplexity, year = {2017}, journal = {IEEE Transactions on Information Theory}, month = jul, volume = {63}, number = {7}, pages = {4709--4724}, doi = {10.1109/TIT.2017.2701343}, url = {https://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7919238}, archiveprefix = {arXiv}, eprint = {1407.5144}, arxiv = {arXiv:1407.5144}, primaryclass = {math.OC}, author = {Braun, Gábor and Guzmán, Cristóbal and Pokutta, Sebastian}, title = {Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory} } - Braun, G., Jain, R., Lee, T., and Pokutta, S. (2017). Information-theoretic approximations of the nonnegative rank. Computational Complexity, 26(1), 147–197.
DOI: 10.1007/s00037-016-0125-z
[URL]
[BibTeX]
@article{2017_BraunRahulTroyPokutta_Informationtheoreticnonnegativerank, year = {2017}, journal = {Computational Complexity}, volume = {26}, number = {1}, pages = {147--197}, doi = {10.1007/s00037-016-0125-z}, url = {https://eccc.weizmann.ac.il/report/2013/158}, author = {Braun, Gábor and Jain, Rahul and Lee, Troy and Pokutta, Sebastian}, title = {Information-theoretic approximations of the nonnegative rank} } - Braun, G., and Strüngmann, L. (2017). Rigid ℵ1-Free Abelian Groups with Prescribed Factors and Their Role in the Theory of Cellular Covers. In Groups, Modules, and Model Theory – Surveys and Recent Developments: In Memory of Rüdiger Göbel (pp. 69–81). Springer Science+Business Media.
DOI: 10.1007/978-3-319-51718-6_4
[BibTeX]
@incollection{2017_BraunStrngmann_Rigidabeliangroups, year = {2017}, booktitle = {Groups, Modules, and Model Theory – Surveys and Recent Developments: In Memory of Rüdiger Göbel}, publisher = {Springer Science+Business Media}, pages = {69--81}, doi = {10.1007/978-3-319-51718-6_4}, author = {Braun, Gábor and Strüngmann, Lutz}, title = {Rigid ℵ1-Free Abelian Groups with Prescribed Factors and Their Role in the Theory of Cellular Covers} } - Braun, G., Fiorini, S., and Pokutta, S. (2016). Average case polyhedral complexity of the maximum stable set problem. Mathematical Programming, Series A, 160(1-2), 407–431.
DOI: 10.1007/s10107-016-0989-3
[URL]
[arXiv]
[BibTeX]
@article{2013_BraunSamuelPokutta_Averagepolyhedralcomplexity, year = {2016}, journal = {Mathematical Programming, Series A}, month = mar, volume = {160}, number = {1-2}, pages = {407--431}, doi = {10.1007/s10107-016-0989-3}, url = {https://rdcu.be/7uOy}, archiveprefix = {arXiv}, eprint = {1311.4001}, arxiv = {arXiv:1311.4001}, primaryclass = {cs.CC}, author = {Braun, Gábor and Fiorini, Samuel and Pokutta, Sebastian}, title = {Average case polyhedral complexity of the maximum stable set problem} } - Braun, G., and Pokutta, S. (2016). Common Information and Unique Disjointness. Algorithmica, 76(3), 597–629.
DOI: 10.1007/s00453-016-0132-0
[URL]
[BibTeX]
@article{2016_BraunPokutta_CommoninformationDisjointness, year = {2016}, journal = {Algorithmica}, month = feb, volume = {76}, number = {3}, pages = {597--629}, doi = {10.1007/s00453-016-0132-0}, url = {https://rdcu.be/6b9u}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {Common Information and Unique Disjointness} } - Braun, G., and Pokutta, S. (2016). A polyhedral characterization of border bases. SIAM Journal on Discrete Mathematics, 30(1), 239–265.
DOI: 10.1137/140977990
[arXiv]
[BibTeX]
@article{2009_BraunPokutta_BorderbasesOrderidealsPolyhedral, year = {2016}, journal = {SIAM Journal on Discrete Mathematics}, volume = {30}, number = {1}, pages = {239--265}, doi = {10.1137/140977990}, archiveprefix = {arXiv}, eprint = {0912.1502}, arxiv = {arXiv:0912.1502}, primaryclass = {math.AC}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {A polyhedral characterization of border bases} } - Braun, G., and Strüngmann, L. (2016). Examples of non-dual subgroups of the Baer–Specker group. Houston Journal of Mathematics, 42(3), 723–739.
[BibTeX]
@article{2016_BraunStrngmann_Nondualsubgroups, year = {2016}, journal = {Houston Journal of Mathematics}, volume = {42}, number = {3}, pages = {723--739}, author = {Braun, Gábor and Strüngmann, Lutz}, title = {Examples of non-dual subgroups of the Baer–Specker group} } - Braun, G., and Pokutta, S. (2015). The matching problem has no fully polynomial size linear programming relaxation schemes. IEEE Transactions on Information Theory, 61(10), 5754–5764.
DOI: 10.1109/TIT.2015.2465864
[URL]
[arXiv]
[BibTeX]
@article{2014_BraunPokutta_Matchingpolytope, year = {2015}, journal = {IEEE Transactions on Information Theory}, month = oct, volume = {61}, number = {10}, pages = {5754--5764}, doi = {10.1109/TIT.2015.2465864}, url = {https://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7182355}, archiveprefix = {arXiv}, eprint = {1403.6710}, arxiv = {arXiv:1403.6710}, primaryclass = {cs.CC}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {The matching problem has no fully polynomial size linear programming relaxation schemes} } - Braun, G., Fiorini, S., Pokutta, S., and Steurer, D. (2015). Approximation Limits of Linear Programs (Beyond Hierarchies). Mathematics of Operations Research, 40(3), 756–772.
DOI: 10.1287/moor.2014.0694
[arXiv]
[BibTeX]
@article{2012_BraunSamuelPokuttaSteurer_Approximationlimits, year = {2015}, journal = {Mathematics of Operations Research}, month = aug, volume = {40}, number = {3}, pages = {756--772}, doi = {10.1287/moor.2014.0694}, archiveprefix = {arXiv}, eprint = {1204.0957}, arxiv = {arXiv:1204.0957}, primaryclass = {cs.CC}, author = {Braun, Gábor and Fiorini, Samuel and Pokutta, Sebastian and Steurer, David}, title = {Approximation Limits of Linear Programs (Beyond Hierarchies)} } - Braun, G., Pokutta, S., and Xie, Y. (2015). Info-Greedy Sequential Adaptive Compressed Sensing. IEEE Journal of Selected Topics in Signal Processing, 9(4), 601–611.
DOI: 10.1109/JSTSP.2015.2400428
[arXiv]
[BibTeX]
@article{2014_BraunPokuttaYao_Infogreedycompressedsensing, year = {2015}, journal = {IEEE Journal of Selected Topics in Signal Processing}, month = jun, volume = {9}, number = {4}, pages = {601--611}, doi = {10.1109/JSTSP.2015.2400428}, archiveprefix = {arXiv}, eprint = {1407.0731}, arxiv = {arXiv:1407.0731}, primaryclass = {cs.IT}, author = {Braun, Gábor and Pokutta, Sebastian and Xie, Yao}, title = {Info-Greedy Sequential Adaptive Compressed Sensing} } - Braun, G., and Strüngmann, L. (2015). The independence of the notions of Hopfian and co-Hopfian Abelian p-groups. Proceedings of the American Mathematical Society, 143(8), 3331–3341.
DOI: 10.1090/proc/12413
[BibTeX]
@article{2015_BraunStrngmann_HopfianCohopfian, year = {2015}, journal = {Proceedings of the American Mathematical Society}, month = apr, volume = {143}, number = {8}, pages = {3331--3341}, doi = {10.1090/proc/12413}, author = {Braun, Gábor and Strüngmann, Lutz}, title = {The independence of the notions of Hopfian and co-Hopfian Abelian p-groups} } - Braun, G., and Pokutta, S. (2014). A short proof for the polyhedrality of the Chvátal–Gomory closure of a compact convex set. Operations Research Letters, 42(5), 307–310.
DOI: 10.1016/j.orl.2014.05.004
[arXiv]
[BibTeX]
@article{2012_BraunPokutta_Chvtalgomoryclosure, year = {2014}, journal = {Operations Research Letters}, month = jul, volume = {42}, number = {5}, pages = {307--310}, doi = {10.1016/j.orl.2014.05.004}, archiveprefix = {arXiv}, eprint = {1207.4884}, arxiv = {arXiv:1207.4884}, primaryclass = {math.CO}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {A short proof for the polyhedrality of the Chvátal–Gomory closure of a compact convex set} } - Braun, G., and Göbel, R. (2012). Splitting kernels into small summands. Israel Journal of Mathematics, 188(1), 221–230.
DOI: 10.1007/s11856-011-0121-6
[BibTeX]
@article{2012_BraunGoebel_Splittingkernels, year = {2012}, journal = {Israel Journal of Mathematics}, month = mar, volume = {188}, number = {1}, pages = {221--230}, doi = {10.1007/s11856-011-0121-6}, author = {Braun, Gábor and Göbel, Rüdiger}, title = {Splitting kernels into small summands} } - Braun, G., and Pokutta, S. (2012). Rigid abelian groups and the probabilistic method. In Groups and Model Theory (Vol. 576, pp. 17–30). American Mathematical Society.
DOI: 10.1090/conm/576/11342
[arXiv]
[BibTeX]
@incollection{2011_BraunPokutta_Rigidabeliangroups, year = {2012}, booktitle = {Groups and Model Theory}, series = {Contemporary Mathematics}, volume = {576}, publisher = {American Mathematical Society}, pages = {17--30}, doi = {10.1090/conm/576/11342}, archiveprefix = {arXiv}, eprint = {1107.2325}, arxiv = {arXiv:1107.2325}, primaryclass = {math.GR}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {Rigid abelian groups and the probabilistic method} } - Braun, G., and Trlifaj, J. (2011). Strong submodules of almost projective modules. Pacific Journal of Mathematics, 254(1), 73–87.
DOI: 10.2140/pjm.2011.254.73
[BibTeX]
@article{2011_BraunTrlifaj_Strongsubmodules, year = {2011}, journal = {Pacific Journal of Mathematics}, month = dec, volume = {254}, number = {1}, pages = {73--87}, doi = {10.2140/pjm.2011.254.73}, author = {Braun, Gábor and Trlifaj, Jan}, title = {Strong submodules of almost projective modules} } - Braun, G., and Pokutta, S. (2011). Random half-integral polytopes. Operations Research Letters, 39(3), 204–207.
DOI: 10.1016/j.orl.2011.03.003
[URL]
[BibTeX]
@article{2011_BraunPokutta_Randomhalfintegralpolytopes, year = {2011}, journal = {Operations Research Letters}, month = may, volume = {39}, number = {3}, pages = {204--207}, doi = {10.1016/j.orl.2011.03.003}, url = {https://optimization-online.org/?p=2010/11/2813}, author = {Braun, Gábor and Pokutta, Sebastian}, title = {Random half-integral polytopes} } - Braun, G., and Strüngmann, L. (2011). Breaking up finite automata presentable torsion-free abelian groups. International Journal of Algebra and Computation, 21(8), 1463–1472.
DOI: 10.1142/S0218196711006625
[BibTeX]
@article{2011_BraunStrngmann_FiniteautomataTorsionfree, year = {2011}, journal = {International Journal of Algebra and Computation}, volume = {21}, number = {8}, pages = {1463--1472}, doi = {10.1142/S0218196711006625}, author = {Braun, Gábor and Strüngmann, Lutz}, title = {Breaking up finite automata presentable torsion-free abelian groups} } - Braun, G., and Némethi, A. (2010). Surgery formula for Seiberg–Witten invariants of negative definite plumbed 3-manifolds. Journal Für Die Reine Und Angewandte Mathematik, 2010(638), 189–208.
DOI: 10.1515/CRELLE.2010.007
[arXiv]
[BibTeX]
@article{2010_BraunNmethi_Surgeryseibergwitten, year = {2010}, journal = {Journal für die reine und angewandte Mathematik}, month = jan, volume = {2010}, number = {638}, pages = {189--208}, doi = {10.1515/CRELLE.2010.007}, archiveprefix = {arXiv}, eprint = {0704.3145}, arxiv = {arXiv:0704.3145}, primaryclass = {math.GT}, author = {Braun, Gábor and Némethi, András}, title = {Surgery formula for Seiberg–Witten invariants of negative definite plumbed 3-manifolds} } - Braun, G. (2008). The cobordism class of the multiple points of immersions. Algebraic & Geometric Topology, 8(1), 581–601.
DOI: 10.2140/agt.2008.8.581
[URL]
[arXiv]
[BibTeX]
@article{2008_Braun_Cobordismimmersions, year = {2008}, journal = {Algebraic & Geometric Topology}, month = may, volume = {8}, number = {1}, pages = {581--601}, doi = {10.2140/agt.2008.8.581}, url = {https://msp.warwick.ac.uk/agt/2008/08-01/p019.xhtml}, archiveprefix = {arXiv}, eprint = {math/0409574}, arxiv = {arXiv:math/0409574}, primaryclass = {math.AT}, author = {Braun, Gábor}, title = {The cobordism class of the multiple points of immersions} } - Braun, G., and Némethi, A. (2007). Invariants of Newton non-degenerate surface singularities. Compositio Mathematica, 143(4), 1003–1036.
DOI: 10.1112/s0010437x07002941
[URL]
[arXiv]
[BibTeX]
@article{2007_BraunNmethi_Newtonsingularities, year = {2007}, journal = {Compositio Mathematica}, volume = {143}, number = {4}, pages = {1003--1036}, doi = {10.1112/s0010437x07002941}, url = {https://journals.cambridge.org/action/displayAbstract?aid=1207944}, archiveprefix = {arXiv}, eprint = {math/0609093}, arxiv = {arXiv:math/0609093}, primaryclass = {math.AG}, author = {Braun, Gábor and Némethi, András}, title = {Invariants of Newton non-degenerate surface singularities} } - Braun, G., and Lippner, G. (2006). Characteristic numbers of multiple-point manifolds. Bulletin of the London Mathematical Society, 38(4), 667–678.
DOI: 10.1112/S0024609306018571
[BibTeX]
@article{2006_BraunLippner_Characteristicnumberscohomology, year = {2006}, journal = {Bulletin of the London Mathematical Society}, month = aug, volume = {38}, number = {4}, pages = {667--678}, doi = {10.1112/S0024609306018571}, author = {Braun, Gábor and Lippner, Gábor}, title = {Characteristic numbers of multiple-point manifolds} } - Blass, A., and Braun, G. (2005). Random Orders and Gambler’s Ruin. Electronic Journal of Combinatorics, 12(1), R23.
DOI: 10.37236/1920
[URL]
[BibTeX]
@article{2005_BlassBraun_Gamblerruins, year = {2005}, journal = {Electronic Journal of Combinatorics}, volume = {12}, number = {1}, pages = {R23}, doi = {10.37236/1920}, url = {https://combinatorics.org/Volume_12/Abstracts/v12i1r23.html}, author = {Blass, Andreas and Braun, Gábor}, title = {Random Orders and Gambler's Ruin} } - Braun, G., and Göbel, R. (2005). E-algebras whose torsion part is not cyclic. Proceedings of the American Mathematical Society, 133(8), 2251–2258.
DOI: 10.1090/s0002-9939-05-07815-9
[URL]
[BibTeX]
@article{2005_BraunGoebel_EalgebrasTorsion, year = {2005}, journal = {Proceedings of the American Mathematical Society}, volume = {133}, number = {8}, pages = {2251--2258}, doi = {10.1090/s0002-9939-05-07815-9}, url = {https://ams.org/proc/2005-133-08/S0002-9939-05-07815-9/home.html}, author = {Braun, Gábor and Göbel, Rüdiger}, title = {E-algebras whose torsion part is not cyclic} } - Braun, G. (2005). Characterization of matrix types of ultramatricial algebras. New York Journal of Mathematics, 11, 21–33.
[URL]
[arXiv]
[BibTeX]
@article{2005_Braun_Matrixtypesultramatricial, year = {2005}, journal = {New York Journal of Mathematics}, volume = {11}, pages = {21--33}, url = {nyjm.albany.edu:8000/j/2005/11-2.html}, archiveprefix = {arXiv}, eprint = {math/0406302}, arxiv = {arXiv:math/0406302}, primaryclass = {math.GR}, author = {Braun, Gábor}, title = {Characterization of matrix types of ultramatricial algebras} } - Braun, G. (2004). A proof of Higgins’s conjecture. Bulletin of the Australian Mathematical Society, 70(2), 207–212.
DOI: 10.1017/s0004972700034420
[arXiv]
[BibTeX]
@article{2004_Braun_Higginsconjecture, year = {2004}, journal = {Bulletin of the Australian Mathematical Society}, volume = {70}, number = {2}, pages = {207--212}, doi = {10.1017/s0004972700034420}, archiveprefix = {arXiv}, eprint = {math/0312139}, arxiv = {arXiv:math/0312139}, primaryclass = {math.GR}, author = {Braun, Gábor}, title = {A proof of Higgins's conjecture} } - Braun, G., and Göbel, R. (2003). Automorphism groups of nilpotent groups. Archiv Der Mathematik, 80(5), 464–474.
DOI: 10.1007/s00013-003-0802-4
[BibTeX]
@article{2003_BraunGoebel_Automorphismnilpotent, year = {2003}, journal = {Archiv der Mathematik}, volume = {80}, number = {5}, pages = {464--474}, doi = {10.1007/s00013-003-0802-4}, author = {Braun, Gábor and Göbel, Rüdiger}, title = {Automorphism groups of nilpotent groups} } - Braun, G., and Göbel, R. (2003). Outer automorphisms of locally finite p-groups. Journal of Algebra, 264(1), 55–67.
DOI: 10.1016/s0021-8693(03)00119-4
[BibTeX]
@article{2003_BraunGoebel_OuterautomorphismsPgroups, year = {2003}, journal = {Journal of Algebra}, volume = {264}, number = {1}, pages = {55--67}, doi = {10.1016/s0021-8693(03)00119-4}, author = {Braun, Gábor and Göbel, Rüdiger}, title = {Outer automorphisms of locally finite p-groups} }
Projects
SynLab MODAL 05M20ZBM
Research Campus MODAL SynLab
This project develops the SCIP Optimization Suite and generalizes application-specific advances from MODAL's vertical labs into exact methods for constraint integer programming. The focus is on structure recognition, nonlinear constraints, and efficient implementation on modern architectures.
SynLab MODAL 05M20ZBM
Apr 2020 to Mar 2030
24
107
Research Stays and Visits
- Sep 2018
- Mannheim University of Applied Sciences hosted by Lutz Strüngmann
Events
- Jun 2023
- LNdW, Berlin
Teaching
- spring 2017
- Tutor for engineering optimization at GT
- autumn 2015
- Tutor for modern optimization techniques at GT
- autumn 2014
- Tutor for modern optimization techniques at GT
- spring 2013
- Tutor for automata theory at University of Leipzig
- spring 2013
- Advisor for automata theory seminar at University of Leipzig
- spring 2013
- Tutor for calculus at University of Leipzig
- autumn 2012
- Tutor for Automata Theory Seminar at University of Leipzig
- autumn 2012
- Tutor for calculus at University of Leipzig
- autumn 2012
- Tutor for automata theory at University of Leipzig
- spring 2012
- Tutor for computability theory at University of Leipzig
- spring 2012
- Tutor for automata theory seminar at University of Leipzig
- spring 2012
- Tutor for algebraic automata theory at University of Leipzig
- autumn 2011
- Tutor for automata theory at University of Leipzig
Organization and outreach
- Jun 2023
- Booth helper for LNdW
