activity
20172023
most citedIntractability of Learning the Discrete Logarithm with Gradient-Based Methods

1 citations · 1 across the 1 of their papers we have counts for

collaborators

8 papers

cs.LG2023★ 1 cited

Intractability of Learning the Discrete Logarithm with Gradient-Based Methods

Rustem Takhanov, Maxat Tezekbayev, Artur Pak +3

The discrete logarithm problem is a fundamental challenge in number theory with significant implications for cryptographic protocols. In this paper, we investigate the limitations…

math.AC2021

Classification of Frobenius Forms in five variables

Zhibek Kadyrsizova, Janet Page, Jyoti Singh +3

We classify Frobenius forms, a special class of homogeneous polynomials in characteristic , in up to five variables over an algebraically closed field. We also point out some…

math.AC2020

Lower Bounds on the F-pure Threshold and Extremal Singularities

Zhibek Kadyrsizova, Jennifer Kenkel, Janet Page +4

We prove that if is a reduced homogenous polynomial of degree , then its -pure threshold at the unique homogeneous maximal ideal is at least . We show, fur…

math.AC2020

Cubic Surfaces of Characteristic Two

Zhibek Kadyrsizova, Jennifer Kenkel, Janet Page +4

Cubic surfaces in characteristic two are investigated from the point of view of prime characteristic commutative algebra. In particular, we prove that, the non-Frobenius split cubi…

math.AC2020

Algebraic sets defined by the commutator matrix

Zhibek Kadyrsizova, Madi Yerlanov

In this paper we study algebraic sets of pairs of matrices defined by the vanishing of either the diagonal of their commutator matrix or its anti-diagonal. We find a system of para…

math.AC2019

The variety defined by the matrix of diagonals is -pure

Zhibek Kadyrsizova

We prove that the variety defined by the determinant of the matrix of diagonals is -pure for matrices of all sizes and in all positive prime characteristics. Moreover, we find a…