Related papers: A solution to the tennis ball problem
In the first part of this paper I give an elementary overview about some number sequences which count various sorts of lattice paths in strips along the x-axis and compute their generating functions in terms of Fibonacci and Lucas…
We present a numerical algorithm to solve the Boltzmann equation for the electron distribution function in magnetic multilayer heterostructures with non-collinear magnetizations. The solution is based on a scattering matrix formalism for…
A model is presented consisting of triangular trimers on the triangular lattice. In analogy to the dimer problem, these particles cover the lattice completely without overlap. The model has a honeycomb structure of hexagonal cells separated…
In this paper we provide a method capable of producing an infinite number of solutions for Einstein's equation on static spacetimes with perfect fluid as a matter field. All spacetimes of this type which are symmetric with respect to a…
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (\emph{e.g.} Newton-Raphson method).…
The quadratic shortest path problem is the problem of finding a path in a directed graph such that the sum of interaction costs over all pairs of arcs on the path is minimized. We derive several semidefinite programming relaxations for the…
In the worldline formalism, scalar Quantum Electrodynamics on a 2-dimensional lattice is related to the areas of closed loops on this lattice. We exploit this relationship in order to determine the general structure of the moments of the…
An analytical expression of the strain distribution due to lattice mismatch is obtained in an infinite isotropic elastic medium (a matrix) with a three-dimensional polyhedron-shaped inclusion (a quantum dot). The expression was obtained…
Matrices can be augmented by adding additional columns such that a partitioning of the matrix in blocks of rows defines mutually orthogonal subspaces. This augmented system can then be solved efficiently by a sum of projections onto these…
We derive a path counting formula for two-dimensional lattice path model on a plane with filter restrictions. A filter is a line that restricts the path passing it to one of possible directions. Moreover, each path that touches this line is…
We present general algorithms (fully implemented in Maple) for calculations of various quantities related to constrained directed walks for a general set of steps on the square lattice in two dimensions. As a special case, we rederive…
We introduce the active partition of the ground set of an oriented matroid perspective (or quotient, or strong map) on a linearly ordered ground set. The reorientations obtained by arbitrarily reorienting parts of the active partition share…
In this paper, we bring a complete solution to the Ovals problem, as formulated in [3] and [24].
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
The general d-dimensional twisted group lattice is solved. The irreducible representations of the corresponding group are constructed by an explicit procedure. It is proven that they are complete. All matrix representation solutions to the…
It has long been known that cylindrical algebraic decompositions (CADs) can in theory be used for robot motion planning. However, in practice even the simplest examples can be too complicated to tackle. We consider in detail a "Piano…
Inspired by the Galerkin and particular method, a new approximation approach is recalled in the Cartesian case. In this paper, we are interested specially by constructing this method, when the domain of consideration is a two dimensional…
We extend holomorphically polyharmonic functions on a real ball to a complex set being the union of rotated balls. We solve a Dirichlet type problem for complex polyharmonic functions with the boundary condition given on the union of…
We consider the periodic Manhattan lattice with alternating orientations going north-south and east-west. Place obstructions on vertices independently with probability $0<p<1$. A particle is moving on the edges with unit speed following the…