Related papers: Extending the PSLQ Algorithm to Algebraic Integer …
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
Let $L$ be a separable quadratic extension of either $\mathbb{Q}$ or $\mathbb{F}_q(t)$. We propose efficient algorithms for finding isomorphisms between quaternion algebras over $L$. Our techniques are based on computing maximal one-sided…
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…
We discuss the application of computer algebra to problems commonly arising in numerical relativity, such as the derivation of 3+1-splits, manipulation of evolution equations and automatic code generation. Particular emphasis is put on…
We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…
We realize that geometric polynomials and p-Bernoulli polynomials and numbers are closely related with an integral representation. Therefore, using geometric polynomials, we extend some properties of Bernoulli polynomials and numbers such…
Some aspects of differential and integral calculi on generalized grassmann (paragrassmann) algebras are considered. The integration over paragrassmann variables is applied to evaluate the partition function for the $Z_{p+1}$ Potts model on…
Many statistical models are algebraic in that they are defined by polynomial constraints or by parameterizations that are polynomial or rational maps. This opens the door for tools from computational algebraic geometry. These tools can be…
In recent three--loop calculations of massive Feynman integrals within Quantum Chromodynamics (QCD) and, e.g., in recent combinatorial problems the so-called generalized harmonic sums (in short $S$-sums) arise. They are characterized by…
Real algebraic geometry adapts the methods and ideas from (complex) algebraic geometry to study the real solutions to systems of polynomial equations and polynomial inequalities. As it is the real solutions to such systems modeling…
We propose a new exact approach for solving integer linear programming (ILP) problems which we will call projective splitting algorithms (PSAs). Unlike classical methods for solving ILP problems, PSAs conduct the search for the optimal…
This is a sequel of our previous paper where we described an algorithm to find a solution of differential equations for master integrals in the form of an $\epsilon$-expansion series with numerical coefficients. The algorithm is based on…
A late time asymptotic perturbative analysis of curvature coupled complex scalar field models with accelerated cosmological expansion is carried out on the level of formal power series expansions. For this, algebraic analogues of the…
Distributions on integers are ubiquitous in probabilistic modeling but remain challenging for many of today's probabilistic programming languages (PPLs). The core challenge comes from discrete structure: many of today's PPL inference…
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…
Polynomial relations for generators of $su(2)$ Lie algebra in arbitrary representations are found. They generalize usual relation for Pauli operators in spin 1/2 case and permit to construct modified Holstein-Primakoff transformations in…
Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient…
This note introduces a new class of integer factoring algorithms. Two versions of this method will be described, deterministic and probabilistic. These algorithms are practical, and can factor large classes of balanced integers N = pq, p <…
The goal is to obtain an asymptotic formula for the number of quadratic extensions with bounded discriminant of a some quadratic number field with odd class number. This extends an already known result for Q.