Charles Gong - cp's OEIS frontend

User: Charles Gong

Charles Gong has authored 2 sequences.

A363894 Number of weakly connected components of a halved addsub configuration graph with respect to integers mod n over a path with two vertices.

1, 2, 1, 8, 2, 3, 1, 5, 8, 4, 2, 18, 3, 33, 1, 19, 5, 6, 8, 20, 4, 7, 2, 39, 18, 14, 3, 32, 33, 25, 1, 29, 19, 58, 5, 42, 6, 75, 8, 91, 20, 34, 4, 108, 7, 13, 2, 17, 39, 164, 18, 58, 14, 83, 3, 47, 32, 16, 33, 66, 25, 167, 1, 365, 29, 18, 19, 56, 58, 19, 5

Offset: 2

Patrick G. Cesarz, Eugene Fiorini, Charles Gong, Kyle A. Kelley, Philip Thomas, and Andrew Woldar, Jul 23 2023

nonn

The addsub game is played on a path with two vertices {u,v}. We define a configuration of the integers mod n on {u,v} by assigning weights wt(u) and wt(v).
An addsub move from u to v is a reassignment of weights given by wt(u) -> wt(u) - wt(v) (mod n) and wt(v) -> wt(u) + wt(v) (mod n). An addsub move from v to u (i.e. the backward move) is defined analogously.
The halved addsub configuration graph is the directed subgraph of the addsub configuration graph restricted to the forward move only: wt(u) -> wt(u) - wt(v) (mod n) and wt(v) -> wt(u) + wt(v) (mod n).

E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways for Your Mathematical Plays, Vol. 1, CRC Press, 2001.

E. Fiorini, M. Lind, A. Woldar, and T. W. H. Wong, Characterizing Winning Positions in the Impartial Two-player Pebbling Game on Complete Graphs, Journal of Integer Sequences, 24(6) (2021).
E. Fiorini, M. Lind, and A. Woldar, On Properties of Pebble Assignment Graphs, Graphs and Combinatorics, 38(2) (2022), 45.
E. Fiorini, G. Johnston, M. Lind, A. Woldar, and T. W. H. Wong, Cycles and Girth in Pebble Assignment Graphs, Graphs and Combinatorics, 38(5) (2022), 154.

Cf. A340631, A346197, A346401, A363893.

Upto=25;
Table[
  VertexSet:={};
  EdgeSet:={};
  (* Compute configuration graph for integers mod n *)
  Do[
    Do[AppendTo[VertexSet,{i,j}];
      AppendTo[EdgeSet,{i,j}\[DirectedEdge]{Mod[i-j,n],Mod[i+j,n]}],
      {j,0,n-1}],
    {i,0,n-1}];
  (* Print n-th term *)
  Length[WeaklyConnectedComponents[Graph[VertexSet,EdgeSet]]],
  {n,2,Upto}]

A363893 Number of weakly connected components of an addsub configuration graph with respect to integers mod n over a path with two vertices.

Original entry on oeis.org

1, 2, 1, 4, 2, 3, 1, 5, 4, 4, 2, 6, 3, 11, 1, 11, 5, 6, 4, 12, 4, 7, 2, 13, 6, 14, 3, 10, 11, 25, 1, 29, 11, 18, 5, 12, 6, 21, 4, 25, 12, 34, 4, 32, 7, 13, 2, 17, 13, 48, 6, 16, 14, 25, 3, 47, 10, 16, 11, 18, 25, 87, 1, 95, 29, 18, 11, 32, 18, 19, 5

Offset: 2

Patrick G. Cesarz, Eugene Fiorini, Charles Gong, Kyle A. Kelley, Philip Thomas, and Andrew Woldar, Jun 26 2023

nonn

The addsub game is played on a path with two vertices {u,v}. We define a configuration of the integers mod n on {u,v} by assigning weights wt(u) and wt(v).
An addsub move from u to v is a reassignment of weights given by wt(u) -> wt(u) - wt(v) (mod n) and wt(v) -> wt(u) + wt(v) (mod n). An addsub move from v to u is defined analogously.
The addsub configuration graph with respect to the integers mod n over {u,v} is the directed graph in which each node corresponds to a configuration (wt(u),wt(v)) and a directed edge from a configuration to the resulting configuration is attainable via a single addsub move.

			For n=3, the (u,v) sequence of addsub moves forms the directed cycle (0,1)->(2,1)->(1,0)->(1,1)->(0,2)->(1,2)->(2,0)->(2,2)->(0,1). The (v,u) sequence of addsub moves forms the directed cycle (0,1)->(1,1)->(2,0)->(2,1)->(0,2)->(2,2)->(1,0)->(1,2)->(0,1). These two directed cycles form one weakly connected component. The isolated vertex (0,0) is a loop and forms the second weakly connected component. Therefore, a(3)=2.

E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways for Your Mathematical Plays, Vol. 1, CRC Press, 2001.

E. Fiorini, M. Lind, A. Woldar, and T. W. H. Wong, Characterizing Winning Positions in the Impartial Two-player Pebbling Game on Complete Graphs, Journal of Integer Sequences, 24(6) (2021).
E. Fiorini, M. Lind, and A. Woldar, On Properties of Pebble Assignment Graphs, Graphs and Combinatorics, 38(2) (2022), 45.
E. Fiorini, G. Johnston, M. Lind, A. Woldar, and T. W. H. Wong, Cycles and Girth in Pebble Assignment Graphs, Graphs and Combinatorics, 38(5) (2022), 154.

Cf. A340631, A346197, A346401.

Upto=25;
Table[
  VertexSet:={};
  EdgeSet:={};
  (* Compute configuration graph for integers mod n *)
  Do[
    Do[AppendTo[VertexSet,{i,j}];
      AppendTo[EdgeSet,{i,j}\[DirectedEdge]{Mod[i-j,n],Mod[i+j,n]}];
      AppendTo[EdgeSet,{i,j}\[DirectedEdge]{Mod[j+i,n],Mod[j-i,n]}],
      {j,0,n-1}],
    {i,0,n-1}];
  (* Print n-th term *)
  Length[WeaklyConnectedComponents[Graph[VertexSet,EdgeSet]]],
  {n,2,Upto}]

cp's OEIS Frontend

User: Charles Gong

A363894 Number of weakly connected components of a halved addsub configuration graph with respect to integers mod n over a path with two vertices.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica