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

In 1958 E. Lehmer found an explicit description of those primes p for which a given prime q is a cubic residue. In this paper we demonstrate that a similar result may be obtained for cubic nonresidues, yielding a cubic character for fixed p…

Siegel defined in 1929 two classes of power series, the E-functions and G-functions, which generalize the Diophantine properties of the exponential and logarithmic functions respectively. In 1949, he asked whether any E-function can be…

Group-based cryptography is a relatively unexplored family in post-quantum cryptography, and the so-called Semidirect Discrete Logarithm Problem (SDLP) is one of its most central problems. However, the complexity of SDLP and its…

During the 2004-2005 academic year the VIGRE algebra research group at the University of Georgia computed the complexities of certain Specht modules S^\lambda for the symmetric group, using the computer algebra program Magma. The complexity…

In this paper we present the experimental results that more clearly than any theory suggest an answer to the question: when in detection of large (probably) prime numbers to apply, a very resource demanding, Miller-Rabin algorithm. Or, to…

Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that…

We investigate the parameterized complexity of Maximum Exposure Problem (MEP). Given a range space (R, P) where R is the set of ranges containing a set P of points, and an integer k, MEP asks for k ranges which on removal results in the…

Let k>1 be an integer and let p be a prime. We show that if $p^a\le k<2p^a$ or $k=p^aq+1$ (with 2q<p) for some a=1,2,..., then the set {\binom{n}{k}: n=0,1,2,...} is dense in the ring Z_p of p-adic integers, i.e., it contains a complete…

In this survey we investigate the application of the Adleman-Lipton model on Rural Postman problem, which given an undirected graph $G=(V,E)$ with positive integer lengths on each of its edges and a subset $E^{'}\subseteq E$, asks whether…

Discrete Lotka-Volterra equation over $p$-adic space was constructed since $p$-adic space is a prototype of spaces with the non-Archimedean valuations and the space given by taking ultra-discrete limit studied in soliton theory should be…

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

This paper presents a discrete-time nonlinear system identification method while satisfying the stability and safety properties of the system with high probability. An Extreme Learning Machine (ELM) is used with a Gaussian assumption on the…

We perform a special number field sieve discrete logarithm computation in a 1024-bit prime field. To our knowledge, this is the first kilobit-sized discrete logarithm computation ever reported for prime fields. This computation took a…

We initiate a study of the rings of invariants of modular representations of elementary abelian p-groups. With a few notable exceptions, the modular representation theory of an elementary abelian p-group is wild. However, for a given…

We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…

The present paper studies Hecke rings derived by the automorphism groups of certain algebras $L_p$ over the ring of $p$-adic integers. Our previous work considered the case where $L_p$ is the Heisenberg Lie algebra (of dimension 3) over the…

In this paper, we propose a new randomized method for numerical integration on a compact complex manifold with respect to a continuous volume form. Taking for quadrature nodes a suitable determinantal point process, we build an unbiased…

Let W be a finite dimensional representation of a linearly reductive group G over a field k. Motivated by their work on classical rings of invariants, Levasseur and Stafford asked whether the ring of invariants under G of the symmetric…

P. M. Cohn showed in 1971 that given a ring $R$, to describe, up to isomorphism, a division ring $D$ generated by a homomorphic image of $R$ is equivalent to specifying the set of square matrices over $R$ which map to singular matrices over…

We study the problem of differentially private (DP) mechanisms for representing sets of size $k$ from a large universe. Our first construction creates $(\epsilon,\delta)$-DP representations with error probability of $1/(e^\epsilon + 1)$…