Related papers: Constant term solution for an arbitrary number of …
A theoretical approach for a non-perturbative dynamical description of two interacting atoms in an optical lattice potential is introduced. The approach builds upon the stationary eigenstates found by a procedure described in Grishkevich et…
There is strong evidence coming from Lorentzian dynamical triangulations that the unboundedness of the gravitational action is no obstacle to the construction of a well-defined non-perturbative path integral. In a continuum approach, a…
We investigate the existence and uniqueness of (locally) absolutely continuous trajectories of a penalty term-based dynamical system associated to a constrained variational inequality expressed as a monotone inclusion problem. Relying on…
Sites in an infinite d-dimensional lattice, open with probability greater or equal to 1/d, form an infinite open path.
A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more…
The constants of motion of the following systems are deduced: a relativistic particle with linear dissipation, a no-relativistic particle with a time explicitly depending force, a no-relativistic particle with a constant force and time…
We say a lattice point $X=(x_1,\ldots,x_m)$ is visible from the origin, if $\gcd(x_1,...,x_m)=1$. In other word, there are no other lattice point on the line segment from the origin $O$ to $X$. From J.E. Nymann's result, we know that the…
Homotopy methods are attractive due to their capability of solving difficult optimisation and optimal control problems. The underlying idea is to construct a homotopy, which may be considered as a continuous (zero) curve between the…
Complex moment sequences are exactly those which admit positive definite extensions on the integer lattice points of the upper diagonal half-plane. Here we prove that the aforesaid extension is unique provided the complex moment sequence is…
The spatio-temporal structure of traffic flow pattern is investigated under the open boundary condition using the optimal velocity (OV) model. The parameter region where the uniform solution is convectively unstable is determined. It is…
Quasilinear systems with piecewise constant arguments of generalized type are under investigation from the asymptotic point of view. The systems have discontinuous right-hand sides which are identified via a discrete-time map. It is…
To solve a linear program, the simplex method follows a path in the graph of a polytope, on which a linear function increases. The length of this path is an key measure of the complexity of the simplex method. Numerous previous articles…
The paper aims to show the equivalency between nonlinear complementarity problem and the system of nonlinear equations. We propose a homotopy method with vector parameter $\lambda$ in finding the solution of nonlinear complementarity…
We present a $O(n^{\frac{3}{2}})$-time algorithm for the \emph{shortest (diagonal) flip path problem} for \emph{lattice} triangulations with $n$ points, improving over previous $O(n^2)$-time algorithms. For a large, natural class of inputs,…
A lattice-based model for continuum percolation is applied to the case of randomly located, partially aligned sticks with unequal lengths in 2D which are allowed to cross each other. Results are obtained for the critical number of sticks…
We enumerate lattice paths in the planar integer lattice consisting of positively directed unit vertical and horizontal steps with respect to a specific elliptic weight function. The elliptic generating function of paths from a given…
While the constant radial acceleration problem is known to be integrable and has received some recent attention in an orbital mechanics context, a closed form explicit solution, relating the state variables to a time parameter, has eluded…
\L{}ukasiewicz paths are lattice paths in $\Bbb{N}^2$ starting at the origin, ending on the $x$-axis, and consisting of steps in the set $\{(1,k), k\geq -1\}$. We give generating function and exact value for the number of $n$-length…
The problem of finding paths in temporal graphs has been recently considered due to its many applications. In this paper we consider a variant of the problem that, given a vertex-colored temporal graph, asks for a path whose vertices have…
The Hammersley problem asks for the maximal number of points in a monotonous path through a Poisson point process. It is exactly solvable and notoriously known to belong to the KPZ universality class, with a cube-root scaling for the…