• Non ci sono risultati.

Polytopes, dual graphs and line arrangements II The algebraic point of view

N/A
N/A
Protected

Academic year: 2021

Condividi "Polytopes, dual graphs and line arrangements II The algebraic point of view"

Copied!
124
0
0

Testo completo

(1)

Polytopes, dual graphs and line arrangements II

The algebraic point of view

ET’nA 2017

Catania, May 31 - June 4, 2017

Matteo Varbaro

Universit`a degli Studi di Genova

(2)

Minimal graded free resolutions

S = k[x

1

, . . . , x

n

] polynomial ring over a field k; deg(x

i

) = 1 ∀ i = 1, . . . , n (standard grading); m = (x

1

, . . . , x

n

) the irrelevant ideal;

I ⊂ S homogeneous ideal.

A minimal graded free resolution of S /I is a complex of free S -modules

F

: · −−→ F

di +1 i

d

→ F

i i −1

−−→ · · ·

di −1

−→ F

d1 0

→ 0 such that:

F

0

= S , d

1

(F

1

) = I and H

i

(F

) = 0 ∀ i > 0 (“resolution”);

for all i > 0 and j ∈ Z, d

i

([F

i

]

j

) ⊆ [F

i −1

]

j

(“graded”) and

d

i

(F

i

) ⊂ mF

i −1

(“minimal”).

(3)

Minimal graded free resolutions

S = k[x

1

, . . . , x

n

] polynomial ring over a field k;

deg(x

i

) = 1 ∀ i = 1, . . . , n (standard grading); m = (x

1

, . . . , x

n

) the irrelevant ideal;

I ⊂ S homogeneous ideal.

A minimal graded free resolution of S /I is a complex of free S -modules

F

: · −−→ F

di +1 i

d

→ F

i i −1

−−→ · · ·

di −1

−→ F

d1 0

→ 0 such that:

F

0

= S , d

1

(F

1

) = I and H

i

(F

) = 0 ∀ i > 0 (“resolution”);

for all i > 0 and j ∈ Z, d

i

([F

i

]

j

) ⊆ [F

i −1

]

j

(“graded”) and

d

i

(F

i

) ⊂ mF

i −1

(“minimal”).

(4)

Minimal graded free resolutions

S = k[x

1

, . . . , x

n

] polynomial ring over a field k;

deg(x

i

) = 1 ∀ i = 1, . . . , n (standard grading);

m = (x

1

, . . . , x

n

) the irrelevant ideal; I ⊂ S homogeneous ideal.

A minimal graded free resolution of S /I is a complex of free S -modules

F

: · −−→ F

di +1 i

d

→ F

i i −1

−−→ · · ·

di −1

−→ F

d1 0

→ 0 such that:

F

0

= S , d

1

(F

1

) = I and H

i

(F

) = 0 ∀ i > 0 (“resolution”);

for all i > 0 and j ∈ Z, d

i

([F

i

]

j

) ⊆ [F

i −1

]

j

(“graded”) and

d

i

(F

i

) ⊂ mF

i −1

(“minimal”).

(5)

Minimal graded free resolutions

S = k[x

1

, . . . , x

n

] polynomial ring over a field k;

deg(x

i

) = 1 ∀ i = 1, . . . , n (standard grading);

m = (x

1

, . . . , x

n

) the irrelevant ideal;

I ⊂ S homogeneous ideal.

A minimal graded free resolution of S /I is a complex of free S -modules

F

: · −−→ F

di +1 i

d

→ F

i i −1

−−→ · · ·

di −1

−→ F

d1 0

→ 0 such that:

F

0

= S , d

1

(F

1

) = I and H

i

(F

) = 0 ∀ i > 0 (“resolution”);

for all i > 0 and j ∈ Z, d

i

([F

i

]

j

) ⊆ [F

i −1

]

j

(“graded”) and

d

i

(F

i

) ⊂ mF

i −1

(“minimal”).

(6)

Minimal graded free resolutions

S = k[x

1

, . . . , x

n

] polynomial ring over a field k;

deg(x

i

) = 1 ∀ i = 1, . . . , n (standard grading);

m = (x

1

, . . . , x

n

) the irrelevant ideal;

I ⊂ S homogeneous ideal.

A minimal graded free resolution of S /I is a complex of free S -modules

F

: · −−→ F

di +1 i

d

→ F

i i −1

−−→ · · ·

di −1

−→ F

d1 0

→ 0 such that:

F

0

= S , d

1

(F

1

) = I and H

i

(F

) = 0 ∀ i > 0 (“resolution”);

for all i > 0 and j ∈ Z, d

i

([F

i

]

j

) ⊆ [F

i −1

]

j

(“graded”) and

d

i

(F

i

) ⊂ mF

i −1

(“minimal”).

(7)

Minimal graded free resolutions

S = k[x

1

, . . . , x

n

] polynomial ring over a field k;

deg(x

i

) = 1 ∀ i = 1, . . . , n (standard grading);

m = (x

1

, . . . , x

n

) the irrelevant ideal;

I ⊂ S homogeneous ideal.

A minimal graded free resolution of S /I is a complex of free S -modules

F

: · −−→ F

di +1 i

d

→ F

i i −1

−−→ · · ·

di −1

−→ F

d1 0

→ 0 such that:

F

0

= S , d

1

(F

1

) = I and H

i

(F

) = 0 ∀ i > 0 (“resolution”);

for all i > 0 and j ∈ Z, d

i

([F

i

]

j

) ⊆ [F

i −1

]

j

(“graded”) and

d

i

(F

i

) ⊂ mF

i −1

(“minimal”).

(8)

Minimal graded free resolutions

S = k[x

1

, . . . , x

n

] polynomial ring over a field k;

deg(x

i

) = 1 ∀ i = 1, . . . , n (standard grading);

m = (x

1

, . . . , x

n

) the irrelevant ideal;

I ⊂ S homogeneous ideal.

A minimal graded free resolution of S /I is a complex of free S -modules

F

: · −−→ F

di +1 i

d

→ F

i i −1

−−→ · · ·

di −1

−→ F

d1 0

→ 0 such that:

F

0

= S , d

1

(F

1

) = I and H

i

(F

) = 0 ∀ i > 0 (“resolution”);

for all i > 0 and j ∈ Z, d

i

([F

i

]

j

) ⊆ [F

i −1

]

j

(“graded”) and

d

i

(F

i

) ⊂ mF

i −1

(“minimal”).

(9)

Minimal graded free resolutions

S = k[x

1

, . . . , x

n

] polynomial ring over a field k;

deg(x

i

) = 1 ∀ i = 1, . . . , n (standard grading);

m = (x

1

, . . . , x

n

) the irrelevant ideal;

I ⊂ S homogeneous ideal.

A minimal graded free resolution of S /I is a complex of free S -modules

F

: · −−→ F

di +1 i

d

→ F

i i −1

−−→ · · ·

di −1

−→ F

d1 0

→ 0 such that:

F

0

= S , d

1

(F

1

) = I and H

i

(F

) = 0 ∀ i > 0 (“resolution”);

for all i > 0 and j ∈ Z, d

i

([F

i

]

j

) ⊆ [F

i −1

]

j

(“graded”)

and

d

i

(F

i

) ⊂ mF

i −1

(“minimal”).

(10)

Minimal graded free resolutions

S = k[x

1

, . . . , x

n

] polynomial ring over a field k;

deg(x

i

) = 1 ∀ i = 1, . . . , n (standard grading);

m = (x

1

, . . . , x

n

) the irrelevant ideal;

I ⊂ S homogeneous ideal.

A minimal graded free resolution of S /I is a complex of free S -modules

F

: · −−→ F

di +1 i

d

→ F

i i −1

−−→ · · ·

di −1

−→ F

d1 0

→ 0 such that:

F

0

= S , d

1

(F

1

) = I and H

i

(F

) = 0 ∀ i > 0 (“resolution”);

for all i > 0 and j ∈ Z, d

i

([F

i

]

j

) ⊆ [F

i −1

]

j

(“graded”) and

d

i

(F

i

) ⊂ mF

i −1

(“minimal”).

(11)

Minimal graded free resolutions

It is easy to check that a minimal graded free resolution of S /I always exists,

and it is unique up to isomorphism of graded complexes of S -modules. Furthermore:

Hilbert syzygy theorem (1890)

If F

is the minimal graded free resolution of S /I , then F

i

= 0 whenever i > n (n is the number of variables of S ).

The projective dimension of S /I is the length of the minimal graded free resolution F

of S /I :

projdim S /I = max{k : F

k

6= 0}.

We always have projdim S /I ≥ ht I (recall that ht I equals the

codimension of V (I ) ⊂ P

n−1

). If equality holds, then S /I is called

Cohen-Macaulay. If furthermore F

ht I

has rank 1, then S /I is said

to be Gorenstein.

(12)

Minimal graded free resolutions

It is easy to check that a minimal graded free resolution of S /I always exists, and it is unique up to isomorphism of graded complexes of S -modules.

Furthermore: Hilbert syzygy theorem (1890)

If F

is the minimal graded free resolution of S /I , then F

i

= 0 whenever i > n (n is the number of variables of S ).

The projective dimension of S /I is the length of the minimal graded free resolution F

of S /I :

projdim S /I = max{k : F

k

6= 0}.

We always have projdim S /I ≥ ht I (recall that ht I equals the

codimension of V (I ) ⊂ P

n−1

). If equality holds, then S /I is called

Cohen-Macaulay. If furthermore F

ht I

has rank 1, then S /I is said

to be Gorenstein.

(13)

Minimal graded free resolutions

It is easy to check that a minimal graded free resolution of S /I always exists, and it is unique up to isomorphism of graded complexes of S -modules. Furthermore:

Hilbert syzygy theorem (1890)

If F

is the minimal graded free resolution of S /I , then F

i

= 0 whenever i > n (n is the number of variables of S ).

The projective dimension of S /I is the length of the minimal graded free resolution F

of S /I :

projdim S /I = max{k : F

k

6= 0}.

We always have projdim S /I ≥ ht I (recall that ht I equals the

codimension of V (I ) ⊂ P

n−1

). If equality holds, then S /I is called

Cohen-Macaulay. If furthermore F

ht I

has rank 1, then S /I is said

to be Gorenstein.

(14)

Minimal graded free resolutions

It is easy to check that a minimal graded free resolution of S /I always exists, and it is unique up to isomorphism of graded complexes of S -modules. Furthermore:

Hilbert syzygy theorem (1890)

If F

is the minimal graded free resolution of S /I , then F

i

= 0 whenever i > n (n is the number of variables of S ).

The projective dimension of S /I is the length of the minimal graded free resolution F

of S /I :

projdim S /I = max{k : F

k

6= 0}.

We always have projdim S /I ≥ ht I (recall that ht I equals the

codimension of V (I ) ⊂ P

n−1

). If equality holds, then S /I is called

Cohen-Macaulay. If furthermore F

ht I

has rank 1, then S /I is said

to be Gorenstein.

(15)

Minimal graded free resolutions

It is easy to check that a minimal graded free resolution of S /I always exists, and it is unique up to isomorphism of graded complexes of S -modules. Furthermore:

Hilbert syzygy theorem (1890)

If F

is the minimal graded free resolution of S /I , then F

i

= 0 whenever i > n (n is the number of variables of S ).

The projective dimension of S /I is the length of the minimal graded free resolution F

of S /I :

projdim S /I = max{k : F

k

6= 0}.

We always have projdim S /I ≥ ht I (recall that ht I equals the

codimension of V (I ) ⊂ P

n−1

). If equality holds, then S /I is called

Cohen-Macaulay. If furthermore F

ht I

has rank 1, then S /I is said

to be Gorenstein.

(16)

Minimal graded free resolutions

It is easy to check that a minimal graded free resolution of S /I always exists, and it is unique up to isomorphism of graded complexes of S -modules. Furthermore:

Hilbert syzygy theorem (1890)

If F

is the minimal graded free resolution of S /I , then F

i

= 0 whenever i > n (n is the number of variables of S ).

The projective dimension of S /I is the length of the minimal graded free resolution F

of S /I :

projdim S /I = max{k : F

k

6= 0}.

We always have projdim S /I ≥ ht I (recall that ht I equals the codimension of V (I ) ⊂ P

n−1

).

If equality holds, then S /I is called

Cohen-Macaulay. If furthermore F

ht I

has rank 1, then S /I is said

to be Gorenstein.

(17)

Minimal graded free resolutions

It is easy to check that a minimal graded free resolution of S /I always exists, and it is unique up to isomorphism of graded complexes of S -modules. Furthermore:

Hilbert syzygy theorem (1890)

If F

is the minimal graded free resolution of S /I , then F

i

= 0 whenever i > n (n is the number of variables of S ).

The projective dimension of S /I is the length of the minimal graded free resolution F

of S /I :

projdim S /I = max{k : F

k

6= 0}.

We always have projdim S /I ≥ ht I (recall that ht I equals the codimension of V (I ) ⊂ P

n−1

). If equality holds, then S /I is called Cohen-Macaulay.

If furthermore F

ht I

has rank 1, then S /I is said

to be Gorenstein.

(18)

Minimal graded free resolutions

It is easy to check that a minimal graded free resolution of S /I always exists, and it is unique up to isomorphism of graded complexes of S -modules. Furthermore:

Hilbert syzygy theorem (1890)

If F

is the minimal graded free resolution of S /I , then F

i

= 0 whenever i > n (n is the number of variables of S ).

The projective dimension of S /I is the length of the minimal graded free resolution F

of S /I :

projdim S /I = max{k : F

k

6= 0}.

We always have projdim S /I ≥ ht I (recall that ht I equals the

codimension of V (I ) ⊂ P

n−1

). If equality holds, then S /I is called

Cohen-Macaulay. If furthermore F

ht I

has rank 1, then S /I is said

to be Gorenstein.

(19)

Castelnuovo-Mumford regularity

Being graded free S -modules, F

i

= L

j ∈Z

S (−j )

βij

,

and it is simple to check that the graded Betti numbers β

ij

are natural numbers and β

ij

= 0 whenever j < i or j  0. So, it makes sense to define the (Castelnuovo-Mumford) regularity of S /I as:

reg S /I = max{j − i : β

ij

6= 0}.

Example

Let S = k[x, y , z, u] and I = (x

2

, y

3

z

4

, u

30

). Being I a complete intersection (I is generated by as many polynomials as its height) the minimal graded free resolution of S /I is provided by the Koszul complex of x

2

, y

3

z

4

, u

30

, and has the form:

0 → S (−39) −→ S (−9) ⊕ S (−32) ⊕ S (−37) −→

S (−2) ⊕ S (−7) ⊕ S (−30) −→ S → 0

In particular, S /I is Gorenstein and reg S /I = 36.

(20)

Castelnuovo-Mumford regularity

Being graded free S -modules, F

i

= L

j ∈Z

S (−j )

βij

, and it is simple to check that the graded Betti numbers β

ij

are natural numbers and β

ij

= 0 whenever j < i or j  0.

So, it makes sense to define the (Castelnuovo-Mumford) regularity of S /I as:

reg S /I = max{j − i : β

ij

6= 0}.

Example

Let S = k[x, y , z, u] and I = (x

2

, y

3

z

4

, u

30

). Being I a complete intersection (I is generated by as many polynomials as its height) the minimal graded free resolution of S /I is provided by the Koszul complex of x

2

, y

3

z

4

, u

30

, and has the form:

0 → S (−39) −→ S (−9) ⊕ S (−32) ⊕ S (−37) −→

S (−2) ⊕ S (−7) ⊕ S (−30) −→ S → 0

In particular, S /I is Gorenstein and reg S /I = 36.

(21)

Castelnuovo-Mumford regularity

Being graded free S -modules, F

i

= L

j ∈Z

S (−j )

βij

, and it is simple to check that the graded Betti numbers β

ij

are natural numbers and β

ij

= 0 whenever j < i or j  0. So, it makes sense to define the (Castelnuovo-Mumford) regularity of S /I as:

reg S /I = max{j − i : β

ij

6= 0}.

Example

Let S = k[x, y , z, u] and I = (x

2

, y

3

z

4

, u

30

). Being I a complete intersection (I is generated by as many polynomials as its height) the minimal graded free resolution of S /I is provided by the Koszul complex of x

2

, y

3

z

4

, u

30

, and has the form:

0 → S (−39) −→ S (−9) ⊕ S (−32) ⊕ S (−37) −→

S (−2) ⊕ S (−7) ⊕ S (−30) −→ S → 0

In particular, S /I is Gorenstein and reg S /I = 36.

(22)

Castelnuovo-Mumford regularity

Being graded free S -modules, F

i

= L

j ∈Z

S (−j )

βij

, and it is simple to check that the graded Betti numbers β

ij

are natural numbers and β

ij

= 0 whenever j < i or j  0. So, it makes sense to define the (Castelnuovo-Mumford) regularity of S /I as:

reg S /I = max{j − i : β

ij

6= 0}.

Example

Let S = k[x, y , z, u] and I = (x

2

, y

3

z

4

, u

30

).

Being I a complete intersection (I is generated by as many polynomials as its height) the minimal graded free resolution of S /I is provided by the Koszul complex of x

2

, y

3

z

4

, u

30

, and has the form:

0 → S (−39) −→ S (−9) ⊕ S (−32) ⊕ S (−37) −→

S (−2) ⊕ S (−7) ⊕ S (−30) −→ S → 0

In particular, S /I is Gorenstein and reg S /I = 36.

(23)

Castelnuovo-Mumford regularity

Being graded free S -modules, F

i

= L

j ∈Z

S (−j )

βij

, and it is simple to check that the graded Betti numbers β

ij

are natural numbers and β

ij

= 0 whenever j < i or j  0. So, it makes sense to define the (Castelnuovo-Mumford) regularity of S /I as:

reg S /I = max{j − i : β

ij

6= 0}.

Example

Let S = k[x, y , z, u] and I = (x

2

, y

3

z

4

, u

30

). Being I a complete intersection (I is generated by as many polynomials as its height) the minimal graded free resolution of S /I is provided by the Koszul complex of x

2

, y

3

z

4

, u

30

,

and has the form:

0 → S (−39) −→ S (−9) ⊕ S (−32) ⊕ S (−37) −→

S (−2) ⊕ S (−7) ⊕ S (−30) −→ S → 0

In particular, S /I is Gorenstein and reg S /I = 36.

(24)

Castelnuovo-Mumford regularity

Being graded free S -modules, F

i

= L

j ∈Z

S (−j )

βij

, and it is simple to check that the graded Betti numbers β

ij

are natural numbers and β

ij

= 0 whenever j < i or j  0. So, it makes sense to define the (Castelnuovo-Mumford) regularity of S /I as:

reg S /I = max{j − i : β

ij

6= 0}.

Example

Let S = k[x, y , z, u] and I = (x

2

, y

3

z

4

, u

30

). Being I a complete intersection (I is generated by as many polynomials as its height) the minimal graded free resolution of S /I is provided by the Koszul complex of x

2

, y

3

z

4

, u

30

, and has the form:

0 → S (−39) −→ S (−9) ⊕ S (−32) ⊕ S (−37) −→

S (−2) ⊕ S (−7) ⊕ S (−30) −→ S → 0

In particular, S /I is Gorenstein and reg S /I = 36.

(25)

Castelnuovo-Mumford regularity

Being graded free S -modules, F

i

= L

j ∈Z

S (−j )

βij

, and it is simple to check that the graded Betti numbers β

ij

are natural numbers and β

ij

= 0 whenever j < i or j  0. So, it makes sense to define the (Castelnuovo-Mumford) regularity of S /I as:

reg S /I = max{j − i : β

ij

6= 0}.

Example

Let S = k[x, y , z, u] and I = (x

2

, y

3

z

4

, u

30

). Being I a complete intersection (I is generated by as many polynomials as its height) the minimal graded free resolution of S /I is provided by the Koszul complex of x

2

, y

3

z

4

, u

30

, and has the form:

0 → S (−39) −→ S (−9) ⊕ S (−32) ⊕ S (−37) −→

S (−2) ⊕ S (−7) ⊕ S (−30) −→ S → 0

(26)

Gorenstein rings

If I = (f

1

, . . . , f

h

) ⊂ S is a complete intersection where the f

i

’s are homogeneous polynomials,

then the Koszul complex of f

1

, . . . , f

h

is the minimal graded free resolution of S /I . From it, one sees that in this case S /I is Gorenstein and reg S /I = P

h

i =1

deg(f

i

) − h. However, there are many more Gorenstein rings than these: Example

Consider the monomial ideal I = (x

1

x

3

, x

1

x

4

, x

2

x

4

, x

2

x

5

, x

3

x

5

) of S = k[x

1

, . . . , x

5

]. Then S /I is Gorenstein (although ht I = 3). In this case I = I

is the Stanley-Reisner ideal of the pentagon ∆:

In general, if ∆ is the triangulation of a sphere

of dimension d − 1 (e.g. the boundary of a sim-

plicial d -polytope), then S /I

is Gorenstein and

reg S /I

= d.

(27)

Gorenstein rings

If I = (f

1

, . . . , f

h

) ⊂ S is a complete intersection where the f

i

’s are homogeneous polynomials, then the Koszul complex of f

1

, . . . , f

h

is the minimal graded free resolution of S /I .

From it, one sees that in this case S /I is Gorenstein and reg S /I = P

h

i =1

deg(f

i

) − h. However, there are many more Gorenstein rings than these: Example

Consider the monomial ideal I = (x

1

x

3

, x

1

x

4

, x

2

x

4

, x

2

x

5

, x

3

x

5

) of S = k[x

1

, . . . , x

5

]. Then S /I is Gorenstein (although ht I = 3). In this case I = I

is the Stanley-Reisner ideal of the pentagon ∆:

In general, if ∆ is the triangulation of a sphere

of dimension d − 1 (e.g. the boundary of a sim-

plicial d -polytope), then S /I

is Gorenstein and

reg S /I

= d.

(28)

Gorenstein rings

If I = (f

1

, . . . , f

h

) ⊂ S is a complete intersection where the f

i

’s are homogeneous polynomials, then the Koszul complex of f

1

, . . . , f

h

is the minimal graded free resolution of S /I . From it, one sees that in this case S /I is Gorenstein and reg S /I = P

h

i =1

deg(f

i

) − h.

However, there are many more Gorenstein rings than these: Example

Consider the monomial ideal I = (x

1

x

3

, x

1

x

4

, x

2

x

4

, x

2

x

5

, x

3

x

5

) of S = k[x

1

, . . . , x

5

]. Then S /I is Gorenstein (although ht I = 3). In this case I = I

is the Stanley-Reisner ideal of the pentagon ∆:

In general, if ∆ is the triangulation of a sphere

of dimension d − 1 (e.g. the boundary of a sim-

plicial d -polytope), then S /I

is Gorenstein and

reg S /I

= d.

(29)

Gorenstein rings

If I = (f

1

, . . . , f

h

) ⊂ S is a complete intersection where the f

i

’s are homogeneous polynomials, then the Koszul complex of f

1

, . . . , f

h

is the minimal graded free resolution of S /I . From it, one sees that in this case S /I is Gorenstein and reg S /I = P

h

i =1

deg(f

i

) − h.

However, there are many more Gorenstein rings than these:

Example

Consider the monomial ideal I = (x

1

x

3

, x

1

x

4

, x

2

x

4

, x

2

x

5

, x

3

x

5

) of S = k[x

1

, . . . , x

5

]. Then S /I is Gorenstein (although ht I = 3). In this case I = I

is the Stanley-Reisner ideal of the pentagon ∆:

In general, if ∆ is the triangulation of a sphere

of dimension d − 1 (e.g. the boundary of a sim-

plicial d -polytope), then S /I

is Gorenstein and

reg S /I

= d.

(30)

Gorenstein rings

If I = (f

1

, . . . , f

h

) ⊂ S is a complete intersection where the f

i

’s are homogeneous polynomials, then the Koszul complex of f

1

, . . . , f

h

is the minimal graded free resolution of S /I . From it, one sees that in this case S /I is Gorenstein and reg S /I = P

h

i =1

deg(f

i

) − h.

However, there are many more Gorenstein rings than these:

Example

Consider the monomial ideal I = (x

1

x

3

, x

1

x

4

, x

2

x

4

, x

2

x

5

, x

3

x

5

) of S = k[x

1

, . . . , x

5

].

Then S /I is Gorenstein (although ht I = 3). In this case I = I

is the Stanley-Reisner ideal of the pentagon ∆:

In general, if ∆ is the triangulation of a sphere

of dimension d − 1 (e.g. the boundary of a sim-

plicial d -polytope), then S /I

is Gorenstein and

reg S /I

= d.

(31)

Gorenstein rings

If I = (f

1

, . . . , f

h

) ⊂ S is a complete intersection where the f

i

’s are homogeneous polynomials, then the Koszul complex of f

1

, . . . , f

h

is the minimal graded free resolution of S /I . From it, one sees that in this case S /I is Gorenstein and reg S /I = P

h

i =1

deg(f

i

) − h.

However, there are many more Gorenstein rings than these:

Example

Consider the monomial ideal I = (x

1

x

3

, x

1

x

4

, x

2

x

4

, x

2

x

5

, x

3

x

5

) of S = k[x

1

, . . . , x

5

]. Then S /I is Gorenstein (although ht I = 3).

In this case I = I

is the Stanley-Reisner ideal of the pentagon ∆:

In general, if ∆ is the triangulation of a sphere

of dimension d − 1 (e.g. the boundary of a sim-

plicial d -polytope), then S /I

is Gorenstein and

reg S /I

= d.

(32)

Gorenstein rings

If I = (f

1

, . . . , f

h

) ⊂ S is a complete intersection where the f

i

’s are homogeneous polynomials, then the Koszul complex of f

1

, . . . , f

h

is the minimal graded free resolution of S /I . From it, one sees that in this case S /I is Gorenstein and reg S /I = P

h

i =1

deg(f

i

) − h.

However, there are many more Gorenstein rings than these:

Example

Consider the monomial ideal I = (x

1

x

3

, x

1

x

4

, x

2

x

4

, x

2

x

5

, x

3

x

5

) of S = k[x

1

, . . . , x

5

]. Then S /I is Gorenstein (although ht I = 3). In this case I = I

is the Stanley-Reisner ideal of the pentagon ∆:

In general, if ∆ is the triangulation of a sphere

of dimension d − 1 (e.g. the boundary of a sim-

plicial d -polytope), then S /I

is Gorenstein and

reg S /I

= d.

(33)

Gorenstein rings

If I = (f

1

, . . . , f

h

) ⊂ S is a complete intersection where the f

i

’s are homogeneous polynomials, then the Koszul complex of f

1

, . . . , f

h

is the minimal graded free resolution of S /I . From it, one sees that in this case S /I is Gorenstein and reg S /I = P

h

i =1

deg(f

i

) − h.

However, there are many more Gorenstein rings than these:

Example

Consider the monomial ideal I = (x

1

x

3

, x

1

x

4

, x

2

x

4

, x

2

x

5

, x

3

x

5

) of S = k[x

1

, . . . , x

5

]. Then S /I is Gorenstein (although ht I = 3). In this case I = I

is the Stanley-Reisner ideal of the pentagon ∆:

In general, if ∆ is the triangulation of a sphere of dimension d − 1 (e.g. the boundary of a sim- plicial d -polytope),

then S /I

is Gorenstein and

reg S /I

= d.

(34)

Gorenstein rings

If I = (f

1

, . . . , f

h

) ⊂ S is a complete intersection where the f

i

’s are homogeneous polynomials, then the Koszul complex of f

1

, . . . , f

h

is the minimal graded free resolution of S /I . From it, one sees that in this case S /I is Gorenstein and reg S /I = P

h

i =1

deg(f

i

) − h.

However, there are many more Gorenstein rings than these:

Example

Consider the monomial ideal I = (x

1

x

3

, x

1

x

4

, x

2

x

4

, x

2

x

5

, x

3

x

5

) of S = k[x

1

, . . . , x

5

]. Then S /I is Gorenstein (although ht I = 3). In this case I = I

is the Stanley-Reisner ideal of the pentagon ∆:

In general, if ∆ is the triangulation of a sphere

of dimension d − 1 (e.g. the boundary of a sim-

plicial d -polytope), then S /I

is Gorenstein and

reg S /I

= d.

(35)

Dual graphs

For simplicity, from now on we will assume that I is radical. Let {p

1

, . . . , p

s

} be the set of minimal prime ideals of I . The dual graph

G (I )

of I is the simple graph with:

[s] := {1, . . . , s} as vertex set;

edges {i , j } such that ht(p

i

+ p

j

) = ht I + 1.

Note that “G (I ) connected ⇒ I height-unmixed (ht p

i

= ht I ∀i )”. On the other hand, in 1962 Hartshorne proved that:

S /I is Cohen-Macaulay ⇒ G (I ) is connected.

(36)

Dual graphs

For simplicity, from now on we will assume that I is radical. Let {p

1

, . . . , p

s

} be the set of minimal prime ideals of I .

The dual graph

G (I )

of I is the simple graph with:

[s] := {1, . . . , s} as vertex set;

edges {i , j } such that ht(p

i

+ p

j

) = ht I + 1.

Note that “G (I ) connected ⇒ I height-unmixed (ht p

i

= ht I ∀i )”. On the other hand, in 1962 Hartshorne proved that:

S /I is Cohen-Macaulay ⇒ G (I ) is connected.

(37)

Dual graphs

For simplicity, from now on we will assume that I is radical. Let {p

1

, . . . , p

s

} be the set of minimal prime ideals of I . The dual graph

G (I )

of I is the simple graph with:

[s] := {1, . . . , s} as vertex set;

edges {i , j } such that ht(p

i

+ p

j

) = ht I + 1.

Note that “G (I ) connected ⇒ I height-unmixed (ht p

i

= ht I ∀i )”. On the other hand, in 1962 Hartshorne proved that:

S /I is Cohen-Macaulay ⇒ G (I ) is connected.

(38)

Dual graphs

For simplicity, from now on we will assume that I is radical. Let {p

1

, . . . , p

s

} be the set of minimal prime ideals of I . The dual graph

G (I )

of I is the simple graph with:

[s] := {1, . . . , s} as vertex set;

edges {i , j } such that ht(p

i

+ p

j

) = ht I + 1.

Note that “G (I ) connected ⇒ I height-unmixed (ht p

i

= ht I ∀i )”. On the other hand, in 1962 Hartshorne proved that:

S /I is Cohen-Macaulay ⇒ G (I ) is connected.

(39)

Dual graphs

For simplicity, from now on we will assume that I is radical. Let {p

1

, . . . , p

s

} be the set of minimal prime ideals of I . The dual graph

G (I )

of I is the simple graph with:

[s] := {1, . . . , s} as vertex set;

edges {i , j } such that ht(p

i

+ p

j

) = ht I + 1.

Note that “G (I ) connected ⇒ I height-unmixed (ht p

i

= ht I ∀i )”.

On the other hand, in 1962 Hartshorne proved that:

S /I is Cohen-Macaulay ⇒ G (I ) is connected.

(40)

Dual graphs

For simplicity, from now on we will assume that I is radical. Let {p

1

, . . . , p

s

} be the set of minimal prime ideals of I . The dual graph

G (I )

of I is the simple graph with:

[s] := {1, . . . , s} as vertex set;

edges {i , j } such that ht(p

i

+ p

j

) = ht I + 1.

Note that “G (I ) connected ⇒ I height-unmixed (ht p

i

= ht I ∀i )”.

On the other hand, in 1962 Hartshorne proved that:

S /I is Cohen-Macaulay ⇒ G (I ) is connected.

(41)

Connectedness properties of dual graphs

Given a subset A ⊆ [s], by G (I )

A

we mean the subgraph of G (I ) induced on the vertices in A.

Equivalently, G (I )

A

is the dual graph of the ideal ∩

i ∈A

p

i

. Using ideas coming from liaison theory and some properties of local cohomology, we managed to prove the following:

Theorem (Benedetti-V, 2015)

If S /I is Gorenstein, then G (I )

A

is connected whenever A ⊆ [s] is such that reg ∩

i ∈[s]\A

p

i

< reg S /I .

The above result allows us to say something on the dual graph of

an ideal defining a Gorenstein ring.

(42)

Connectedness properties of dual graphs

Given a subset A ⊆ [s], by G (I )

A

we mean the subgraph of G (I ) induced on the vertices in A. Equivalently, G (I )

A

is the dual graph of the ideal ∩

i ∈A

p

i

.

Using ideas coming from liaison theory and some properties of local cohomology, we managed to prove the following:

Theorem (Benedetti-V, 2015)

If S /I is Gorenstein, then G (I )

A

is connected whenever A ⊆ [s] is such that reg ∩

i ∈[s]\A

p

i

< reg S /I .

The above result allows us to say something on the dual graph of

an ideal defining a Gorenstein ring.

(43)

Connectedness properties of dual graphs

Given a subset A ⊆ [s], by G (I )

A

we mean the subgraph of G (I ) induced on the vertices in A. Equivalently, G (I )

A

is the dual graph of the ideal ∩

i ∈A

p

i

. Using ideas coming from liaison theory and some properties of local cohomology, we managed to prove the following:

Theorem (Benedetti-V, 2015)

If S /I is Gorenstein, then G (I )

A

is connected whenever A ⊆ [s] is such that reg ∩

i ∈[s]\A

p

i

< reg S /I .

The above result allows us to say something on the dual graph of

an ideal defining a Gorenstein ring.

(44)

Connectedness properties of dual graphs

Given a subset A ⊆ [s], by G (I )

A

we mean the subgraph of G (I ) induced on the vertices in A. Equivalently, G (I )

A

is the dual graph of the ideal ∩

i ∈A

p

i

. Using ideas coming from liaison theory and some properties of local cohomology, we managed to prove the following:

Theorem (Benedetti-V, 2015)

If S /I is Gorenstein, then G (I )

A

is connected whenever A ⊆ [s] is such that reg ∩

i ∈[s]\A

p

i

< reg S /I .

The above result allows us to say something on the dual graph of

an ideal defining a Gorenstein ring.

(45)

Connectedness properties of dual graphs

Given a subset A ⊆ [s], by G (I )

A

we mean the subgraph of G (I ) induced on the vertices in A. Equivalently, G (I )

A

is the dual graph of the ideal ∩

i ∈A

p

i

. Using ideas coming from liaison theory and some properties of local cohomology, we managed to prove the following:

Theorem (Benedetti-V, 2015)

If S /I is Gorenstein, then G (I )

A

is connected whenever A ⊆ [s] is such that reg ∩

i ∈[s]\A

p

i

< reg S /I .

The above result allows us to say something on the dual graph of

an ideal defining a Gorenstein ring.

(46)

Connectedness properties of dual graphs

If ∆ is a simplicial complex on n vertices, then the minimal prime ideals of I

are P

F

= (x

i

: i / ∈ F ), for any facet F ∈ ∆.

So, the dual graph of ∆ and the one of I

are the same object !

As explained by Bruno, Balinski’s theorem states that, if ∆ is the

boundary of a simplicial d -polytope, then the dual graph of ∆ is

d -connected. In this case, S /I

is Gorenstein and reg S /I

= d ...

(47)

Connectedness properties of dual graphs

If ∆ is a simplicial complex on n vertices, then the minimal prime ideals of I

are P

F

= (x

i

: i / ∈ F ), for any facet F ∈ ∆. So, the dual graph of ∆ and the one of I

are the same object !

As explained by Bruno, Balinski’s theorem states that, if ∆ is the

boundary of a simplicial d -polytope, then the dual graph of ∆ is

d -connected. In this case, S /I

is Gorenstein and reg S /I

= d ...

(48)

Connectedness properties of dual graphs

If ∆ is a simplicial complex on n vertices, then the minimal prime ideals of I

are P

F

= (x

i

: i / ∈ F ), for any facet F ∈ ∆. So, the dual graph of ∆ and the one of I

are the same object !

As explained by Bruno, Balinski’s theorem states that, if ∆ is the boundary of a simplicial d -polytope, then the dual graph of ∆ is d -connected.

In this case, S /I

is Gorenstein and reg S /I

= d ...

(49)

Connectedness properties of dual graphs

If ∆ is a simplicial complex on n vertices, then the minimal prime ideals of I

are P

F

= (x

i

: i / ∈ F ), for any facet F ∈ ∆. So, the dual graph of ∆ and the one of I

are the same object !

As explained by Bruno, Balinski’s theorem states that, if ∆ is the

boundary of a simplicial d -polytope, then the dual graph of ∆ is

d -connected. In this case, S /I

is Gorenstein and reg S /I

= d ...

(50)

Subspace arrangements

The ideal I ⊂ S defines a subspace arrangement if I is the intersection of ideals generated by linear forms.

Being the intersection of ideals generated by variables, Stanley-Reisner ideals define subspace arrangements.

Theorem (Derksen-Sidman, 2002)

If I = p

1

∩ · · · ∩ p

t

where each p

i

is generated by linear forms, then

reg I ≤ t.

(51)

Subspace arrangements

The ideal I ⊂ S defines a subspace arrangement if I is the intersection of ideals generated by linear forms.

Being the intersection of ideals generated by variables, Stanley-Reisner ideals define subspace arrangements.

Theorem (Derksen-Sidman, 2002)

If I = p

1

∩ · · · ∩ p

t

where each p

i

is generated by linear forms, then

reg I ≤ t.

(52)

Subspace arrangements

The ideal I ⊂ S defines a subspace arrangement if I is the intersection of ideals generated by linear forms.

Being the intersection of ideals generated by variables, Stanley-Reisner ideals define subspace arrangements.

Theorem (Derksen-Sidman, 2002)

If I = p

1

∩ · · · ∩ p

t

where each p

i

is generated by linear forms, then

reg I ≤ t.

(53)

Subspace arrangements

Corollary (Benedetti-V, 2015)

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein and reg S /I = d , then G (I ) is d -connected.

To prove it, let p

1

, . . . , p

s

the minimal prime ideals of I (which by the assumption are generated by linear forms). Note that

d = reg S /I < s by DS, so G (I ) has at least d + 1 vertices.

Now pick a set of vertices A ⊆ [s] of cardinality less than d. Then

reg ∩

i ∈A

p

i

< d again by DS, so G (I )

[s]\A

is connected by BV. 

(54)

Subspace arrangements

Corollary (Benedetti-V, 2015)

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein and reg S /I = d , then G (I ) is d -connected.

To prove it, let p

1

, . . . , p

s

the minimal prime ideals of I (which by the assumption are generated by linear forms).

Note that

d = reg S /I < s by DS, so G (I ) has at least d + 1 vertices.

Now pick a set of vertices A ⊆ [s] of cardinality less than d. Then

reg ∩

i ∈A

p

i

< d again by DS, so G (I )

[s]\A

is connected by BV. 

(55)

Subspace arrangements

Corollary (Benedetti-V, 2015)

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein and reg S /I = d , then G (I ) is d -connected.

To prove it, let p

1

, . . . , p

s

the minimal prime ideals of I (which by the assumption are generated by linear forms). Note that

d = reg S /I < s by DS,

so G (I ) has at least d + 1 vertices.

Now pick a set of vertices A ⊆ [s] of cardinality less than d. Then

reg ∩

i ∈A

p

i

< d again by DS, so G (I )

[s]\A

is connected by BV. 

(56)

Subspace arrangements

Corollary (Benedetti-V, 2015)

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein and reg S /I = d , then G (I ) is d -connected.

To prove it, let p

1

, . . . , p

s

the minimal prime ideals of I (which by the assumption are generated by linear forms). Note that

d = reg S /I < s by DS, so G (I ) has at least d + 1 vertices.

Now pick a set of vertices A ⊆ [s] of cardinality less than d. Then

reg ∩

i ∈A

p

i

< d again by DS, so G (I )

[s]\A

is connected by BV. 

(57)

Subspace arrangements

Corollary (Benedetti-V, 2015)

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein and reg S /I = d , then G (I ) is d -connected.

To prove it, let p

1

, . . . , p

s

the minimal prime ideals of I (which by the assumption are generated by linear forms). Note that

d = reg S /I < s by DS, so G (I ) has at least d + 1 vertices.

Now pick a set of vertices A ⊆ [s] of cardinality less than d.

Then

reg ∩

i ∈A

p

i

< d again by DS, so G (I )

[s]\A

is connected by BV. 

(58)

Subspace arrangements

Corollary (Benedetti-V, 2015)

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein and reg S /I = d , then G (I ) is d -connected.

To prove it, let p

1

, . . . , p

s

the minimal prime ideals of I (which by the assumption are generated by linear forms). Note that

d = reg S /I < s by DS, so G (I ) has at least d + 1 vertices.

Now pick a set of vertices A ⊆ [s] of cardinality less than d. Then reg ∩

i ∈A

p

i

< d again by DS,

so G (I )

[s]\A

is connected by BV. 

(59)

Subspace arrangements

Corollary (Benedetti-V, 2015)

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein and reg S /I = d , then G (I ) is d -connected.

To prove it, let p

1

, . . . , p

s

the minimal prime ideals of I (which by the assumption are generated by linear forms). Note that

d = reg S /I < s by DS, so G (I ) has at least d + 1 vertices.

Now pick a set of vertices A ⊆ [s] of cardinality less than d. Then reg ∩

i ∈A

p

i

< d again by DS, so G (I )

[s]\A

is connected by BV.



(60)

Subspace arrangements

Corollary (Benedetti-V, 2015)

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein and reg S /I = d , then G (I ) is d -connected.

To prove it, let p

1

, . . . , p

s

the minimal prime ideals of I (which by the assumption are generated by linear forms). Note that

d = reg S /I < s by DS, so G (I ) has at least d + 1 vertices.

Now pick a set of vertices A ⊆ [s] of cardinality less than d. Then

reg ∩

i ∈A

p

i

< d again by DS, so G (I )

[s]\A

is connected by BV. 

(61)

Subspace arrangements

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity d , then G (I ) is d -connected.

Can G (I ) be r -connected for r > d ?

If ∆ is the boundary of a simplicial d -polytope (or more generally a triangulation of a (d − 1)-sphere), then each facet shares each of its codimension 1 faces with exactly one other facet. On the dual graph, this translates into the fact that each vertex has exactly d neighbors; In other words, the dual graph of a triangulation of a (d − 1)-sphere is d -regular, in particular it is not (d + 1)-connected. On the other hand:

Example

Take f and g homogeneous polynomials of degreesaandbin k[x, y , z]. If they generate a radical ideal J of height 2, V (J) will consist inab points in P2. If I = (f , g ) ⊂ S = k[x, y , z, w ], V (I ) ⊂ P3consists ofab lines passing through the point [0; 0; 0; 1]. So I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity a + b − 2, but G (I ) is the complete graph on ab vertices, in particular it is (ab − 1)-connected, although ab − 1 > a + b − 2 whenever min{a, b} ≥ 2.

(62)

Subspace arrangements

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity d , then G (I ) is d -connected. Can G (I ) be r -connected for r > d ?

If ∆ is the boundary of a simplicial d -polytope (or more generally a triangulation of a (d − 1)-sphere), then each facet shares each of its codimension 1 faces with exactly one other facet. On the dual graph, this translates into the fact that each vertex has exactly d neighbors; In other words, the dual graph of a triangulation of a (d − 1)-sphere is d -regular, in particular it is not (d + 1)-connected. On the other hand:

Example

Take f and g homogeneous polynomials of degreesaandbin k[x, y , z]. If they generate a radical ideal J of height 2, V (J) will consist inab points in P2. If I = (f , g ) ⊂ S = k[x, y , z, w ], V (I ) ⊂ P3consists ofab lines passing through the point [0; 0; 0; 1]. So I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity a + b − 2, but G (I ) is the complete graph on ab vertices, in particular it is (ab − 1)-connected, although ab − 1 > a + b − 2 whenever min{a, b} ≥ 2.

(63)

Subspace arrangements

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity d , then G (I ) is d -connected. Can G (I ) be r -connected for r > d ?

If ∆ is the boundary of a simplicial d -polytope (or more generally a triangulation of a (d − 1)-sphere),

then each facet shares each of its codimension 1 faces with exactly one other facet. On the dual graph, this translates into the fact that each vertex has exactly d neighbors; In other words, the dual graph of a triangulation of a (d − 1)-sphere is d -regular, in particular it is not (d + 1)-connected. On the other hand:

Example

Take f and g homogeneous polynomials of degreesaandbin k[x, y , z]. If they generate a radical ideal J of height 2, V (J) will consist inab points in P2. If I = (f , g ) ⊂ S = k[x, y , z, w ], V (I ) ⊂ P3consists ofab lines passing through the point [0; 0; 0; 1]. So I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity a + b − 2, but G (I ) is the complete graph on ab vertices, in particular it is (ab − 1)-connected, although ab − 1 > a + b − 2 whenever min{a, b} ≥ 2.

(64)

Subspace arrangements

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity d , then G (I ) is d -connected. Can G (I ) be r -connected for r > d ?

If ∆ is the boundary of a simplicial d -polytope (or more generally a triangulation of a (d − 1)-sphere), then each facet shares each of its codimension 1 faces with exactly one other facet.

On the dual graph, this translates into the fact that each vertex has exactly d neighbors; In other words, the dual graph of a triangulation of a (d − 1)-sphere is d -regular, in particular it is not (d + 1)-connected. On the other hand:

Example

Take f and g homogeneous polynomials of degreesaandbin k[x, y , z]. If they generate a radical ideal J of height 2, V (J) will consist inab points in P2. If I = (f , g ) ⊂ S = k[x, y , z, w ], V (I ) ⊂ P3consists ofab lines passing through the point [0; 0; 0; 1]. So I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity a + b − 2, but G (I ) is the complete graph on ab vertices, in particular it is (ab − 1)-connected, although ab − 1 > a + b − 2 whenever min{a, b} ≥ 2.

(65)

Subspace arrangements

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity d , then G (I ) is d -connected. Can G (I ) be r -connected for r > d ?

If ∆ is the boundary of a simplicial d -polytope (or more generally a triangulation of a (d − 1)-sphere), then each facet shares each of its codimension 1 faces with exactly one other facet. On the dual graph, this translates into the fact that each vertex has exactly d neighbors;

In other words, the dual graph of a triangulation of a (d − 1)-sphere is d -regular, in particular it is not (d + 1)-connected. On the other hand:

Example

Take f and g homogeneous polynomials of degreesaandbin k[x, y , z]. If they generate a radical ideal J of height 2, V (J) will consist inab points in P2. If I = (f , g ) ⊂ S = k[x, y , z, w ], V (I ) ⊂ P3consists ofab lines passing through the point [0; 0; 0; 1]. So I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity a + b − 2, but G (I ) is the complete graph on ab vertices, in particular it is (ab − 1)-connected, although ab − 1 > a + b − 2 whenever min{a, b} ≥ 2.

(66)

Subspace arrangements

If I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity d , then G (I ) is d -connected. Can G (I ) be r -connected for r > d ?

If ∆ is the boundary of a simplicial d -polytope (or more generally a triangulation of a (d − 1)-sphere), then each facet shares each of its codimension 1 faces with exactly one other facet. On the dual graph, this translates into the fact that each vertex has exactly d neighbors; In other words, the dual graph of a triangulation of a (d − 1)-sphere is d -regular,

in particular it is not (d + 1)-connected. On the other hand:

Example

Take f and g homogeneous polynomials of degreesaandbin k[x, y , z]. If they generate a radical ideal J of height 2, V (J) will consist inab points in P2. If I = (f , g ) ⊂ S = k[x, y , z, w ], V (I ) ⊂ P3consists ofab lines passing through the point [0; 0; 0; 1]. So I ⊂ S defines a subspace arrangement, S /I is Gorenstein of regularity a + b − 2, but G (I ) is the complete graph on ab vertices, in particular it is (ab − 1)-connected, although ab − 1 > a + b − 2 whenever min{a, b} ≥ 2.

Riferimenti

Documenti correlati

The previous discussion shows that any finite simple graph which is dual to some simplicial complex is the dual graph of a ring.. However, not all finite simple graphs are dual to

If, among the 27 lines on a smooth cubic, we take only the 6 corresponding to the exceptional divisors and the 6 corresponding to the total transforms of the conics, we get a

In 2012 Bruno spoke of the above result within a conference in Genoa, and we began to wonder on what could be said on dual graphs of projective varieties ...... If dim(X ) &gt; 1,

In an ongoing work with Bruno Benedetti and Barbara Bolognese, we are trying to leave the world of subspace arrangements. For example, if X is a linear space then its degree

In an ongoing work with Bruno Benedetti and Barbara Bolognese, we left the world of subspace arrangements. For example, if X is a linear space then its degree

In Fig. 2 we assess the resilience of the tested methods to the presence of outliers: starting from a close-to-optimal initialization, we introduced strong pairwise misalignments so

The typical occurrence of antiRo/SSA and anti-La/SSB autoantibodies in the maternal serum can modify the perinatal outcome: neonatal lupus and congenital heart block are the most

Here we performed force field-based molecular dynamics (MD) simulations, for a cumulative time of 12.5 µs, on wild type (WT) ERα and four selected mERα variants (L536Q, Y537S,