Winfried Bruns
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Winfried Bruns has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Aldo Conca
Università Di Genova, Italy
25 shared publications - Matteo Varbaro
Università di Genova
16 shared publications Claudiu Raicu
University of Notre Dame
12 shared publicationsChristof Söger
6 shared publications- Bogdan Ichim
University of Bucharest
3 shared publications - Bogdan Ichim
Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 010014 Bucharest, Romania
3 shared publications
Latest Publications
- 15 October 2026
- Published by Springer Nature in Letters in Mathematical Physics
- Vol. 116 (6) , 141
Classifying integral Grothendieck rings up to rank 5 and beyond
- 15 October 2026
- Published by Springer Nature in Letters in Mathematical Physics
- Vol. 116 (6) , 141
Classifying integral Grothendieck rings up to rank 5 and beyond
- 1 August 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (8)
Publisher’s Note: “Classification of integral modular data up to rank 13” [J. Math. Phys. 67, 081701 (2026)]
- 1 August 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (8)
Publisher’s Note: “Classification of integral modular data up to rank 13” [J. Math. Phys. 67, 081701 (2026)]
- 1 August 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (8)
Classification of integral modular data up to rank 13
This paper classifies the modular data of integral modular fusion categories up to rank 13, and integral half-Frobenius fusion rings up to rank 12. We establish that every perfect case within these bounds is trivial. Furthermore, we refine the non-pointed odd-dimensional modular data at ranks below 25 to exactly three items, all of rank 17, FPdim 225, and type [[1,3],[3,8],[5,6]], filling existing literature gaps. For rank 25, we narrow the perfect case to three open types. Our core insight is that Egyptian fractions, typically used to list possible types, can be chosen with squared denominators. We develop several type criteria as initial filters. To construct the fusion rings, we solve dimension and associativity equations utilizing custom-built features in Normaliz. S-matrices are generated by self-transposing the character table, and T-matrices are derived by solving the Anderson-Moore-Vafa equations, concluding with the verification of extended modular data axioms. From rank 13 onward, types are restricted by modular-specific properties involving universal grading, congruence representations of the modular group, and Galois action. This establishes critical arithmetic constraints: up to rank 21, a prime divisor of the global FPdim cannot exceed the rank, and up to rank 15 (non-pointed case), it cannot exceed half the rank. Ultimately, we reduce the rank 14 classification to 35 possible types, 8 of which are non-perfect.
- 1 August 2026
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 67 (8)
Classification of integral modular data up to rank 13
This paper classifies the modular data of integral modular fusion categories up to rank 13, and integral half-Frobenius fusion rings up to rank 12. We establish that every perfect case within these bounds is trivial. Furthermore, we refine the non-pointed odd-dimensional modular data at ranks below 25 to exactly three items, all of rank 17, FPdim 225, and type [[1,3],[3,8],[5,6]], filling existing literature gaps. For rank 25, we narrow the perfect case to three open types. Our core insight is that Egyptian fractions, typically used to list possible types, can be chosen with squared denominators. We develop several type criteria as initial filters. To construct the fusion rings, we solve dimension and associativity equations utilizing custom-built features in Normaliz. S-matrices are generated by self-transposing the character table, and T-matrices are derived by solving the Anderson-Moore-Vafa equations, concluding with the verification of extended modular data axioms. From rank 13 onward, types are restricted by modular-specific properties involving universal grading, congruence representations of the modular group, and Galois action. This establishes critical arithmetic constraints: up to rank 21, a prime divisor of the global FPdim cannot exceed the rank, and up to rank 15 (non-pointed case), it cannot exceed half the rank. Ultimately, we reduce the rank 14 classification to 35 possible types, 8 of which are non-perfect.
- 18 June 2025
- Published by Springer Nature in Bollettino dell'Unione Matematica Italiana
- Vol. 19 (1) , 235-261
Sagbi bases, defining ideals and algebras of minors
- 18 June 2025
- Published by Springer Nature in Bollettino dell'Unione Matematica Italiana
- Vol. 19 (1) , 235-261
Sagbi bases, defining ideals and algebras of minors
- Open Access
$\mathbb{Z}^r$-graded rings and their canonical modules
In ``Cohen--Macaulay rings'' Bruns and Herzog define the graded canonical module for $\mathbb{Z}^r$-graded rings. We generalize the definition to multigradings and prove that the canonical module ``localizes''. As an application, we give a divisorial proof of the theorem of Danilov and Stanley on the canonical module of affine normal monoid rings. Along the way, we develop the basic theory of multigraded rings and modules.
Open Access$\mathbb{Z}^r$-graded rings and their canonical modules
In ``Cohen--Macaulay rings'' Bruns and Herzog define the graded canonical module for $\mathbb{Z}^r$-graded rings. We generalize the definition to multigradings and prove that the canonical module ``localizes''. As an application, we give a divisorial proof of the theorem of Danilov and Stanley on the canonical module of affine normal monoid rings. Along the way, we develop the basic theory of multigraded rings and modules.
- Open Access
A New Invariant of Lattice polytopes
The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $ω(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be studied. It is shown that if ${\mathcal P}$ possesses an interior lattice point, then the maximal degree is at most ${\rm dim} {\mathcal P} - 1$, and that this bound is the best possible in general.Open AccessA New Invariant of Lattice polytopes
The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $ω(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be studied. It is shown that if ${\mathcal P}$ possesses an interior lattice point, then the maximal degree is at most ${\rm dim} {\mathcal P} - 1$, and that this bound is the best possible in general. - Open Access
Computations of volumes in five candidates elections
We describe several analytical results obtained in five candidates social choice elections under the assumption of the Impartial Anonymous Culture. These include the Condorcet and Borda paradoxes, as well as the Condorcet efficiency of plurality, negative plurality and Borda voting, including their runoff versions. The computations are done by Normaliz. It finds precise probabilities as volumes of polytopes in dimension 119, using its recent implementation of the Lawrence algorithm.
Open AccessComputations of volumes in five candidates elections
We describe several analytical results obtained in five candidates social choice elections under the assumption of the Impartial Anonymous Culture. These include the Condorcet and Borda paradoxes, as well as the Condorcet efficiency of plurality, negative plurality and Borda voting, including their runoff versions. The computations are done by Normaliz. It finds precise probabilities as volumes of polytopes in dimension 119, using its recent implementation of the Lawrence algorithm.
- Open Access
Sagbi combinatorics of maximal minors and a Sagbi algorithm
The maximal minors of a matrix of indeterminates are a universal Gröbner basis by a theorem of Bernstein, Sturmfels and Zelevinsky. On the other hand it is known that they are not always a universal Sagbi basis. By an experimental approach we discuss their behavior under varying monomial orders and their extensions to Sagbi bases. These experiments motivated a new implementation of the Sagbi algorithm which is organized in a Singular script and falls back on Normaliz for the combinatorial computations. In comparison to packages in the current standard distributions of Macaulay 2 and Singular it extends the range of computability by at least one order of magnitude.
Open AccessSagbi combinatorics of maximal minors and a Sagbi algorithm
The maximal minors of a matrix of indeterminates are a universal Gröbner basis by a theorem of Bernstein, Sturmfels and Zelevinsky. On the other hand it is known that they are not always a universal Sagbi basis. By an experimental approach we discuss their behavior under varying monomial orders and their extensions to Sagbi bases. These experiments motivated a new implementation of the Sagbi algorithm which is organized in a Singular script and falls back on Normaliz for the combinatorial computations. In comparison to packages in the current standard distributions of Macaulay 2 and Singular it extends the range of computability by at least one order of magnitude.
- 3 December 2022
- Published by Springer Nature
- p. 229-274
F-singularities of Determinantal Rings
- 3 December 2022
- Published by Springer Nature
- p. 379-414
Asymptotic Regularity for Symbolic Powers of Determinantal Ideals
- 3 December 2022
- Published by Springer Nature
- p. 379-414
Asymptotic Regularity for Symbolic Powers of Determinantal Ideals