Related papers: Generating Random Factored Ideals in Number Fields
Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.
We define a scheme for labelling and ordering integral ideals of number fields, including prime ideals as a special case. The order we define depends only on the choice of a monic irreducible integral defining polynomial for each field $K$,…
Quaternionic polynomials are generated by quaternionic variables and the quaternionic product. This paper proposes the generating ideal of quaternionic polynomials in tensor algebra, finds the Groebner base of the ideal in the case of pure…
We show that given the order of a single element selected uniformly at random from $\mathbb Z_N^*$, we can with very high probability, and for any integer $N$, efficiently find the complete factorization of $N$ in polynomial time. This…
We construct algorithms that efficiently generate random factorisations of values $P(n)$ as products of two integers, where $P\in\mathbb{Z}[x]$ is a given quadratic or cubic monic polynomial. In other words, the algorithms produce random…
We give an algorithm that generates a uniformly random contingency table with specified marginals, i.e. a matrix with non-negative integer values and specified row and column sums. Such algorithms are useful in statistics and combinatorics.…
In this article, we study binomial ideals generated by an arbitrary collection of corner-interval $2$-minors of a generic matrix. We determine the minimal prime ideals of such ideals and characterize their radicality in the special case of…
Let $R$ be a polynomial ring in $N$ variables over an arbitrary field $K$ and let $I$ be an ideal of $R$ generated by $n$ polynomials of degree at most 2. We show that there is a bound on the projective dimension of $R/I$ that depends only…
Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…
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…
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open…
In this paper we study the concept of radical factorization in the context of abstract ideal theory in order to obtain a unified approach to the theory of factorization into radical ideals and elements in the literature of commutative…
This article presents an efficient algorithm to generate a discrete uniform distribution on a set of $p$ elements using a biased random source for $p$ prime. The algorithm generalizes Von Neumann's method and improves computational…
In this paper, we create a systematic and automatic procedure for transforming the integer factorization problem into the problem of solving a system of Boolean equations. Surprisingly, the resulting system of Boolean equations takes on a…
Inspired by [4] we present a new algorithm for uniformly random generation of ordered trees in which all occuring outdegrees can be specified by a given sequence of numbers. The method can be used for random generation of binary or n-ary…
Motivated by applications to the theory of error-correcting codes, we give methods for computing a generating set for the ideal generated by $\beta$-graded polynomials vanishing on certain subsets of a simplicial complete toric variety $X$…