2 papers
math.CO2024
A Mathon-type construction for digraphs and improved lower bounds for Ramsey numbers
Dermot McCarthy, Chris Monico
We construct an edge-colored digraph analogous to Mathon's construction for undirected graphs. We show that this graph is connected to the -th power Paley digraphs and we use th…
cs.LG2024
An elementary proof of a universal approximation theorem
Chris Monico
In this short note, we give an elementary proof of a universal approximation theorem for neural networks with three hidden layers and increasing, continuous, bounded activation fun…