Related papers: A solution to the tennis ball problem
In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…
In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…
We consider walks on a triangular domain that is a subset of the triangular lattice. We then specialise this by dividing the lattice into two directed sublattices with different weights. Our central result is an explicit formula for the…
The parametric lattice-point counting problem is as follows: Given an integer matrix $A \in Z^{m \times n}$, compute an explicit formula parameterized by $b \in R^m$ that determines the number of integer points in the polyhedron $\{x \in…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
In this study, a collocation method based on the Fibonacci operational matrix is proposed to solve generalized pantograph equations with linear functional arguments. Some illustrative examples are given to verify the efficiency and…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
Fill each box in a Young diagram with the number of paths from the bottom of its column to the end of its row, using steps north and east. Then, any square sub-matrix of this array starting on the south-east boundary has determinant one. We…
The paper aims to propose a suitable method in finding the solution of tensor complementarity problem. The tensor complementarity problem is a subclass of nonlinear complementarity problems for which the involved function is defined by a…
Probabilistic properties of tennis scoring systems are examined and compared with best-of-K systems. A model, where each player has his/her own probability of winning his/her service point and which remains invariant for the duration of the…
Consider lattice paths in Z^2 taking unit steps north (N) and east (E). Fix positive integers r,s and put an equivalence relation on points of Z^2 by letting v,w be equivalent if v - w = m (r,s) for some m in Z. Call a lattice path valid if…
We propose a relax-and-round approach combined with a greedy search strategy for performing complex lattice basis reduction. Taking an optimization perspective, we introduce a relaxed version of the problem that, while still nonconvex, has…
We study the class of continuous polynomial Volterra processes, which we define as solutions to stochastic Volterra equations driven by a continuous semimartingale with affine drift and quadratic diffusion matrix in the state of the…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
A method of embedding partially ordered sets into linear spaces is presented. The problem of finding all orthocomplementations in a finite lattice is reduced to a linear programming problem.
In the paper, we introduce a matrix method to constructively determine spaces of polynomial solutions (in general, multiplied by exponentials) to a system of constant coefficient linear PDE's with polynomial (multiplied by exponentials)…
In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…
This paper describes a program that solves elementary mathematical problems, mostly in metric space theory, and presents solutions that are hard to distinguish from solutions that might be written by human mathematicians. The program is…
We investigate a functional equation which resembles the functional equation for the generating function of a lattice walk model for the quarter plane. The interesting feature of this equation is that its orbit sum is zero while its…
Motion blur reduces the clarity of fast-moving objects, posing challenges for detection systems, especially in racket sports, where balls often appear as streaks rather than distinct points. Existing labeling conventions mark the ball at…