Related papers: The Discrete Logarithm Problem in Bergman's non-re…

We consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…

We consider the {\it noisy polynomial interpolation problem\/} of recovering an unknown $s$-sparse polynomial $f(X)$ over the ring $\mathbb Z_{p^k}$ of residues modulo $p^k$, where $p$ is a small prime and $k$ is a large integer parameter,…

The Lagrange problem is established in the discrete field theory subject to constraints with values in a Lie group. For the admissible sections that satisfy a certain regularity condition, we prove that the critical sections of such…

In recent years, centrally essential rings have been intensively studied in ring theory. In particular, they find applications in homological algebra, group rings, and the structural theory of rings. The class of essentially central rings…

We consider the Grothendieck ring of the fusion algebra of the W-extended logarithmic minimal model WLM(1,p). Informally, this is the fusion ring of W-irreducible characters so it is blind to the Jordan block structures associated with…

Let exp(x) be the function determined by the classical power series of the exponentiation. Then E_p(x):=exp(px) is well-defined on Zp, the ring of p-adic integer (for p not equal to 2, we set E_2(x)=exp(4x)). Furthermore, E_p determines a…

We classify, up to isomorphism, the $\mathbb{Z}_pG$-modules of rank $1$ (i.e., the quotients of $\mathbb{Z}_pG$) for $G$ cyclic of order $p$, where $\mathbb{Z}_p$ is the ring of $p$-adic integers. This allows us in particular to determine…

In this paper, we have studied on adapting to asymmetric cryptography power Fibonacci sequence module m . To do this, We have restructed Discreate Logarithm Problem which is one of mathematical difficult problems by using power Fibonacci…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…

The pentagram map is a discrete dynamical system on planar polygons. By definition, the image of a polygon $P$ under the pentagram map is the polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$.…

Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period $4p$ with optimal autocorrelation was proposed…

This paper introduces and studies a new class of rings called {\it $U\sqrt{\Delta}$-rings}. A ring $R$ is $U\sqrt{\Delta}$ if every non-unit element can be written as the product of a unit and an element from $\sqrt{\Delta(R)}$, where…

In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…

Let $p$ be a prime number, $k$ an algebraically closed field of characteristic $p$, $\tilde{G}$ a finite group, and $G$ a normal subgroup of $\tilde{G}$ having a $p$-power index in $\tilde{G}$. Moreover let $B$ be a block of $kG$ with a…

Let $\mathbb{Z}^{ab}$ be the ring of integers of $\mathbb{Q}^{ab}$, the maximal abelian extension of $\mathbb{Q}$. We show that there exists an algorithm to decide whether a system of equations and inequations, with integer coefficients,…

We study risk-sensitive reinforcement learning (RL) based on the entropic risk measure. Although existing works have established non-asymptotic regret guarantees for this problem, they leave open an exponential gap between the upper and…

Brizolis asked the question: does every prime p have a pair (g,h) such that h is a fixed point for the discrete logarithm with base g? The author and Pieter Moree, building on work of Zhang, Cobeli, and Zaharescu, gave heuristics for…

Motivated by recent problems regarding the symmetry of Hecke algebras, we investigate the symmetry of the endomorphism algebra $E_P(M)$ for $P$ a $p$-group and $M$ a $kP$-module with $k$ a field of characteristic $p$. We provide a complete…

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…