Related papers: Pseudo-Polynomial Time Algorithm for Computing Mom…
We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.
We compute an asymptotic formula for the mixed second moment of the $\mu$-th and $\nu$-th derivatives of quadratic Dirichlet $L$-functions over monic, irreducible polynomials in the function field setting.
Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…
We devise a polynomial-time approximation scheme for the classical geometric problem of finding an approximate short path amid weighted regions. In this problem, a triangulated region P comprising of n vertices, a positive weight associated…
In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by…
Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…
In this paper we investigate the properties of the free Sheffer systems, which are certain families of martingale polynomials with respect to the free Levy processes. First, we classify such families that consist of orthogonal polynomials;…
We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…
We present a practical algorithm to approximate the exponential of skew-Hermitian matrices up to round-off error based on an efficient computation of Chebyshev polynomials of matrices and the corresponding error analysis. It is based on…
This document contains notes based on lectures given by Hendrik Lenstra at the PCMI summer school 2022. There are many problems in algebraic number theory which one would like to solve algorithmically, for example computation of the maximal…
Given a convex set $Q \subseteq R^m$ and an integer matrix $W \in Z^{m \times n}$, we consider statements of the form $ \forall b \in Q \cap Z^m$ $\exists x \in Z^n$ s.t. $Wx \leq b$. Such statements can be verified in polynomial time with…
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…
If P is a rational polytope in R^d, then $i_P(t):=#(tP\cap Z^d)$ is a quasi-polynomial in t, called the Ehrhart quasi-polynomial of P. A period of i_P(t) is D(P), the smallest positive integer D such that D*P has integral vertices. Often,…
A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…
The polynomial solution of the Schrodinger equation for the Pseudoharmonic potential is found for any arbitrary angular momentum $l$. The exact bound-state energy eigenvalues and the corresponding eigen functions are analytically…
We extend the conforming virtual element method to the numerical resolution of eigenvalue problems with potential terms on a polytopal mesh. An important application is that of the Schrodinger equation with a pseudopotential term. This…
Exceptional orthogonal Laguerre polynomials can be viewed as an extension of the classical Laguerre polynomials per excluding polynomials of certain order(s) from being eigenfunctions for the corresponding exceptional differential operator.…
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.
This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform…
In this paper, we propose a carefully optimized "half-gcd" algorithm for polynomials. We achieve a constant speed-up with respect to previous work for the asymptotic time complexity. We also discuss special optimizations that are possible…