Related papers: An Algorithmic Approach to Pick's Theorem
Wick rotation in area tensor Regge calculus is considered. The heuristical expectation is confirmed that the Lorentzian quantum measure on a spacelike area should coincide with the Euclidean measure at the same argument. The consequence is…
In this paper, we investigate some properties on harmonic functions and solutions to Poisson equations. First, we will discuss the Lipschitz type spaces on harmonic functions. Secondly, we establish the Schwarz-Pick lemma for harmonic…
The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…
In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
Let $P$ be a convex polyhedron and $Q$ be a convex polygon with $n$ vertices in total in three-dimensional space. We present a deterministic algorithm that finds a translation vector $v \in \mathbb{R}^3$ maximizing the overlap area $|P \cap…
We present a simple and efficient algorithm to compute the sum of the algebraic conjugates of a point on an elliptic curve.
We give explicit, polynomial-time computable formulas for the number of integer points in any two-dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of…
We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…
We propose an extension of a result by Repetowicz et al. about Wick's theorem and its applications: we first show that Wick's theorem can be extended to the uniform distribution on the sphere and then to the whole class of elliptical…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…
In this paper, we give a formula for the area of the triangle formed by the vertices that live on a given polynomial, and we generalize this formula to the volumes of $n$-simplices with vertices on a polynomial space curve. To prove these…
On the vertex operator algebra associated with rank one lattice we derive a general formula for products of vertex operators in terms of generalized homogeneous symmetric functions. As an application we realize Jack symmetric functions of…
In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.
Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…
We derive formulas for the matrix elements of the lattice Green function for the discrete Poisson equation on an infinite square lattice. The partial difference equation for the matrix elements is solved by reducing it to a series of first…
Determining if a point is in a polygon or not is used by a lot of applications in computer graphics, computer games and geoinformatics. Implementing this check is error-prone since there are many special cases to be considered. This holds…
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version of Weierstrass's Theorem on uniform approximation of continuous…