Related papers: Computing discrete logarithms in subfields of resi…
Given a model of the theory of the real field with restricted analytic functions such that its value group has finite archimedean rank we show how one can extend the restricted logarithm to a global logarithm with values in the polynomial…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
This paper is concerned with the characterizations of the Friedrichs extension for a class of singular discrete linear Hamiltonian systems. The existence of recessive solutions and the existence of the Friedrichs extension are proved under…
Recently classes of conic and discrete conic functions were introduced. In this paper we use the term convic instead conic. The class of convic functions properly includes the classes of convex functions, strictly quasiconvex functions and…
We improve the "sieve" part of the number field sieve used in factoring integer and computing discrete logarithm. The runtime of our method is shorter than that of existing methods. Under some reasonable assumptions, we prove that it is…
We construct the rings of generalized differential operators on the ${\bf h}$-deformed vector space of ${\bf gl}$-type. In contrast to the $q$-deformed vector space, where the ring of differential operators is unique up to an isomorphism,…
Neural networks have achieved tremendous success in a large variety of applications. However, their memory footprint and computational demand can render them impractical in application settings with limited hardware or energy resources. In…
Biggs proposed the sandpile group of certain modified wheel graphs for cryptosystems relying on the difficulty of the discrete logarithm problem. Blackburn and independently Shokrieh showed that the discrete logarithm problem is efficiently…
In this work, we analyze the finite element method with arbitrary but fixed polynomial degree for the nonlinear Helmholtz equation with impedance boundary conditions. We show well-posedness and error estimates of the finite element solution…
We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…
Deep holes play an important role in the decoding of generalized Reed-Solomon codes. Recently, Wu and Hong \cite{WH} found a new class of deep holes for standard Reed-Solomon codes. In the present paper, we give a concise method to obtain a…
Higher-order Fourier analysis, developed over prime fields, has been recently used in different areas of computer science, including list decoding, algorithmic decomposition and testing. We extend the tools of higher-order Fourier analysis…
A deformed logarithm function called $q$-logarithm has received considerable attention by physicist after its introduction by C. Tsallis. J. Naudts has proposed a generalization called $\phi$-logarithm and he has derived the basic…
We introduce a class of dynamical systems of algebraic origin, consisting of self-interacting irreducible polynomials over a field. A polynomial f is made to act on a polynomial g by mapping the roots of g. This action identifies a new…
We give new explicit constructions of several fundamental objects in linear-algebraic pseudorandomness and combinatorics, including lossless rank extractors, weak subspace designs, and strong $s$-blocking sets over finite fields. Our focus…
For a finite set of homogeneous locally nilpotent derivations of the algebra of polynomials in several variables, a finite dimensionality criterion for the Lie algebra generated by these derivations is known. Also the structure of the…
Some properties and relations satisfied by the polynomial solutions of a bispectral problem are studied. Given a finite order differential operator, under certain restrictions, its polynomial eigenfunctions are explicitly obtained, as well…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
Given an irreducible well-generated complex reflection group, we construct an explicit basis for the module of vector fields with logarithmic poles along its reflection arrangement. This construction yields in particular a Hodge filtration…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…