Related papers: An Algorithmic Approach to Pick's Theorem
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
In this paper, we give an algorithm to infer the positions of the vertices of an unknown tetrahedron, given a sample of points which are uniformly distributed within the tetrahedron. The accuracy of the algorithm is demonstrated using some…
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
The algorithms given in Karney, J. Geodesy 87, 43-55 (2013), to compute geodesics on terrestrial ellipsoids are extended to apply to ellipsoids of revolution with arbitrary eccentricity. For the direct and inverse geodesic problems, this…
In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.
For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
We prove a semiample generalization of Poonen's Bertini Theorem over a finite field that implies the existence of smooth sections for wide new classes of divisors. The probability of smoothness is computed as a product of local…
In this note we point out the relation between Brion's formula for the lattice point generating function of a convex polytope in terms of the vertex cones [Brion1988] on the one hand, and the polar decomposition \`a la Lawrence/Varchenko…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
Regions-based theories of space aim -- among others -- to define points in a geometrically appealing way. The most famous definition of this kind is probably due to Whitehead. However, to conclude that the objects defined are points indeed,…
The lattice definition of the two-dimensional topological quantum field theory [Fukuma, {\em et al}, Commun.~Math.~Phys.\ {\bf 161}, 157 (1994)] is generalized to arbitrary (not necessarily orientable) compact surfaces. It is shown that…
A new and efficient algorithm is presented for the calculation of the partition function in the $S=\pm 1$ Ising model. As an example, we use the algorithm to obtain the thermal dependence of the magnetic spin susceptibility of an Ising…
Let p be a monic polynomial in one complex variable and K a measurable subset of the complex plane. In terms of the area of K, we give an upper bound on the area of the preimage of K under p and a lower bound on the area of the image of K…
We provide an alternative unified approach for proving the Pythagorean theorem (in dimension $2$ and higher), the law of sines and the law of cosines, based on the concept of shape derivative. The idea behind the proofs is very simple: we…
In this paper, we will provide an algorithm which allows us to find a BCK-algebra starting from a given block code.
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.
Starting from the Maxwell-Juettner equilibrium distribution, we develop a relativistic lattice Boltzmann (LB) algorithm capable of handling ultrarelativistic systems with flat, but expanding, spacetimes. The algorithm is validated through…
We develop an algorithm for computing affine Kazhdan-Lusztig polynomials, for all Lie types. This generalizes our previously published algorithm for type A, which in turn is a faster version of an algorithm due to Lascouz, Leclerc and…
We study the interaction between polynomial space randomness and a fundamental result of analysis, the Lebesgue differentiation theorem. We generalize Ko's framework for polynomial space computability in $\mathbb{R}^n$ to define…