activity
19992023
most citedImproved bounds for the crossing numbers of K_m,n and K_n

66 citations · 448 across the 34 of their papers we have counts for

collaborators

35 papers

math.CO2023

On hyperovals in

Dmitrii V. Pasechnik

According to a computer search conducted by the author and described in [7], in there are two types of hyperovals, having 72 and 96 points, respectively. Here we give g…

math.CO2023

Implementing Hadamard Matrices in SageMath

Matteo Cati, Dmitrii V. Pasechnik

Hadamard matrices are square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order exist whenever is , , o…

math.RT2021

Splitting fields of real irreducible representations of finite groups

Dmitrii V. Pasechnik

We show that any irreducible representation of a finite group of exponent , realisable over , is realisable over the field …

math.GR2020

Decomposing Linear Representations of Finite Groups

Kaashif Hymabaccus, Dmitrii Pasechnik

We develop a package using the computer algebra system GAP for computing the decomposition of a representation of a finite group over into irreducibles, as wel…

math.GR2016

Locally toroidal polytopes of rank 6 and sporadic groups

Dmitrii V. Pasechnik

We augment the list of finite universal locally toroidal regular polytopes of type {3,3,4,3,3} due to P.McMullen and E.Schulte, adding as well as removing entries. This disproves a…

math.CO2016★ 2 cited

Random Chain Complexes

Viktor L. Ginzburg, Dmitrii V. Pasechnik

We study random, finite-dimensional, ungraded chain complexes over a finite field and show that for a uniformly distributed differential a complex has the smallest possible homolog…