Related papers: Generating Random Factored Ideals in Number Fields
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
For an ideal $I$ in a local ring $(R, \fm)$, we prove that the integer-valued function $\ell_R(H^0_\fm(R/I^{n+1}))$ is a polynomial for $n$ big enough if either $I$ is a principle ideal or $I$ is generated by part of an almost p-standard…
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…
In binary polynomial optimization, the goal is to find a binary point maximizing a given polynomial function. In this paper, we propose a novel way of formulating this general optimization problem, which we call factorized binary polynomial…
We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…
In this article we investigate when a homogeneous ideal in a graded ring is normal, that is, when all positive powers of the ideal are integrally closed. We are particularly interested in homogeneous ideals in an N-graded ring generated by…
We survey several methods of generating large random lambda-terms, focusing on their closed and simply-typed variants. We discuss methods of exact- and approximate-size generation, as well as methods of achieving size-uniform and…
In this paper, we investigate the row-factorization matrices of Arf numerical semigroups, and we provide the full list of such matrices of certain Arf numerical semigroups. We use the information of row-factorization matrices to detect the…
Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…
Neural ideals, originally defined in arXiv:1212.4201, give a way of translating information about the firing pattern of a set of neurons into a pseudomonomial ideal in a polynomial ring. We give a simple criterion for determining whether a…
Capacity is an important tool in decision-making under risk and uncertainty and multi-criteria decision-making. When learning a capacity-based model, it is important to be able to generate uniformly a capacity. Due to the monotonicity…
This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…
Loop invariants are properties of a program loop that hold both before and after each iteration of the loop. They are often used to verify programs and ensure that algorithms consistently produce correct results during execution.…
In this paper we characterize, in algebraic and geometric terms, when a graded vanishing ideal is generated by binomials over any field K.
We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…
Quantum Key Distribution is the process of using quantum communication to establish a shared key between two parties. It has been demonstrated the unconditional security and effective communication of quantum communication system can be…
This paper presents an algorithmic method for generating random orthogonal matrices \(A\) that satisfy the property \(A^t S A = S\), where \(S\) is a fixed real invertible symmetric or skew-symmetric matrix. This method is significant as it…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this…
An algorithm for sampling exactly from the normal distribution is given. The algorithm reads some number of uniformly distributed random digits in a given base and generates an initial portion of the representation of a normal deviate in…