Related papers: Explicit Euclidean division algorithms for some de…
The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
Lenstra's integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase.…
In this paper, we develop the theory of the necklace ring and the logarithmic function. Regarding the necklace ring, we introduce the necklace ring functor $Nr$ from the category of special $\ld$-rings into the category of special…
Given a ring $R$, the notion of Sylvester rank function was conceived within the context of Cohn's classification theory of epic division $R$-rings. In this paper we study and describe the space of Sylvester rank functions on certain…
We present ${\rm poly\log\log n}$-round randomized distributed algorithms to compute vertex splittings, a partition of the vertices of a graph into $k$ parts such that a node of degree $d(u)$ has $\approx d(u)/k$ neighbors in each part. Our…
Galois rings and orders, introduced by Futorny and Ovsienko, are embedded into fixed subrings of skew group (or monoid) rings and have many interesting applications to the structure and representation theory of algebras. The paper focuses…
We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…
In previous research, quantum resources were concretely estimated for solving Elliptic Curve Discrete Logarithm Problem(ECDLP). In [1], the quantum algorithm was optimized for the binary elliptic curves and the main optimization target was…
We define the regular Euclidean algorithm and the general form which leads to the method of least absolute remainders and also the method of negative remainders. We are going to show that if looked from the perspective of subtraction, the…
We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
We study in-depth those rings $R$ for which, there exists a fixed $n\geq 1$, such that $u^n-1$ lies in the subring $\Delta(R)$ of $R$ for every unit $u\in R$. We succeeded to describe for any $n\geq 1$ all reduced $\pi$-regular…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…
For $n=3$, 4, and 5, we prove that, when $S_n$-number fields of degree $n$ are ordered by their absolute discriminants, the lattice shapes of the rings of integers in these fields become equidistributed in the space of lattices.
The objective of ordinal embedding is to find a Euclidean representation of a set of abstract items, using only answers to triplet comparisons of the form "Is item $i$ closer to the item $j$ or item $k$?". In recent years, numerous…
Modern particle physics is increasingly becoming a precision science that relies on advanced theoretical predictions for the analysis and interpretation of experimental results. The planned physics program at the LHC and future colliders…
We survey the recent developments in the area that grew out of attempts to extend an analog of Hilbert's Tenth Problem to the field of rational numbers and rings of integers of number fields. The paper is based on a plenary talk the author…
We present a revisit of the seeds algorithm to explore the semigroup tree. First, an equivalent definition of seed is presented, which seems easier to manage. Second, we determine the seeds of semigroups with at most three left elements.…