Related papers: Where have all the grasshoppers gone?
A model quantum system is proposed to describe position states of a massive body in flat space on large scales, excluding all standard quantum and gravitational degrees of freedom. The model is based on standard quantum spin commutators,…
We consider a branching-selection particle system on $\Z$ with $N \geq 1$ particles. During a branching step, each particle is replaced by two new particles, whose positions are shifted from that of the original particle by independently…
Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…
We study a synchronous dispersion process in which $M$ particles are initially placed at a distinguished origin vertex of a graph $G$. At each time step, at each vertex $v$ occupied by more than one particle at the beginning of this step,…
In this paper,we study spatial central configurations where N bodies are at the vertices of a regular N-gon $T$ and the other 4 bodies are symmetrically located on the straight line that is perpendicular to the plane that contains $T$ and…
Given a set $P$ of $n$ points that are moving in the plane, we consider the problem of computing a spanning tree for these moving points that does not change its combinatorial structure during the point movement. The objective is to…
Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…
A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…
Here we place the Latex typeset of the paper M. Pavsic, Phys. Lett. A116 (1986) 1-5. In the paper we presented the picture that our spacetime is a 3-brane moving in a higher dimensional space. The dynamical equations were derived from the…
A team of anonymous mobile agents represented by points freely moving in the plane have to gather at a single point and stop. Agents start at different points of the plane and at possibly different times chosen by the adversary. They are…
A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…
Let $L$ be a set of $n$ lines in the plane, not necessarily in general position. We present an efficient algorithm for finding all the vertices of the arrangement $A(L)$ of maximum level, where the level of a vertex $v$ is the number of…
It is well known that the distribution of simple random walks on $\bf{Z}$ conditioned on returning to the origin after $2n$ steps does not depend on $p= P(S_1 = 1)$, the probability of moving to the right. Moreover, conditioned on…
In this article, we report on an exact closed-form solution for the displacement at the surface of an elastic half-space elicited by a buried point source that acts at some point underneath that surface. This is commonly referred to as the…
In this paper we address a $n+1$-body gravitational problem governed by the Newton's laws, where $n$ primary bodies orbit on a plane $\Pi$ and an additional massless particle moves on the perpendicular line to $\Pi$ passing through the…
The general $d$-position number ${\rm gp}_d(G)$ of a graph $G$ is the cardinality of a largest set $S$ for which no three distinct vertices from $S$ lie on a common geodesic of length at most $d$. This new graph parameter generalizes the…
The problem of finding the maximum-weight, planar subgraph of a finite, simple graph with nonnegative real edge weights is well known in industrial and electrical engineering, systems biology, sociology and finance. As the problem is known…
We consider the following question: How many edge-disjoint plane spanning trees are contained in a complete geometric graph $GK_n$ on any set $S$ of $n$ points in general position in the plane? We show that this number is in…
The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…
Let $Q$ be a finite set of points in the plane. For any set $P$ of points in the plane, $S_{Q}(P)$ denotes the number of similar copies of $Q$ contained in $P$. For a fixed $n$, Erd\H{o}s and Purdy asked to determine the maximum possible…