Related papers: Note on the Ideal Exponentiation in Imaginary Quad…
Already Dedekind and Weber considered the problem of counting integral ideals of norm at most $x$ in a given number field $K$. Here we improve on the existing results in case $K/\mathbb Q$ is abelian and has degree at least four. For these…
We associate to each $r$-multigraded, locally finitely generated ideal in the "large polynomial ring" on countably many indeterminates a power series in $r$ variables; this power series is the limit in the adic topology of the numerators of…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
Formulation symmetry in mixed-integer programming (MIP) can hinder solver performance by inducing redundant search, but detecting such symmetries is also a significant computational challenge. This paper explores the potential for quantum…
Many of the envisioned use-cases for quantum computers involve optimisation processes. While there are many algorithmic primitives to perform the required calculations, all eventually lead to quantum gates operating on quantum bits, with an…
By double ideal quotient, we mean $(I:(I:J))$ where ideals $I$ and $J$. In our previous work [11], double ideal quotient and its variants are shown to be very useful for checking prime divisor and generating primary component. Combining…
We introduce a $0.611$-approximation algorithm for Quantum MaxCut and a $\frac{1+\sqrt{5}}{4} \approx 0.809$-approximation algorithm for the EPR Hamiltonian of [arXiv:2209.02589]. A novel ingredient in both of these algorithms is to…
We show how imaginary numbers in quantum physics can be eliminated by enlarging the Hilbert Space followed by an imposition of - what effectively amounts to - a superselection rule. We illustrate this procedure with a qubit and apply it to…
Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these sets. These algorithms can be built in a generic or…
We discuss the algorithm of the cutting rules of calculating the imaginary part of physical amplitude and the optical theorem. We ameliorate the conventional cutting rules to make it suitable for actual calculation and give the right…
In this paper, we introduce new general frameworks for estimating the maximal dimension of Hilbert cubes contained in finite truncations of arbitrary sets. As applications, we investigate Hilbert cubes in a range of arithmetic sets,…
We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can…
The quantum mechanical expression relating two commuting operators is reformulated such that the power method (also called method of moments) for iteratively calculating eigenvalues and eigenvectors becomes applicable. The new iterative…
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 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…
The difficulty of an optimization task in quantum information science depends on the proper mathematical expression of the physical target. Here we demonstrate the power of optimization functionals targeting an arbitrary perfect two-qubit…
We establish that, for almost all natural numbers $N$, there is a sum of two positive integral cubes lying in the interval $[N-N^{7/18+\epsilon},N]$. Here, the exponent $7/18$ lies half way between the trivial exponent $4/9$ stemming from…
In our recent paper we gave an efficient algorithm to calculate "small" solutions of relative Thue equations (where "small" means an upper bound of type $10^{500}$ for the sizes of solutions). Here we apply this algorithm to calculating…