S. Yurkevich

activity

20202022

collaborators

5 papers

math.CO2022

The art of algorithmic guessing in $gfun$

Sergey Yurkevich

The technique of guessing can be very fruitful when dealing with sequences which arise in practice. This holds true especially when guessing is performed algorithmically and effici…

math.CA2021

A hypergeometric proof that $Iso$ is bijective

Alin Bostan, Sergey Yurkevich

We provide a short and elementary proof of the main technical result of the recent article "On the uniqueness of Clifford torus with prescribed isoperimetric ratio" by Thomas Yu an…

cs.SC2020

Fast Computation of the $N$ -th Term of a $q$ -Holonomic Sequence and Applications

Alin Bostan, Sergey Yurkevich

In 1977, Strassen invented a famous baby-step/giant-step algorithm that computes the factorial $N!$ in arithmetic complexity quasi-linear in $N$ . In 1988, the Chudnovsky bro…

math.AC2020

Diagonal Representation of Algebraic Power Series: A Glimpse Behind the Scenes

Sergey Yurkevich

There are many viewpoints on algebraic power series, ranging from the abstract ring-theoretic notion of Henselization to the very explicit perspective as diagonals of certain ratio…

math.AC2020

On the First Fundamental Theorem for $GL_{2} (K)$ and $SL_{2} (K)$

Hana Melanova, Sergey Yurkevich

The First Fundamental Theorem of Invariant Theory describes a minimal generating set of the invariant polynomial ring under the action of some group $G$ . In this note we give an el…

The art of algorithmic guessing in gfun

A hypergeometric proof that Iso is bijective

Fast Computation of the N-th Term of a q-Holonomic Sequence and Applications

Diagonal Representation of Algebraic Power Series: A Glimpse Behind the Scenes

On the First Fundamental Theorem for GL2​(K) and SL2​(K)

The art of algorithmic guessing in $gfun$

A hypergeometric proof that $Iso$ is bijective

Fast Computation of the $N$ -th Term of a $q$ -Holonomic Sequence and Applications

On the First Fundamental Theorem for $GL_{2} (K)$ and $SL_{2} (K)$