Counting Signatures of Monic Polynomials Nomie Combe 1 & Vincent - - PowerPoint PPT Presentation

counting signatures of monic polynomials
SMART_READER_LITE
LIVE PREVIEW

Counting Signatures of Monic Polynomials Nomie Combe 1 & Vincent - - PowerPoint PPT Presentation

Counting Signatures of Monic Polynomials Nomie Combe 1 & Vincent Jug 2 1: I2M (Aix-Marseille Universit & CNRS) 2: LSV (ENS Paris-Saclay & CNRS) 21/03/2017 following a work of Norbert ACampo N. Combe & V. Jug


slide-1
SLIDE 1

Counting Signatures of Monic Polynomials

Noémie Combe1 & Vincent Jugé2

1: I2M (Aix-Marseille Université & CNRS) — 2: LSV (ENS Paris-Saclay & CNRS)

21/03/2017

following a work of Norbert A’Campo

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-2
SLIDE 2

Contents

1

Signatures of Monic Polynomials

2

Counting Signatures

3

Asymptotic Estimations

4

Conclusion

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-3
SLIDE 3

Configurations of Monic Polynomials

Consider your favorite monic polynomial P and draw:

1 its real antecedents, i.e. tz P C : Ppzq P Ru 2 its imaginary antecedents, i.e. tz P C : Ppzq P iRu

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-4
SLIDE 4

Configurations of Monic Polynomials

Consider your favorite monic polynomial P and draw:

1 its real antecedents, i.e. tz P C : Ppzq P Ru 2 its imaginary antecedents, i.e. tz P C : Ppzq P iRu

PpXq “ X 3 ` 2iX 2 ´ X ` 1

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-5
SLIDE 5

Configurations of Monic Polynomials

Consider your favorite monic polynomial P and draw:

1 its real antecedents, i.e. tz P C : Ppzq P Ru 2 its imaginary antecedents, i.e. tz P C : Ppzq P iRu

PpXq “ X 3 ` 2iX 2 ´ X ` 1

1 Roots of P (with multiplicity) 2 Roots of P1 lying on the curves 3 Asymptotic rays

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-6
SLIDE 6

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-7
SLIDE 7

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-8
SLIDE 8

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-9
SLIDE 9

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-10
SLIDE 10

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-11
SLIDE 11

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-12
SLIDE 12

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-13
SLIDE 13

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-14
SLIDE 14

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-15
SLIDE 15

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-16
SLIDE 16

From Configurations to Signatures

Which configurations are isotopic to each other?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-17
SLIDE 17

From Configurations to Signatures (a.k.a. Isotopy Classes)

Which configurations are isotopic to each other?

Signatures are used to compute cohomologies of braid groups

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-18
SLIDE 18

An Abstract View of Signatures

Four necessary criteria for being a signature of degree d. . .

1 No cycle

complex analysis and meromorphic functions

2 2d bicolored edges

alternating and starting from even edges

3 1-colored contact points

with even valency ” 0 pmod 2q

4 2-colored contact points

with alternating colors and valency ” 0 pmod 4q

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-19
SLIDE 19

An Abstract View of Signatures

Four necessary criteria for being a signature of degree d. . .

1 No cycle

complex analysis and meromorphic functions

2 2d bicolored edges

alternating and starting from even edges

3 1-colored contact points

with even valency ” 0 pmod 2q

4 2-colored contact points

with alternating colors and valency ” 0 pmod 4q

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-20
SLIDE 20

An Abstract View of Signatures

Four necessary criteria for being a signature of degree d. . .

1 No cycle

complex analysis and meromorphic functions

2 2d bicolored edges

alternating and starting from even edges

3 1-colored contact points

with even valency ” 0 pmod 2q

4 2-colored contact points

with alternating colors and valency ” 0 pmod 4q

✗ ✗

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-21
SLIDE 21

An Abstract View of Signatures

Four necessary criteria for being a signature of degree d. . .

1 No cycle

complex analysis and meromorphic functions

2 2d bicolored edges

alternating and starting from even edges

3 1-colored contact points

with even valency ” 0 pmod 2q

4 2-colored contact points

with alternating colors and valency ” 0 pmod 4q

✗ ✗ ✗

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-22
SLIDE 22

An Abstract View of Signatures

Four necessary criteria for being a signature of degree d. . .

1 No cycle

complex analysis and meromorphic functions

2 2d bicolored edges

alternating and starting from even edges

3 1-colored contact points

with even valency ” 0 pmod 2q

4 2-colored contact points

with alternating colors and valency ” 0 pmod 4q

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-23
SLIDE 23

An Abstract View of Signatures

Four necessary criteria for being a signature of degree d. . .

1 No cycle

complex analysis and meromorphic functions

2 2d bicolored edges

alternating and starting from even edges

3 1-colored contact points

with even valency ” 0 pmod 2q

4 2-colored contact points

with alternating colors and valency ” 0 pmod 4q

Theorem (Norbert A’Campo, 2017)

1 These criteria are sufficient for being a signature of degree d

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-24
SLIDE 24

An Abstract View of Signatures

Four necessary criteria for being a signature of degree d. . .

1 No cycle

complex analysis and meromorphic functions

2 2d bicolored edges

alternating and starting from even edges

3 1-colored contact points

with even valency ” 0 pmod 2q

4 2-colored contact points

with alternating colors and valency ” 0 pmod 4q

Theorem (Norbert A’Campo, 2017)

1 These criteria are sufficient for being a signature of degree d 2 Each signature induces a submanifold of polynomials 3 They form a CW-complex („ polytope).

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-25
SLIDE 25

An Abstract View of Signatures

Four necessary criteria for being a signature of degree d. . .

1 No cycle

complex analysis and meromorphic functions

2 2d bicolored edges

alternating and starting from even edges

3 1-colored contact points

with even valency ” 0 pmod 2q

4 2-colored contact points

with alternating colors and valency ” 0 pmod 4q

Theorem (Norbert A’Campo, 2017)

1 These criteria are sufficient for being a signature of degree d 2 Each signature induces a submanifold of polynomials 3 They form a CW-complex („ polytope).

How many faces does the complex have?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-26
SLIDE 26

Contents

1

Signatures of Monic Polynomials

2

Counting Signatures

3

Asymptotic Estimations

4

Conclusion

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-27
SLIDE 27

Counting Which Signatures?

Three parameters of interest

26 27 28 29 30 31 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-28
SLIDE 28

Counting Which Signatures?

Three parameters of interest

1 Degree of the polynomial

d “ 1

2#edges

26 27 28 29 30 31 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

d “ 8

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-29
SLIDE 29

Counting Which Signatures?

Three parameters of interest

1 Degree of the polynomial

d “ 1

2#edges

2 Root default of the polynomial

r “ d ´ #roots

26 27 28 29 30 31 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

d “ 8 r “ 0

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-30
SLIDE 30

Counting Which Signatures?

Three parameters of interest

1 Degree of the polynomial

d “ 1

2#edges

2 Root default of the polynomial

r “ d ´ #roots

3 Codimension of the signature manifold

c “ 2r ` ř local codim.

26 27 28 29 30 31 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

d “ 8 r “ 0 c “ 6

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-31
SLIDE 31

Counting Which Signatures?

Three parameters of interest

1 Degree of the polynomial

d “ 1

2#edges

2 Root default of the polynomial

r “ d ´ #roots

3 Codimension of the signature manifold

c “ 2r ` ř local codim.

How many signatures with parameters pc, d, rq are there?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-32
SLIDE 32

Counting Signatures: First Steps

Evaluating sc,d,r “ #tsignatures with parameters pc, d, rqu

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-33
SLIDE 33

Counting Signatures: First Steps

Evaluating sc,d,r “ #tsignatures with parameters pc, d, rqu

Recursion Formula for Facets

s0,d`1,0 “ ÿ

d1`d2`d3`d4“d

s0,d1,0 ˆ s0,d2,0 ˆ s0,d3,0 ˆ s0,d4,0

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-34
SLIDE 34

Counting Signatures: First Steps

Evaluating sc,d,r “ #tsignatures with parameters pc, d, rqu

Recursion Formula for Facets

s0,d`1,0 “ ÿ

d1`d2`d3`d4“d

s0,d1,0 ˆ s0,d2,0 ˆ s0,d3,0 ˆ s0,d4,0 Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-35
SLIDE 35

Counting Signatures: First Steps

Evaluating sc,d,r “ #tsignatures with parameters pc, d, rqu

Recursion Formula for Facets

s0,d`1,0 “ ÿ

d1`d2`d3`d4“d

s0,d1,0 ˆ s0,d2,0 ˆ s0,d3,0 ˆ s0,d4,0 Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-36
SLIDE 36

Counting Signatures: First Steps

Evaluating sc,d,r “ #tsignatures with parameters pc, d, rqu

Recursion Formula for Facets

s0,d`1,0 “ ÿ

d1`d2`d3`d4“d

s0,d1,0 ˆ s0,d2,0 ˆ s0,d3,0 ˆ s0,d4,0 Proof:

02 12 22 32 03 13 23 33 43 53 63 73 04 14 24 34

H

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-37
SLIDE 37

Counting Signatures: First Steps

Evaluating sc,d,r “ #tsignatures with parameters pc, d, rqu

Recursion Formula for Facets

s0,d`1,0 “ ÿ

d1`d2`d3`d4“d

s0,d1,0 ˆ s0,d2,0 ˆ s0,d3,0 ˆ s0,d4,0

Counting Facets with Fuss-Catalan Numbers (A’Campo 17)

s0,d,0 “ 1 3d ` 1 ˆ4d d ˙

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-38
SLIDE 38

Counting Signatures: First Steps

Evaluating sc,d,r “ #tsignatures with parameters pc, d, rqu

Recursion Formula for Facets

s0,d`1,0 “ ÿ

d1`d2`d3`d4“d

s0,d1,0 ˆ s0,d2,0 ˆ s0,d3,0 ˆ s0,d4,0

Counting Facets with Fuss-Catalan Numbers (A’Campo 17)

s0,d,0 “ 1 3d ` 1 ˆ4d d ˙ ñ What next?

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-39
SLIDE 39

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-40
SLIDE 40

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr 2 Canonical splitting

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-41
SLIDE 41

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr 2 Canonical splitting

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-42
SLIDE 42

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr 2 Canonical splitting

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-43
SLIDE 43

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr 2 Canonical splitting

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-44
SLIDE 44

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr 2 Canonical splitting

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-45
SLIDE 45

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr 2 Canonical splitting

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-46
SLIDE 46

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr 2 Canonical splitting

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-47
SLIDE 47

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr 2 Canonical splitting 3 Recursive decomposition

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-48
SLIDE 48

Counting Signatures: Some Tools

Strategy: Use recursion formulæ and generating functions

1 Generating function Spx, y, zq “ ř sc,d,rxcydzr 2 Canonical splitting 3 Recursive decomposition

H

02 12 22 32 03 13 23 33 43 53 63 73 04 14 24 34

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-49
SLIDE 49

Counting Signatures: Some More Tools

1 Variant of signatures: contact signatures

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-50
SLIDE 50

Counting Signatures: Some More Tools

1 Variant of signatures: contact signatures

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-51
SLIDE 51

Counting Signatures: Some More Tools

1 Variant of signatures: contact signatures

with generating series Cpx, y, zq

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-52
SLIDE 52

Counting Signatures: Some More Tools

1 Variant of signatures: contact signatures

with generating series Cpx, y, zq

2 Another variant of signatures with generating series Dpx, y, zq

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-53
SLIDE 53

Counting Signatures: The End is Near

Three algebraic equations (using bijective proofs) S “ 1 ` yC4{p1 ´ x2yzC4q C “ DS D “ 1 ` xyC4D2{p1 ´ x2yC4Dq

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-54
SLIDE 54

Counting Signatures: The End is Near

Three algebraic equations (using bijective proofs) S “ 1 ` yC4{p1 ´ x2yzC4q C “ DS D “ 1 ` xyC4D2{p1 ´ x2yC4Dq

Theorem

The generating function Spx, y, zq is algebraic!

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-55
SLIDE 55

Counting Signatures: The End is Near

Three algebraic equations (using bijective proofs) S “ 1 ` yC4{p1 ´ x2yzC4q C “ DS D “ 1 ` xyC4D2{p1 ´ x2yC4Dq

Theorem

The generating function Spx, y, zq is algebraic! and its minimal polynomial is not so nice. . .

x4px ` 1q4 ` S4yv ` x4 ´ x8 ` 4vxpx4 ` x2v ` v 2q ´ px2 ` v 2q2 ` S4yv 5˘ “ 0

with v “ x2z ` 1{pS ´ 1q.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-56
SLIDE 56

Counting Signatures Efficiently

Three ideas for computing sc,d,r

1 Using directly the minimal polynomial of S

Did not work

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-57
SLIDE 57

Counting Signatures Efficiently

Three ideas for computing sc,d,r

1 Using directly the minimal polynomial of S

Did not work

2 Finding a linear DE satisfied by S

Size overflow

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-58
SLIDE 58

Counting Signatures Efficiently

Three ideas for computing sc,d,r

1 Using directly the minimal polynomial of S

Did not work

2 Finding a linear DE satisfied by S

Size overflow

3 Using the 3 equations!

Makes the job

S “ 1 ` yC4{p1 ´ x2yzC4q C “ DS D “ 1 ` xyC4D2{p1 ´ x2yC4Dq

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-59
SLIDE 59

Counting Signatures Efficiently

Three ideas for computing sc,d,r

1 Using directly the minimal polynomial of S

Did not work

2 Finding a linear DE satisfied by S

Size overflow

3 Using the 3 equations!

Makes the job

S “ 1 ` yC4 ´ x2yzC4 ` x2yzSC4 C “ DS D “ 1 ` xyC4D2 ´ x2yC4D ` x2yC4D2

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-60
SLIDE 60

Counting Signatures Efficiently

Three ideas for computing sc,d,r

1 Using directly the minimal polynomial of S

Did not work

2 Finding a linear DE satisfied by S

Size overflow

3 Using the 3 equations!

Makes the job

S “ 1 ` yC4 ´ x2yzC4 ` x2yzSC4 C “ DS D “ 1 ` xyC4D2 ´ x2yC4D ` x2yC4D2 Two more lemmas: sc,d,r ą 0 ñ 2r ď c ď 2d

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-61
SLIDE 61

Counting Signatures Efficiently

Three ideas for computing sc,d,r

1 Using directly the minimal polynomial of S

Did not work

2 Finding a linear DE satisfied by S

Size overflow

3 Using the 3 equations!

Makes the job

S “ 1 ` yC4 ´ x2yzC4 ` x2yzSC4 C “ DS D “ 1 ` xyC4D2 ´ x2yC4D ` x2yC4D2 Two more lemmas: sc,d,r ą 0 ñ 2r ď c ď 2d and sc,d,r ď 30d`1

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-62
SLIDE 62

Counting Signatures Efficiently

Three ideas for computing sc,d,r

1 Using directly the minimal polynomial of S

Did not work

2 Finding a linear DE satisfied by S

Size overflow

3 Using the 3 equations!

Makes the job

S “ 1 ` yC4 ´ x2yzC4 ` x2yzSC4 C “ DS D “ 1 ` xyC4D2 ´ x2yC4D ` x2yC4D2 Two more lemmas: sc,d,r ą 0 ñ 2r ď c ď 2d and sc,d,r ď 30d`1

Corollary

The family of coefficients psc,d,rqcďC,dďD,rďR can be computed in time OpmintC, D, Ru2 mintC, Du2D4q.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-63
SLIDE 63

Contents

1

Signatures of Monic Polynomials

2

Counting Signatures

3

Asymptotic Estimations

4

Conclusion

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-64
SLIDE 64

What if d Ñ `8?

Problem: Fix c and r and evaluate lim sc,d,r when d Ñ `8

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-65
SLIDE 65

What if d Ñ `8?

Problem: Fix c and r and evaluate lim sc,d,r when d Ñ `8 Two ideas:

1 Singularity analysis of S

Difficult

(Several branches in multivariate environment)

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-66
SLIDE 66

What if d Ñ `8?

Problem: Fix c and r and evaluate lim sc,d,r when d Ñ `8 Two ideas:

1 Singularity analysis of S

Difficult

2 Study a class of typical signatures!

Successful

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-67
SLIDE 67

What if d Ñ `8?

Problem: Fix c and r and evaluate lim sc,d,r when d Ñ `8 Two ideas:

1 Singularity analysis of S

Difficult

2 Study a class of typical signatures!

Successful

(Each component has at most 1 contact point, of small valency)

1 2 3 4 5 6 7 8 9 10 11

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-68
SLIDE 68

What if d Ñ `8?

Problem: Fix c and r and evaluate lim sc,d,r when d Ñ `8 Two ideas:

1 Singularity analysis of S

Difficult

2 Study a class of typical signatures!

Successful

(Each component has at most 1 contact point, of small valency)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • 1

2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-69
SLIDE 69

Counting Typical Signatures (1/2)

Another generating function: T px, y, zq “ ř tc,d,rxcydzr

Lemma #4

T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-70
SLIDE 70

Counting Typical Signatures (1/2)

Another generating function: T px, y, zq “ ř tc,d,rxcydzr

Lemma #4

T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8. Proof: H

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-71
SLIDE 71

Counting Typical Signatures (1/2)

Another generating function: T px, y, zq “ ř tc,d,rxcydzr

Lemma #4

T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8. Proof:

1 2 3 4

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-72
SLIDE 72

Counting Typical Signatures (1/2)

Another generating function: T px, y, zq “ ř tc,d,rxcydzr

Lemma #4

T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8. Proof:

1 2 3 4 5 6 7 8

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-73
SLIDE 73

Counting Typical Signatures (1/2)

Another generating function: T px, y, zq “ ř tc,d,rxcydzr

Lemma #4

T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8. Proof:

8 1 2 3 4 5 6 7

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-74
SLIDE 74

Counting Typical Signatures (1/2)

Another generating function: T px, y, zq “ ř tc,d,rxcydzr

Lemma #4

T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8. Proof:

7 8 1 2 3 4 5 6

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-75
SLIDE 75

Counting Typical Signatures (1/2)

Another generating function: T px, y, zq “ ř tc,d,rxcydzr

Lemma #4

T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8. Proof:

2 3 4 5 6 7 8 1

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-76
SLIDE 76

Counting Typical Signatures (1/2)

Another generating function: T px, y, zq “ ř tc,d,rxcydzr

Lemma #4

T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8. Proof:

1 2 3 4 5 6 7 8

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-77
SLIDE 77

Counting Typical Signatures (2/2)

Algebraic equation with triangular system of variables T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-78
SLIDE 78

Lagrange Inversion (with 3 variables)

Algebraic equation with triangular system of variables T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-79
SLIDE 79

Lagrange Inversion (with 3 variables)

Algebraic equation with triangular system of variables T “ 1 ` yT 4 ` 4xy2T 8 ` x2y2zT 8. Exact and asymptotic evaluations tc,d,r “ 1cě2r ¨ 1dě2c´2r ¨ 4c´2r c ` 3d ´ r ` 1 ˆ 4d c ´ 2r, d ´ 2c ´ 2r, r, c ` 3d ´ r ˙ tc,d,r „ 1cě2r r!pc ´ 2rq! ¨ c 2 27π ¨ 4c 3c ¨ 3r 16r ¨ 44d 33d ¨ dc´r´3{2

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-80
SLIDE 80

Typical Signatures are Typical

Main tool: Reducing a signature

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-81
SLIDE 81

Typical Signatures are Typical

Main tool: Reducing a signature

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-82
SLIDE 82

Typical Signatures are Typical

Main tool: Reducing a signature

01 11 21 31 41 51 61 71 81 91 101 111 121 131 141 151 161 171 181 191 201 211 221 231

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-83
SLIDE 83

Typical Signatures are Typical

Main tool: Reducing a signature

01 11 21 31 41 51 61 71 81 91 101 111 121 131 141 151 161 171 181 191 201 211 221 231

Bounding lemma

At most O ´ dc´r´5{2 ¨ 44d

33d

¯ signatures reduce to a non-typical signature σ.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-84
SLIDE 84

Typical Signatures are Typical

Main tool: Reducing a signature Proof: with C components: Fill the regions (at most 8c)

01 11 21 31 41 51 61 71 81 91 101 111 121 131 141 151 161 171 181 191 201 211 221 231

Bounding lemma

At most O ´ dc´r´5{2 ¨ 44d

33d

¯ signatures reduce to a non-typical signature σ.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-85
SLIDE 85

Typical Signatures are Typical

Main tool: Reducing a signature Proof: with C components: Fill the regions (at most 8c) Place the C components

? ? ?

Bounding lemma

At most O ´ dc´r´5{2 ¨ 44d

33d

¯ signatures reduce to a non-typical signature σ.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-86
SLIDE 86

Typical Signatures are Typical

Main tool: Reducing a signature Proof: with C components: Fill the regions (at most 8c) Place the C components Non-typical ô C ď c ´ r ´ 1

? ? ?

Bounding lemma

At most O ´ dc´r´5{2 ¨ 44d

33d

¯ signatures reduce to a non-typical signature σ.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-87
SLIDE 87

Typical Signatures are Typical

Main tool: Reducing a signature Proof: with C components: Fill the regions (at most 8c) Place the C components Non-typical ô C ď c ´ r ´ 1 Fixing c ñ finite number of reductions

? ? ?

Bounding lemma

At most O ´ dc´r´5{2 ¨ 44d

33d

¯ signatures reduce to a non-typical signature σ.

Theorem

sc,d,r „ tc,d,r „ 1cě2r r!pc ´ 2rq! ¨ c 2 27π ¨ 4c 3c ¨ 3r 16r ¨ 44d 33d ¨ dc´r´3{2

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-88
SLIDE 88

Contents

1

Signatures of Monic Polynomials

2

Counting Signatures

3

Asymptotic Estimations

4

Conclusion

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-89
SLIDE 89

Conclusion

We still need to. . .

1 Look for more efficient algorithms or closed-form formulæ

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-90
SLIDE 90

Conclusion

We still need to. . .

1 Look for more efficient algorithms or closed-form formulæ 2 Study the distribution of c, r and pc, rq for large values of d

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-91
SLIDE 91

Conclusion

We still need to. . .

1 Look for more efficient algorithms or closed-form formulæ 2 Study the distribution of c, r and pc, rq for large values of d 3 Ask you for other ideas and

Thank you!

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-92
SLIDE 92

Counting Signatures: Three Lemmas (1/3)

Lemma #1

S “ 1 ` yC4{p1 ´ x2yzC4q.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-93
SLIDE 93

Counting Signatures: Three Lemmas (1/3)

Lemma #1

S “ 1 ` yC4{p1 ´ x2yzC4q. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-94
SLIDE 94

Counting Signatures: Three Lemmas (1/3)

Lemma #1

S “ 1 ` yC4{p1 ´ x2yzC4q. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 ´11 01

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-95
SLIDE 95

Counting Signatures: Three Lemmas (1/3)

Lemma #1

S “ 1 ` yC4{p1 ´ x2yzC4q. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 ´12 02 12 22 32 42

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-96
SLIDE 96

Counting Signatures: Three Lemmas (1/3)

Lemma #1

S “ 1 ` yC4{p1 ´ x2yzC4q. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 ´13 03 13 23 33 43 53 63 73 83

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-97
SLIDE 97

Counting Signatures: Three Lemmas (1/3)

Lemma #1

S “ 1 ` yC4{p1 ´ x2yzC4q. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 44 ´14 04 14 24 34

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-98
SLIDE 98

Counting Signatures: Three Lemmas (2/3)

Lemma #2

C “ DS.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-99
SLIDE 99

Counting Signatures: Three Lemmas (2/3)

Lemma #2

C “ DS. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 ´1

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-100
SLIDE 100

Counting Signatures: Three Lemmas (2/3)

Lemma #2

C “ DS. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 ´1 01 11 21 31 41 51 61 71 81 ´11

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-101
SLIDE 101

Counting Signatures: Three Lemmas (2/3)

Lemma #2

C “ DS. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 ´1 02 12 22 32 42 52 62 72

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-102
SLIDE 102

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq.

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-103
SLIDE 103

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-104
SLIDE 104

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-105
SLIDE 105

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-106
SLIDE 106

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 01 ´11

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-107
SLIDE 107

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 ´12 02

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-108
SLIDE 108

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 ´13 03

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-109
SLIDE 109

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 ´14 04 14 24 34 44

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-110
SLIDE 110

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 ´15 05

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-111
SLIDE 111

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 ´16 06 16 26 36 46

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-112
SLIDE 112

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 ´17 07

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-113
SLIDE 113

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 ´18 08

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-114
SLIDE 114

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 ´19 09

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-115
SLIDE 115

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 ´110 010 110 210 310 410

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials

slide-116
SLIDE 116

Counting Signatures: Three Lemmas (3/3)

Lemma #3

D “ 1 ` xyC4D2{p1 ´ x2yC4Dq. Proof:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ´1 7.5 19.5 011 111 211 311 411 511 611 711 811 ´111

  • N. Combe & V. Jugé

Counting Signatures of Monic Polynomials