Searcharxiv⌕ Search

arXiv subjects

Zhibek Kadyrsizova

Publications and source records attributed to Zhibek Kadyrsizova.

9 recordsLinked to original sources

Intractability of Learning the Discrete Logarithm with Gradient-Based Methods

The discrete logarithm problem is a fundamental challenge in number theory with significant implications for cryptographic protocols. In this paper, we investigate the limitations of gradient-based methods for learning the parity bit of the discrete logarithm in finite cyclic groups of prime order. Our main result, supported by theoretical analysis and empirical verification, reveals the concentration of the gradient of the loss function around a fixed point, independent of the logarithm's base used. This concentration property leads to a restricted ability to learn the parity bit efficiently using gradient-based methods, irrespective of the complexity of the network architecture being trained. Our proof relies on Boas-Bellman inequality in inner product spaces and it involves establishing approximate orthogonality of discrete logarithm's parity bit functions through the spectral norm of certain matrices. Empirical experiments using a neural network-based approach further verify the limitations of gradient-based learning, demonstrating the decreasing success rate in predicting the parity bit as the group order increases.

cs.LG↗

Lower Bounds on the F-pure Threshold and Extremal Singularities

We prove that if $f$ is a reduced homogenous polynomial of degree $d$, then its $F$-pure threshold at the unique homogeneous maximal ideal is at least $\frac{1}{d-1}$. We show, furthermore, that its $F$-pure threshold equals $\frac{1}{d-1}$ if and only if $f\in \mathfrak m^{[q]}$ and $d=q+1$, where $q$ is a power of $p$. Up to linear changes of coordinates (over a fixed algebraically closed field), we classify such "extremal singularities," and show that there is at most one with isolated singularity. Finally, we indicate several ways in which the projective hypersurfaces defined by such forms are "extremal," for example, in terms of the configurations of lines they can contain.

math.AC↗

Classification of Frobenius Forms in five variables

We classify Frobenius forms, a special class of homogeneous polynomials in characteristic $p>0$, in up to five variables over an algebraically closed field. We also point out some of the similarities with quadratic forms.

math.AC↗

Cubic Surfaces of Characteristic Two

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 cubic surfaces form a linear subspace of codimension four in the 19-dimensional space of all cubics, and that up to projective equivalence, there are finitely many non-Frobenius split cubic surfaces. We explicitly describe defining equations for each and characterize them as extremal in terms of configurations of lines on them. In particular, a (possibly singular) cubic surface in characteristic two fails to be Frobenius split if and only if no three lines on it form a "triangle".

math.AC↗

Algebraic sets defined by the commutator matrix

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 parameters for the coordinate rings of these two sets and their intersection and show that they are complete intersections. Moreover, we prove that these algebraic sets are $F$-pure over a field of positive prime characteristic and the algebraic set of pairs of matrices with the zero diagonal commutator is $F$-regular.

math.AC↗

The TestIdeals package for Macaulay2

This note describes a \emph{Macaulay2} package for computations in prime characteristic commutative algebra. This includes Frobenius powers and roots, $p^{-e}$-linear and $p^{e}$-linear maps, singularities defined in terms of these maps, different types of test ideals and modules, and ideals compatible with a given $p^{-e}$-linear map.

math.AC↗

Nearly Commuting Matrices

We prove that the algebraic set of pairs of matrices with a diagonal commutator over a field of positive prime characteristic, its irreducible components, and their intersection are $F$-pure when the size of matrices is equal to 3. Furthermore, we show that this algebraic set is reduced and the intersection of its irreducible components is irreducible in any characteristic for pairs of matrices of any size. In addition, we discuss various conjectures on the singularities of these algebraic sets and the system of parameters on the corresponding coordinate rings.

math.AC↗

On the behavior of singularities at the $F$-pure threshold

We provide a family of examples where the $F$-pure threshold and the log canonical threshold of a polynomial are different, but where $p$ does not divide the denominator of the $F$-pure threshold (compare with an example of \mustata-Takagi-Watanabe). We then study the $F$-signature function in the case where either the $F$-pure threshold and log canonical threshold coincide or where $p$ does not divide the denominator of the $F$-pure threshold. We show that the $F$-signature function behaves similarly in those two cases. Finally, we include an appendix which shows that the test ideal can still behave in surprising ways even when the $F$-pure threshold and log canonical threshold coincide.

math.AC↗