• 検索結果がありません。

Goulden and Jackson’s b-conjecture and Matching-Jack conjecture

N/A
N/A
Protected

Academic year: 2022

シェア "Goulden and Jackson’s b-conjecture and Matching-Jack conjecture"

Copied!
35
0
0

読み込み中.... (全文を見る)

全文

(1)

Goulden and Jackson’s b-conjecture and

Matching-Jack conjecture

Houcine Ben Dali

Université de Paris, CNRS, IRIF, Paris Université de Lorraine, CNRS, IECL, Nancy

86th Séminaire Lotharingien de Combinatoire

Bad Boll, September 7, 2021

(2)

Maps

(3)

Maps

A map is a graph embedded into a surface, oriented or not.

A map is oriented if it is the case of the underlying surface.

A map is bipartite if its vertices are colored in white and black, and each white vertex has only black neighbors.

Figure 1: A non-oriented bipartite map on the Klein bottle.

(4)

Maps

A bipartite map is rooted by distinguishing an oriented white corner.

Example:

Figure 1:A rooted non-oriented bipartite map on the Klein bottle.

(5)

Maps

(λ, µ, ν ) is the profile of the bipartite map M if λ is the

partition given by the face degrees divided by 2, and µ (resp.

ν) is the partition given by the degrees of the white (resp.

black) vertices.

Figure 1: A non-oriented bipartite map on the Klein bottle with profile ([9],[4,2,2,1],[4,2,2,1]).

(6)

Generating series of

oriented bipartite maps

(7)

Oriented bipartite maps

1

For every triplet (λ, µ, ν), we have the bijection Oriented (edge-) labelled

bipartite maps of profile (λ, µ, ν)

←→ couples of permutations (σ

1

, σ

2

) such that the cyclic type of σ

1

, σ

2

and σ

1

σ

2

are respectively λ, µ and ν

2

[Representation theory of the symmetric group]

X

θ

t|θ| |θ|!

dim(θ)sθ(p)sθ(q)sθ(r) =X

n≥0

tn n!

X

σ12∈Sn

ptype(σ1)qtype(σ2)rtype(σ1σ2),

sθ: the Schur function associated to the partitionθ, expressed in the power-sum basis.

p:= (pi)i≥1; q:= (qi)i≥1; ; r:= (ri)i≥1.

[Classical]

t

∂tlog X

θ

t|θ| |θ|!

dim(θ)sθ(p)sθ(q)sθ(r)

!

= X

Mconnected rooted oriented bipartite maps

t|M|pΛ(M)qΛ(M)rΛ(M).

(8)

Oriented bipartite maps

1

For every triplet (λ, µ, ν), we have the bijection Oriented (edge-) labelled

bipartite maps of profile (λ, µ, ν)

←→ couples of permutations (σ

1

, σ

2

) such that the cyclic type of σ

1

, σ

2

and σ

1

σ

2

are respectively λ, µ and ν

2

[Representation theory of the symmetric group]

X

θ

t|θ| |θ|!

dim(θ)sθ(p)sθ(q)sθ(r) =X

n≥0

tn n!

X

σ12∈Sn

ptype(σ1)qtype(σ2)rtype(σ1σ2),

sθ: the Schur function associated to the partitionθ, expressed in the power-sum basis.

p:= (pi)i≥1; q:= (qi)i≥1; ; r:= (ri)i≥1.

[Classical]

t

∂tlog X

θ

t|θ| |θ|!

dim(θ)sθ(p)sθ(q)sθ(r)

!

= X

Mconnected rooted oriented bipartite maps

t|M|pΛ(M)qΛ(M)rΛ(M).

(9)

Oriented bipartite maps

1

For every triplet (λ, µ, ν), we have the bijection Oriented (edge-) labelled

bipartite maps of profile (λ, µ, ν)

←→ couples of permutations (σ

1

, σ

2

) such that the cyclic type of σ

1

, σ

2

and σ

1

σ

2

are respectively λ, µ and ν

2

[Representation theory of the symmetric group]

X

θ

t|θ| |θ|!

dim(θ)sθ(p)sθ(q)sθ(r) =X

n≥0

tn n!

X

σ12∈Sn

ptype(σ1)qtype(σ2)rtype(σ1σ2),

sθ: the Schur function associated to the partitionθ, expressed in the power-sum basis.

p:= (pi)i≥1; q:= (qi)i≥1; ; r:= (ri)i≥1.

[Classical]

t

∂tlog X

θ

t|θ| |θ|!

dim(θ)sθ(p)sθ(q)sθ(r)

!

= X

Mconnected rooted oriented bipartite maps

t|M|pΛ(M)qΛ(M)rΛ(M).

(10)

Generating series of

non-oriented maps

(11)

Labelled Maps

A map is labelled if it is equipped with a bijection between its edge-sides and the set A

n

:= {1, 1, ..., ˆ n, ˆ n}.

Example:

Figure 2:A labelled non-oriented bipartite map on the Klein bottle

(12)

Matchings

A matchingδonAn={1,ˆ1, ...,n,ˆn}is a 1-regular graph.

Figure 3:An example of a matching onA8.

Remark

A permutation of cycle typeλis associated to a matchingδsuch that Λ(ε, δ) =λ.

The profile of(δ1, δ2, δ3)is the triplet of partitions (Λ(δ1, δ2),Λ(δ1, δ3),Λ(δ23)).

(13)

Matchings

A matching is bipartite if each one of its edges is of the form(i,ˆj).

Figure 3:An example of a bipartite matching onA8.

Remark

A permutation of cycle typeλis associated to a matchingδsuch that Λ(ε, δ) =λ.

The profile of(δ1, δ2, δ3)is the triplet of partitions (Λ(δ1, δ2),Λ(δ1, δ3),Λ(δ23)).

(14)

Matchings

For everyn≥1, we denote byεthe bipartite matching onAnformed by the pairs of the form(i,ˆi).

Figure 3:The matching onA .

Remark

A permutation of cycle typeλis associated to a matchingδsuch that Λ(ε, δ) =λ.

The profile of(δ1, δ2, δ3)is the triplet of partitions (Λ(δ1, δ2),Λ(δ1, δ3),Λ(δ23)).

(15)

Matchings

For two matchingsδandδ0 onAn, we defineΛ(δ, δ0)as the partition given by half-sizes of the connected components of the graphδ∪δ0.

Once and for all, we fix for every partitionλa bipartite matchingδλsuch thatΛ(ε, δλ) =λ.

Figure 3:An example of the graph ofε∪δλforλ= [3,3,2]

Remark

A permutation of cycle typeλis associated to a matchingδsuch that Λ(ε, δ) =λ.

The profile of(δ1, δ2, δ3)is the triplet of partitions (Λ(δ1, δ2),Λ(δ1, δ3),Λ(δ23)).

(16)

Matchings

We have a bijection betweenSnand bipartite matchings onAn: σ7−→the matching formed by(i,σ(j)).ˆ

Example:

Remark

A permutation of cycle typeλis associated to a matchingδsuch that Λ(ε, δ) =λ.

The profile of(δ1, δ2, δ3)is the triplet of partitions (Λ(δ1, δ2),Λ(δ1, δ3),Λ(δ23)).

(1,2,3)(4,5,6)(7,8)7−→

(17)

Matchings

We have a bijection betweenSnand bipartite matchings onAn: σ7−→the matching formed by(i,σ(j)).ˆ

Example:

Remark

A permutation of cycle typeλis associated to a matchingδsuch that Λ(ε, δ) =λ.

The profile of(δ1, δ2, δ3)is the triplet of partitions (Λ(δ1, δ2),Λ(δ1, δ3),Λ(δ23)).

(1,2,3)(4,5,6)(7,8)7−→

(18)

Correspondence between bipartite maps and matchings

For a labelled bipartite map M we define three matchings;

δ

1

relating the labels of edge-sides forming a white corner.

δ

2

relating the labels of edge-sides forming a black corner.

δ

3

relating the labels of the two

sides of a same edge.

(19)

Correspondence between bipartite maps and matchings

For a labelled bipartite map M we define three matchings;

δ

1

relating the labels of edge-sides forming a white corner.

δ

2

relating the labels of edge-sides forming a black corner.

δ

3

relating the labels of the two sides of a same edge.

Λ(δ

1

, δ

2

) gives the face degrees.

Λ(δ

1

, δ

3

) gives the white vertices degrees.

Λ(δ

2

, δ

3

) gives the black vertices degrees.

(20)

Generating series of non-oriented maps [Goulden and Jackson ’96]

1

We obtain the following bijection : Labelled bipartite maps of

profile (λ, µ, ν)

←→ (δ

1

, δ

2

, δ

3

) of profile (λ, µ, ν)

2

[Representation Theory of the Gelfand pair (S

2n

, B

n

)]

X

θ

t|θ|dim(2θ)

|2θ|! Zθ(p)Zθ(q)Zθ(r) =X

n≥0

tn (2n)!

X

δ012

matchings onAn

pΛ(δ01)qΛ(δ12)rΛ(δ12),

Zθ: the zonal polynomial associated to the partitionθ, expressed in the power-sum basis.

p:= (pi)i≥1;q:= (qi)i≥1;r:= (ri)i≥1.

3

2t∂

∂t log X

θ

t|θ|dim(2θ)

|2θ|! Zθ(p)Zθ(q)Zθ(r)

!

= X

Mconnected rooted

bipartite maps

t|M|pΛ(M)qΛ(M)rΛ(M)

(21)

Generating series of non-oriented maps [Goulden and Jackson ’96]

1

We obtain the following bijection : Labelled bipartite maps of

profile (λ, µ, ν)

←→ (δ

1

, δ

2

, δ

3

) of profile (λ, µ, ν)

2

[Representation Theory of the Gelfand pair (S

2n

, B

n

)]

X

θ

t|θ|dim(2θ)

|2θ|! Zθ(p)Zθ(q)Zθ(r) =X

n≥0

tn (2n)!

X

δ012

matchings onAn

pΛ(δ01)qΛ(δ12)rΛ(δ12),

Zθ: the zonal polynomial associated to the partitionθ, expressed in the power-sum basis.

p:= (pi)i≥1;q:= (qi)i≥1;r:= (ri)i≥1.

3

2t∂

∂t log X

θ

t|θ|dim(2θ)

|2θ|! Zθ(p)Zθ(q)Zθ(r)

!

= X

Mconnected rooted

bipartite maps

t|M|pΛ(M)qΛ(M)rΛ(M)

(22)

Jack polynomials and a one parameter deformation of

the generating series of

bipartite maps

(23)

Jack polynomials

We consider the following deformation of the Hall scalar producth., .ibdefined on symmetric functions by

hpλ,pµibλµzλ(1+b)`(λ).

Definition

Jack polynomials of parameter 1+b, denotedJλ(b)are defined as follows :

1 Triangularity and normalisation: ifλ`n, then

Jλ(b)= X

µ`n,µ≤λ

uλµmµ,

such thatuλ[1n]=n!.

(predominance orderµλ:µ1+µ2+...+µiλ1+λ2...+λi∀i) 2 Orthogonality: ifλ6=µthenhJλ(b),Jµ(b)ib=0.

(24)

Jack polynomials

We consider the following deformation of the Hall scalar producth., .ibdefined on symmetric functions by

hpλ,pµibλµzλ(1+b)`(λ).

Definition

Jack polynomials of parameter 1+b, denotedJλ(b)are defined as follows :

1 Triangularity and normalisation: ifλ`n, then

Jλ(b)= X

µ`n,µ≤λ

uλµmµ,

such thatuλ[1n]=n!.

(predominance orderµλ:µ1+µ2+...+µiλ1+λ2...+λi∀i)

Orthogonality: ifλ6=µthenhJ(b),J(b)i =0.

(25)

Jack polynomials

For b = 0 −→ Schur functions J

λ(0)

=

dim(λ)|λ|!

s

λ

.

For b = 1 −→ Zonal polynomials J

λ(1)

= Z

λ

. We define

τ

b

(t, p, q, r) := X

θ

t

|θ|

j

θ(b)

J

θ(b)

(p)J

θ(b)

(q)J

θ(b)

(r),

where j

θ(b)

= hJ

θ(b)

, J

θ(b)

i

b

.

(26)

b=0

τ0(t,p,q,r) =X

n≥0

X

λ`n

tn zλ

X

δbipartite

matching onAn

pλqΛ(ε,δ)rΛ(δλ,δ).

t∂

∂t log (τ0(t,p,q,r)) = X

Moriented rooted

connected bipartite map

t|M|pΛ(M)qΛ(M)rΛ(M).

b=1

τ1(t,p,q,r) =X

n≥0

X

λ`n

tn zλ2`(λ)

X

δmatching onAn

pλqΛ(ε,δ)rΛ(δλ,δ).

2t∂

∂tlog (τ1(t,p,q,r)) = X

Mrooted

connected bipartite map

t|M|pΛ(M)qΛ(M)rΛ(M).

(27)

b=0

τ0(t,p,q,r) =X

n≥0

X

λ`n

tn zλ

X

δbipartite

matching onAn

pλqΛ(ε,δ)rΛ(δλ,δ).

t∂

∂t log (τ0(t,p,q,r)) = X

Moriented rooted

connected bipartite map

t|M|pΛ(M)qΛ(M)rΛ(M).

b=1

τ1(t,p,q,r) =X

n≥0

X

λ`n

tn zλ2`(λ)

X

δmatching onAn

pλqΛ(ε,δ)rΛ(δλ,δ).

2t∂

∂tlog (τ1(t,p,q,r)) = X

Mrooted

connected bipartite map

t|M|pΛ(M)qΛ(M)rΛ(M).

(28)

Goulden and Jackson’s conjectures ’96 Matching-Jack conjecture

τb(t,p,q,r) =X

n≥0

X

λ`n

tn zλ(1+b)`(λ)

X

δmatching onAn

bϑλ(δ)pλqΛ(ε,δ)rΛ(δλ,δ),

where for every partitionλ`n,ϑλa function on the matchings ofAnwith non-negative integer values, such thatϑλ(δ) =0iffδis a bipartite matching.

b-conjecture (Hypermap-Jack conjecture)

(1+b)t∂

∂t log (τb(t,p,q,r)) = X

M rooted connected

bipartite map

t|M|bϑ(M)pΛ(M)qΛ(M)rΛ(M)

whereϑis a function on connected rooted maps with non-negative integer value, such thatϑ(M) =0iff M is oriented.

(29)

Goulden and Jackson’s conjectures ’96 Matching-Jack conjecture

τb(t,p,q,r) =X

n≥0

X

λ`n

tn zλ(1+b)`(λ)

X

δmatching onAn

bϑλ(δ)pλqΛ(ε,δ)rΛ(δλ,δ),

where for every partitionλ`n,ϑλa function on the matchings ofAnwith non-negative integer values, such thatϑλ(δ) =0iffδis a bipartite matching.

b-conjecture (Hypermap-Jack conjecture)

(1+b)t∂

∂t log (τb(t,p,q,r)) = X

M rooted connected

bipartite map

t|M|bϑ(M)pΛ(M)qΛ(M)rΛ(M)

whereϑis a function on connected rooted maps with non-negative integer value, such thatϑ(M) =0iff M is oriented.

(30)

Some partial results

Theorem (Doł ˛ega-Féray ’15)

The coefficient of p

λ

q

µ

r

ν

in the function τ

b

(t , p, q, r) multiplied by z

λ

(1 + b)

`(λ)

is a polynomial in b with rational coefficients.

Theorem (Doł ˛ega-Féray ’17)

The coefficient of p

λ

q

µ

r

ν

in the function (1+b)

t∂∂t

log (τ

b

(t , p, q, r))

is a polynomial in b with rational coefficients.

(31)

Some partial results

Theorem (Chapuy-Doł ˛ega ’20)

(1+b)t∂

∂t log (τb(t,p,q,u)) = X

M rooted connected

bipartite map

t|M|bϑ(M)pΛqΛ(M)u`(Λ(M))

whereϑis a function on connected rooted maps with non-negative integer value, such thatϑ(M) =0iff M is oriented.

p := (p

1

, p

2

, p

3

, ...),

q := (q

1

, q

2

, q

3

, ...),

u := (u, u, u...).

(32)

Some partial results

Theorem (B.D. ’21, arXiv:2106.15414)

τb(t,p,q,u) =X

n≥0

X

λ`n

tn zλ(1+b)`(λ)

X

δmatching onAn

bϑλ(δ)pλqΛ(ε,δ)u`(Λ(δλ,δ)),

where for every partitionλ`n,ϑλ a function on the matchings ofAn with non-negative integer values, such thatϑλ(δ) =0iffδis a bipartite matching.

p := (p

1

, p

2

, p

3

, ...), q := (q

1

, q

2

, q

3

, ...), u := (u, u, u...).

Remark

All the precedent results can be generalized to the case ofk-constellations.

(33)

Some partial results

Theorem (B.D. ’21, arXiv:2106.15414)

τb(t,p,q,u) =X

n≥0

X

λ`n

tn zλ(1+b)`(λ)

X

δmatching onAn

bϑλ(δ)pλqΛ(ε,δ)u`(Λ(δλ,δ)),

where for every partitionλ`n,ϑλ a function on the matchings ofAn with non-negative integer values, such thatϑλ(δ) =0iffδis a bipartite matching.

p := (p

1

, p

2

, p

3

, ...), q := (q

1

, q

2

, q

3

, ...), u := (u, u, u...).

Remark

All the precedent results can be generalized to the case ofk-constellations.

(34)

Recall:

Theorem (Doł ˛ega-Féray ’15)

The coefficient of p

λ

q

µ

r

ν

in the function τ

b

(t , p, q, r) multiplied by

z

λ

(1 + b)

`(λ)

is a polynomial in b with rational coefficients.

(35)

Recall:

Theorem (Doł ˛ega-Féray ’15)

The coefficient of p

λ

q

µ

r

ν

in the function τ

b

(t , p, q, r) multiplied by z

λ

(1 + b)

`(λ)

is a polynomial in b with rational coefficients.

Upcoming result (joint work with Chapuy and Doł ˛ega):

Theorem

The coefficient of p

λ

q

µ

r

ν

in the function τ

b

(t , p, q, r) multiplied by z

λ

(1 + b)

`(λ)

is a polynomial in b with integer coefficients.

Proof: The integrality of the coefficients τ

b

(t , p, q, u) +

Farahat-Higman Algebra.

参照

関連したドキュメント

Includes some proper curves, contrary to the quasi-Belyi type result.. Sketch of

I The bijection sending the area to the sum of the major and the inverse major index can be generalized to types B and C but fails to exist in type D... Non-crossing and non-nesting

Figure 7: The coding of the boundary of a polyomino, starting from A and moving in a clockwise sense; its salient (resp. reentrant) points are indicated by black (resp. A

This article does not really contain any new results, and it is mostly a re- interpretation of formulas of Cherbonnier-Colmez (for the dual exponential map), and of Benois and

For a white tile in T h (p) (which, obviously, exists), at least one of its bottom and top vertices is terminal (for otherwise all edges of this tile are fully white, implying that

In particular this implies a shorter and much more transparent proof of the combinatorial part of the Mullineux conjecture with additional insights (Section 4). We also note that

Our bound does not prove that every Cayley graph is a ˇ Cerný Cayley graph, but it does work for certain Cayley graphs of cyclic groups, dihedral groups, sym- metric groups,

It is known that if Γ is a (torsion free) discrete group whose classifying space B Γ is a finite CW-complex, the coarse Baum–Connes conjecture for the underlying metric space of