6 citations · 15 across the 11 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
A note on the diameter of graphs of two-dimensional simplex codes
Artur Siemaszko
Let be the graph induced in the Grassmann graph by the -ary simplex codes of dimension 2. For , this graph is known to have diameter 3. We prove that the same di…
math.NT2026
An incremental approximation to the prime-counting function via polygonal numbers
Artur Samojluk, Artur Siemaszko
We construct an incremental prime-counting approximation from corrected right-endpoint sums on polygonal-number partitions. For each fixed polygonal family, retaining completed con…