I. Pak

activity

20022023

most citedThe Kauffman bracket of virtual links and the Bollobás-Riordan polynomial

54 citations · 164 across the 29 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015★ 11 cited

On Higman's $k (U_{n} (F_{q}))$ conjecture

Igor Pak, Andrew Soffer

A classical conjecture by Graham Higman states that the number of conjugacy classes of $U_{n} (q)$ , the group of upper triangular $n \times n$ matrices over $F_{q}$ , is polynomi…

math.CO2015★ 14 cited

Pattern avoidance is not P-recursive

Scott Garrabrant, Igor Pak

Let $F \subset S_{k}$ be a finite set of permutations and let $C_{n} (F)$ denote the number of permutations $σ$ in $S_{n}$ avoiding the set of patterns $F$ . The Noonan-Zeilberger conjectu…

math.CO2015★ 2 cited

Words in Linear Groups, Random Walks, Automata and P-Recursiveness

Scott Garrabrant, Igor Pak

Fix a finite set $S \subset G L (k, Z)$ . Denote by $a_{n}$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence ${a_{n}}$ is…

On Higman's k(Un​(Fq​)) conjecture

Pattern avoidance is not P-recursive

Words in Linear Groups, Random Walks, Automata and P-Recursiveness

On Higman's $k (U_{n} (F_{q}))$ conjecture