J. Vidali

collaborators

5 papers

math.CO2019

On few-class $Q$ -polynomial association schemes: feasible parameters and nonexistence results

Alexander L. Gavrilyuk, Janoš Vidali, Jason S. Williford

We present the tables of feasible parameters of primitive $3$ -class $Q$ -polynomial association schemes and $4$ - and $5$ -class $Q$ -bipartite association schemes (on up to $2800$ , $1…

math.CO2018

DiscreteZOO: a Fingerprint Database of Discrete Objects

Katja Berčič, Janoš Vidali

In this paper, we present DiscreteZOO, a project which illustrates some of the possibilities for computer-supported management of collections of finite combinatorial (discrete) obj…

math.CO2018

On tight $4$ -designs in Hamming association schemes

Alexander Gavrilyuk, Sho Suda, Janoš Vidali

We complete the classification of tight $4$ -designs in Hamming association schemes $H (n, q)$ , i.e., that of tight orthogonal arrays of strength $4$ , which had been open since a resu…

math.CO2018

Using symbolic computation to prove nonexistence of distance-regular graphs

Janoš Vidali

A package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular graph. We use this tool to show that there…

math.CO2018

Girth-regular graphs

Primož Potočnik, Janoš Vidali

We introduce a notion of a girth-regular graph as a $k$ -regular graph for which there exists a non-descending sequence $(a_{1}, a_{2}, \dots, a_{k})$ (called the signature) giving, for e…

On few-class Q-polynomial association schemes: feasible parameters and nonexistence results

DiscreteZOO: a Fingerprint Database of Discrete Objects

On tight 4-designs in Hamming association schemes

Using symbolic computation to prove nonexistence of distance-regular graphs

Girth-regular graphs

On few-class $Q$ -polynomial association schemes: feasible parameters and nonexistence results

On tight $4$ -designs in Hamming association schemes