Polish-Italian mini-workshop

Apolarity in Varsavia (AIVAR)

Mon 20 - Thu 23 January 2025

IMPAN, Warsaw, Poland

Overview

The collaboration between Polish and Italian algebraic geometers has a long standing tradition. Within this miniworkshop we focus on apolarity methods in geometry. We will not have any formal talks, instead we will focus on semi-organised discussions and loose flow of thoughts between the participants. This formula will promote research advancement and hopefully result in a scientific discovery.

Previous events in Warsaw in a similar spirit include Tensor days (2021), discussion sessions during the AGATES semester (2022) and its workshops, and secant varieties working groups 2018-2024.

Participants:


Organisers:

Institutional organiser:

Location:

Room 403 at IMPAN, Śniadeckich 8, Warsaw. On Thurday 23rd after lunch we move to room 1. Tuesday afternoon is free time.

Daily schedule

Monday TuesdayWednesdayThursday
9:30-10:40working group in 403 working group in 403working group in 403working group in 403
10:40-11:10coffee break in 409coffee break in 409coffee break in 409coffee break in 409
11:10-12:20working group in 403working group in 403 working group in 403working group in 403
12:20-13:45lunch (on your own)lunch (on your own)lunch (on your own)lunch (on your own)
13:45-14:30coffee break in 409coffee break in 409coffee break in 409coffee break in 409
14:30-16:30working group in 403free afternoon working group in 403working group in 1

Main topics:

  1. Geometric decomposition algorithm
  2. Schur apolarity revisited

The first topic builds on the decomposition algorithm originating from the works Brachat, Comon, Mourrain, and Tsigaridas. Any homogeneous polynomial of degree d can be written as a sum of d-th powers of linear forms. It is an important problem to find a decomposition into such sum with a minimal number of summands. The algorithm of Brachat, Comon, Mourrain, and Tsigaridas finds all such decompositions. In practice, the algorithm is efficient for nice polynomials, but formally, in general, the complexity is rather depressing. Moreover, the algorithm is generalised to other objects including decompositions of tensors into sums of simple tensors.
We reinterpreted the algorithm in geometric terms using apolarity techniques. Moreover, investigated if the algorithm can be generalised to search for border decompositions (or at least weak border decompositions) by merging it with border apolarity technique.

Within the the second topic we revisited the so called "Schur apolarity" introduced by Staffolani and searched for loose threads to pull.

Notes:

Vincenzo and Oriol (under supervision of Stefano) prepared the notes on the contents discussed during the workshop. Comments are welcome!

Funding

The mini-workshop is supported by:

Ajwar picture from wikipedia, other pictures by Buczyńscy.


Last modified on: 22-Apr-25