The Combinatorics of The Arithmetical Structures of The Path

Where our story takes place? The main objective of this talk. Arithmetical structures of the path.
The combinatorics of the

arithmetical structures of the path.
Carlos E. Valencia O.
Departamento de Matemáticas, Cinvestav-IPN and
Instituto de Matemáticas, UNAM.
Montreal, July 28, 2017.
Outline
1 Where our story takes place?
The main character of our history.
What is an arithmetical structure?
2 The main objective of this talk.
Characterize, classify and count (C = c 3 ).
3 Arithmetical structures of the path.
Characterization using edge subdivision.
Let’s count.
Ballot numbers and lattice paths.
The Catalan’s triangle.
Arithmetical structures and the polygon triangulations.
Where our story takes place?
Arithmetical structures of a graph were introduced by Lorenzini

in 1989 in his paper
“Arithmetical Graphs”
as some intersection matrices that arise in the study of

degenerating curves in algebraic geometry. He also introduces
the group of components, which is equivalent to the critical
group.
Consider the negative of the adjacency matrix of a graph G
v1
 
0 −1 0 0 −1
v2 v5  −1 0 −1 0 −1 
G
 
−A(G) = 
 0 −1 0 −1 0 

 0 0 −1 0 −1 
v3 v4 −1 −1 0 −1 0
Consider the negative of the adjacency matrix of a graph G
v1
 
0 −1 0 0 −1
v2 v5  −1 0 −1 0 −1 
G
 
−A(G) = 
 0 −1 0 −1 0 

 0 0 −1 0 −1 
v3 v4 −1 −1 0 −1 0
Is an integer matrix, with its diagonal entries equal to zero and

non-positive entries out of its diagonal.
Is a particular case of a Z -matrix.

If we put the degree of each vertex in its corresponding

diagonal entry we get the Laplacian Matrix of G.
v1
 
2 −1 0 0 −1
v2 v5  −1 3 −1 0 −1 
G
 
L(G) = 
 0 −1 2 −1 0 

 0 0 −1 2 −1 
v3 v4 −1 −1 0 −1 3

v1
 
2 −1 0 0 −1
v2 v5  −1 3 −1 0 −1 
G
 
L(G) = 
 0 −1 2 −1 0 

 0 0 −1 2 −1 
v3 v4 −1 −1 0 −1 3
What else can we put in the diagonal that behaves like the
Laplacian matrix?

v1
 
2 −1 0 0 −1
v2 v5  −1 3 −1 0 −1 
G
 
L(G) = 
 0 −1 2 −1 0 

 0 0 −1 2 −1 
v3 v4 −1 −1 0 −1 3
What else can we put in the diagonal that behaves like the
Laplacian matrix?
Arithmetical structures of a graph generalizes the Laplacian
matrix of a graph.
Arithmetical structures of a graph.
Definition
Given a connected graph G = (V , E), an arithmetical structure
of G is a pair (d, r) ∈ NV+ × NV+ such that gcd(rv | v ∈ V ) = 1 and
L(G, d)rt = 0t ,
where L(G, d) = diag(d) − A(G) is called a pseudo-Laplacian

matrix.
A non-canonical example.
Consider G with d = (4, 2, 5, 1, 3) and r = (1, 2, 1, 3, 2).

Example
v1
 
 
4 −1 0 0 −1 1
v2 v5  −1 2 −1 0 −1 
 2 
G
 
 
L(G, d)r =
 0 −1 5 −1 0 


 1 = 0.

 0 0 −1 1 −1 
 3 
v3 v4 −1 −1 0 −1 3 2
The main objective of this talk.
The main objective of this talk is to understand the arithmetical

structures of the path.
The main objective of this talk.
The main objective of this talk is to understand the arithmetical

structures of the path.
That is: characterize, classify and count it (C = c 3 ).

Finiteness
Lorenzini proved that a connected graph has a finite number of
arithmetical structures.
Finiteness
Actually this can be generalized to the setting of M-matrices.

Finiteness
Actually this can be generalized to the setting of M-matrices.
Theorem
If M is a non-negative matrix, then M is almost non-singular
M-matrix with det(M) = 0 if and only if M is an irreducible and
there exists r > 0 such that Mrt = 0t .
Finiteness
Theorem
If M is a non-negative matrix with all the diagonal entries equal
to zero, then A(M) 6= ∅. Even more, A(M) is finite if and only if
M is irreducible.
Finiteness
Theorem
If M is a non-negative matrix with all the diagonal entries equal
to zero, then A(M) 6= ∅. Even more, A(M) is finite if and only if
M is irreducible.
Essentially Dickson’s Lemma.
Moral: The concept of integer almost

non-singular M-matrix is equivalent to
arithmetical structure concept.
Subdivision of an edge.
Given an edge e = uv of a graph G, the subdivision of e in G is

the graph G
e obtained by replacing the edge uv with the path
uwv where w is a new vertex.

the graph G
u v u w v
=⇒

the graph G
u v u w v
=⇒
The complexity of the arithmetical structures of a graph can

handle for the subdivision of an edge.
Arithmetical structures of the path.

The path with n vertices Pn can be obtained from one edge by
successive subdivisions.
Arithmetical structures of the path.

The path with n vertices Pn can be obtained from one edge by
successive subdivisions.
Theorem
If (d, r) is an arithmetical structure of Pn for n ≥ 3 and
d 6= (1, 2, . . . , 2, 1), then there exists a non-terminal vertex v of
Pn such that
dv = 1 and du > 1 for all u ∈ NPn (v ).
Moreover, any arithmetical structure (d, r) of Pn different from

the canonical can be obtained from an arithmetical structure of
Pn−1 by subdividing an edge.
The d vector of an edge subdivision.

Example
Let P5 be the path with its vertices labeled by 1, 2, 3, 4, 5. We
begin with the canonical arithmetical structure d0 = (1, 1) of P2 .
1 1

Example
1 1
2 1 2

Example
1 1
2 1 2
3 1 2 2

Example
1 1
2 1 2
3 1 2 2
4 1 2 2 2

Example
1 1
2 1 2
3 1 2 2
4 1 2 2 2
P5 is obtained from P2 by doing three edge subdivisions.
The r vector of an edge subdivision.
Example
Let P5 be the path with its vertices labeled by 1, 2, 3, 4, 5. Begin
with the canonical arithmetical structure r0 = (1, 1).
1 1
Example
1 1
1 2 1
Example
1 1
1 2 1
1 3 2 1
Example
1 1
1 2 1
1 3 2 1
1 4 3 2 1
n=2 n=3 n=4 n=5

(1, 1) (1, 2, 1) (1, 3, 2, 1) (1, 4, 3, 2, 1)
1 (1, 1, 1) (1, 2, 3, 1) (1, 3, 5, 2, 1)
2 (1, 2, 1, 1) (1, 3, 2, 3, 1) 5
(1, 1, 2, 1) (1, 2, 3, 4, 1)
(1, 1, 1, 1) (1, 2, 5, 3, 1)
5 (1, 3, 2, 1, 1)
(1, 2, 3, 1, 1)
(1, 2, 1, 2, 1) 5
(1, 1, 2, 3, 1)
(1, 1, 3, 2, 1)
(1, 2, 1, 1, 1)
(1, 1, 2, 1, 1) 3
(1, 1, 1, 2, 1)
(1, 1, 1, 1, 1) 1
14
Ballot numbers.
Consider the sequence of positive integers
1 ≤ c1 ≤ c2 ≤ · · · ≤ cn
such that ci ≤ i for all i = 1, . . . , n. Let Cn,k be the number of

this sequences that finish in k .
Ballot numbers.
Consider the sequence of positive integers
1 ≤ c1 ≤ c2 ≤ · · · ≤ cn
such that ci ≤ i for all i = 1, . . . , n. Let Cn,k be the number of

this sequences that finish in k .
Is not difficult to see that

n−k +1 n+k
Cn,k =
n+1 k
and these numbers are called the Ballot numbers.

C0,∗ : 1
C1,∗ : 1 1
C2,∗ : 1 2 2
C3,∗ : 1 3 5 5
C4,∗ : 1 4 9 14 14
Cn,0 = 1 for n ≥ 0,
Cn,1 = n for n ≥ 1,
Cn+1,k = Cn+1,k−1 + Cn,k for 1 < k < n + 1,
Cn+1,n+1 = Cn+1,n = Cn for n ≥ 1.
C0,∗ : 1
C1,∗ : 1 1
C2,∗ : 1 2 2
C3,∗ : 1 3 5 5
C4,∗ : 1 4 9 14 14
Cn,0 = 1 for n ≥ 0,
Cn,1 = n for n ≥ 1,
Cn+1,k = Cn+1,k−1 + Cn,k for 1 < k < n + 1,
Cn+1,n+1 = Cn+1,n = Cn for n ≥ 1.
C0,∗ : 1
C1,∗ : 1 1
C2,∗ : 1 2 2
C3,∗ : 1 3 5 5
C4,∗ : 1 4 9 14 14
Cn,0 = 1 for n ≥ 0,
Cn,1 = n for n ≥ 1,
Cn+1,k = Cn+1,k−1 + Cn,k for 1 < k < n + 1,
Cn+1,n+1 = Cn+1,n = Cn for n ≥ 1.
C0,∗ : 1
C1,∗ : 1 1
C2,∗ : 1 2 2
C3,∗ : 1 3 5 5
C4,∗ : 1 4 9 14 14
Cn,0 = 1 for n ≥ 0,
Cn,1 = n for n ≥ 1,
Cn+1,k = Cn+1,k−1 + Cn,k for 1 < k < n + 1,
Cn+1,n+1 = Cn+1,n = Cn for n ≥ 1.

The arithmetical structures of P5 that come from P2
1 1
are in correspondence with the sequences

(1, 1, 1), (1, 1, 2), (1, 1, 3), (1, 2, 2), (1, 2, 3).

1 1

(1, 1, 1), (1, 1, 2), (1, 1, 3), (1, 2, 2), (1, 2, 3).

1 1 1

(1, 1, 1), (1, 1, 2), (1, 1, 3), (1, 2, 2), (1, 2, 3).
1 1 1 1
(1, 1, 1), (1, 1, 2), (1, 1, 3).

Ballot numbers and lattice paths.

Example
Consider the ballot sequence b = (1, 1, 2, 4) whose associated
lattice path is given by L. Reflecting the lattice path L we get the
lattice path L0 , which is in correspondence to the ballot
sequence b0 = (1, 2, 2, 3).
=⇒
Let’s count.
Pn−1
1 1 Cn−1,n−1 = k=1 Cn−2,k
Let’s count.
Pn−1
1 1 Cn−1,n−1 = k=1 Cn−2,k
Pn−2
1 2 1 Cn−1,n−2 = k=1 Cn−2,k
Let’s count.
Pn−1
1 1 Cn−1,n−1 = k=1 Cn−2,k
Pn−2
1 2 1 Cn−1,n−2 = k=1 Cn−2,k
Pn−3
1 2 2 1 Cn−1,n−3 = k=1 Cn−2,k
Let’s count.
Pn−1
1 1 Cn−1,n−1 = k=1 Cn−2,k
Pn−2
1 2 1 Cn−1,n−2 = k=1 Cn−2,k
Pn−3
1 2 2 1 Cn−1,n−3 = k=1 Cn−2,k
Pn−4
1 2 2 2 1 Cn−1,n−4 = k=1 Cn−2,k
The number of arithmetical structures of the path
Theorem
The number of arithmetical structures of the path Pn+1 is equal
to the Catalan number

1 2n
Cn = .
n+1 n
d r
1 (4, 1, 2, 2, 2), (1, 4, 3, 2, 1)
(3, 2, 1, 3, 2), (1, 3, 5, 2, 1)
3 (3, 1, 3, 1, 3), (1, 3, 2, 3, 1)
(3, 1, 2, 3, 1), (1, 3, 2, 1, 1)
(2, 3, 1, 2, 3), (1, 2, 5, 3, 1)
(2, 2, 2, 1, 4), (1, 2, 3, 4, 1)
5 (2, 2, 1, 4, 1), (1, 2, 3, 1, 1)
(2, 1, 4, 1, 2), (1, 2, 1, 2, 1)
(2, 1, 3, 2, 1), (1, 2, 1, 1, 1)
(1, 4, 1, 2, 2), (1, 1, 3, 2, 1)
(1, 3, 2, 1, 3), (1, 1, 2, 3, 1)
5 (1, 3, 1, 3, 1), (1, 1, 2, 1, 1)
(1, 2, 3, 1, 2), (1, 1, 1, 2, 1)
(1, 2, 2, 2, 1), (1, 1, 1, 1, 1)
The number of arithmetical structures of the path
Theorem
If n ≥ 0, 1 ≤ i ≤ n + 2, 1 ≤ d ≤ n + 1, then
di (Pn+2 , d) := #{(d, r) ∈ Arith(Pn+2 ) | di = d} = Cn+1,n−d .


v3
|d0 | = 3 · 3
v4 v2 d0 = (3, 1, 2, 2, 1)
7→ | {z }
d
v0 v1

v3
|d0 | = 3 · 3
v4 v2 d0 = (3, 1, 2, 2, 1)
7→ | {z }
d
v0 v1
v3
|d0 | = 3 · 3
v4 v2 d0 = (1, 3, 1, 2, 2)
7→ | {z }
d
v0 v1

v3
|d0 | = 3 · 3
v4 v2 d0 = (3, 1, 2, 2, 1)
7→ | {z }
d
v0 v1
v3
|d0 | = 3 · 3
v4 v2 d0 = (1, 3, 1, 2, 2)
7→ | {z }
d
v0 v1 Cyclic Sieving !!!!!!

v4
1
2
7→ ()
v0 0 v1
(1, 1, 1)
v3
v4
1
2
v0 v1
7→ (1)
0
(1, 2, 1, 2)
v3
2
v4 1
v0 v1
7→ (1)
0
(1, 2, 1, 2)
v3
2
v4 1 v2
v0 0 v1 7→ (1, 1)
(1, 3, 1, 2, 2)
v3
v4 v2
v0 v1 7→ (1, 1)
(1, 3, 1, 2, 2)
Bibliography
D. J. Lorenzini, Arithmetical graphs. Math. Ann. 285

(1989), no. 3, 481-501.
H. Corrales and C. E. Valencia, Arithmetical structures of
graphs, arXiv:1604.02502.
C. E. Valencia et al., Counting arithmetical structures on
paths and cycles, arXiv:1701.06377
Gracias for listening!!!
http://www.math.cinvestav.mx/cvalencia

The Combinatorics of The Arithmetical Structures of The Path

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

The Combinatorics of The Arithmetical Structures of The Path

Uploaded by

Copyright:

Available Formats

Where our story takes place? The main objective of this talk. Arithmetical structures of the path.

The combinatorics of the

Where our story takes place?

Arithmetical structures of a graph were introduced by Lorenzini

as some intersection matrices that arise in the study of

The main character of our history.

Consider the negative of the adjacency matrix of a graph G

The main character of our history.

Consider the negative of the adjacency matrix of a graph G

Is an integer matrix, with its diagonal entries equal to zero and

Is a particular case of a Z -matrix.

The main character of our history.

If we put the degree of each vertex in its corresponding

The main character of our history.

If we put the degree of each vertex in its corresponding

The main character of our history.

If we put the degree of each vertex in its corresponding

Arithmetical structures of a graph.

where L(G, d) = diag(d) − A(G) is called a pseudo-Laplacian

Consider G with d = (4, 2, 5, 1, 3) and r = (1, 2, 1, 3, 2).

The main objective of this talk.

The main objective of this talk is to understand the arithmetical

The main objective of this talk.

The main objective of this talk is to understand the arithmetical

That is: characterize, classify and count it (C = c 3 ).

Actually this can be generalized to the setting of M-matrices.

Actually this can be generalized to the setting of M-matrices.

Moral: The concept of integer almost

Given an edge e = uv of a graph G, the subdivision of e in G is

Given an edge e = uv of a graph G, the subdivision of e in G is

Given an edge e = uv of a graph G, the subdivision of e in G is

The complexity of the arithmetical structures of a graph can

Arithmetical structures of the path.

Arithmetical structures of the path.

dv = 1 and du > 1 for all u ∈ NPn (v ).

Moreover, any arithmetical structure (d, r) of Pn different from

The d vector of an edge subdivision.

The d vector of an edge subdivision.

The d vector of an edge subdivision.

The d vector of an edge subdivision.

The d vector of an edge subdivision.

The r vector of an edge subdivision.

The r vector of an edge subdivision.

The r vector of an edge subdivision.

The r vector of an edge subdivision.

n=2 n=3 n=4 n=5

Consider the sequence of positive integers

such that ci ≤ i for all i = 1, . . . , n. Let Cn,k be the number of

Consider the sequence of positive integers

such that ci ≤ i for all i = 1, . . . , n. Let Cn,k be the number of

and these numbers are called the Ballot numbers.

The Catalan’s triangle.

The Catalan’s triangle.

The Catalan’s triangle.

The Catalan’s triangle.

The r vector of an edge subdivision.

are in correspondence with the sequences

The r vector of an edge subdivision.

are in correspondence with the sequences

The arithmetical structures of P5 that come from P3

are in correspondence with the sequences

The r vector of an edge subdivision.

The arithmetical structures of P5 that come from P4