6 papers
An improvement on the bound for the acyclic chromatic index
Lefteris Kirousis, John Livieratos, Alexandros Singh
The acyclic chromatic index (or acyclic edge-chromatic number) of a graph is the least number of colors needed to properly color its edges so that none of its cycles has only two c…
Pairs of tree dessins, their Shabat polynomials, and monodromy groups
Benjamin Dupont, Revekka Kyriakoglou, Vassilis Metaftsis +2
Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Bely…
Asymptotic Distribution of Parameters in Trivalent Maps and Linear Lambda Terms
Olivier Bodini, Alexandros Singh, Noam Zeilberger
Structural properties of large random maps and lambda-terms may be gleaned by studying the limit distributions of various parameters of interest. In our work we focus on restricted…
Nearest Centroid Classification on a Trapped Ion Quantum Computer
Sonika Johri, Shantanu Debnath, Avinash Mocherla +4
Quantum machine learning has seen considerable theoretical and practical developments in recent years and has become a promising area for finding real world applications of quantum…
Minor-Obstructions for Apex Sub-unicyclic Graphs
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +3
A graph is sub-unicyclic if it contains at most one cycle. We also say that a graph is -apex sub-unicyclic if it can become sub-unicyclic by removing of its vertices. We…
Minor-Obstructions for Apex-Pseudoforests
Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis +2
A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one o…