The Berkeley Seminar
Various constructions of categories have a universal property
expressing the freeness/initiality of the construction within a
specific categorical doctrine. Expressed in an algorithmic framework,
it turns out that this universal property is in a certain sense a
doctrine-specific ur-algorithm
from which various known categorical
constructions/algorithms (including spectral sequences of bicomplexes)
can be derived in a purely computational way. This can be viewed as a
categorical version of the Curry-Howard correspondence to extract
programs from proofs.
https://web.northeastern.edu/martsinkovsky/p/Conferences/M%C3%A1laga2023/FM-23.html
Organizers
https://web.northeastern.edu/martsinkovsky/p/Conferences/Ghent2023/AA-23.html
]]>The workshop aims at bringing together experts from Mathematics and Physics to discuss the latest developments and future directions in unraveling the Mathematical Structures in Feynman Integrals. Topics will include among others Structures of Feynman integrals, Integral reduction, Applications from algebraic geometry, Finite fields and rational reconstruction, Differential equations, etc.
The program will feature dedicated talks, but will also leave ample time for discussions among workshop participants.
February 11, 2023 marks the 100th anniversary of the death of the mathematician Wilhelm Killing, born in Burbach, only 20km from Siegen. Killing formulated a research program that is still relevant today and has significantly influenced mathematical research for a century. The 100th anniversary of Killing’s death is an appropriate opportunity to honour his merits with an inaugural talk by Prof. Wolfgang Hein.
]]>Computational and algorithmic methods
Chevalley proved that the image of an algebraic morphism between algebraic varieties is a constructible set. Examples are orbits of algebraic group actions. A constructible set in a topological space is a finite union of locally closed sets and a locally closed set is the difference of two closed subsets. Simple examples show that even if the source and target of the morphism are affine varieties the image may neither be affine nor quasi-affine. In this talk, I will present a Gröbner-basis-based algorithm that computes the constructible image of a morphism of affine spaces, along with some applications.
]]>https://web.northeastern.edu/martsinkovsky/p/Parnu2019/FM.html
Organizers
]]>The idea of the workshop is the following: The connection between quantum physics and information theory has posed new challenges at the border between mathematics and physics. The workshop will bring together experts from physics (entanglement theory, information theory, many- body physics) with mathematicians (optimization, multilinear algebra, Gröbner bases) in an informal manner. This should allow many discussions and the mutual exchange of ideas.
The workshop will take place in Siegen (Germany) from March 18-21,