相关论文: A Variant on the Feline Josephus Problem
This paper addresses the theoretical conditions necessary for some subject of study to survive forever. A probabilistic analysis leads to some prerequisite conditions for preserving, say, electronic data indefinitely into the future. The…
The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…
This paper studies scenarios of cyclic dominance in a coevolutionary spatial model in which game strategies and links between agents adaptively evolve over time. The Optional Prisoner's Dilemma (OPD) game is employed. The OPD is an extended…
Let an $n\times n$ array $\left( a_{ij}\right) $ of lights be given, each either on (when $a_{ij}=1$) or off (when $a_{ij}=-1$). For each row and each column there is a switch so that if the switch is pulled ($x_{i}=-1$ for row $i$ and…
The Monty Hall puzzle has been solved and dissected in many ways, but always using probabilistic arguments, so it is considered a probability puzzle. In this paper the puzzle is set up as an orthodox statistical problem involving an unknown…
The present status of calculations of four fermion final states is reviewed. Higher order problems arising there are pointed out. Special attention is paid to results obtained in the semi-analytical approach and their limitations and…
We consider the problem of enumerating Dyck paths staying weakly above the x-axis with a limit to the number of consecutive up steps, or a limit to the number of consecutive down steps. We use Finite Operator Calculus to obtain formulas for…
Many-body systems, such as electrons flowing in a superconductor, are among the most difficult theoretical problems to study. A new family of exactly solvable models may offer some answers.
During World War II the German army used tanks to devastating advantage. The Allies needed accurate estimates of their tank production and deployment. They used two approaches to find these values: spies, and statistics. This note describes…
This paper addresses the problem of steering a discrete-time linear dynamical system from an initial Gaussian distribution to a final distribution in a game-theoretic setting. One of the two players strives to minimize a quadratic payoff,…
A simplified prisoner's game is studied on a square lattice when the players interacting with their neighbors can follow only two strategies: to cooperate (C) or to defect (D) unconditionally. The players updated in a random sequence have a…
The mathematical pendulum is traditionally solved using a Jacobi elliptic functions. We solve it here using the Weierstrass elliptic function. Every initial condition of the pendulum produces an elliptic curve and a point which by the…
We consider "surrounding" versions of the classic Cops and Robber game. The game is played on a connected graph in which two players, one controlling a number of cops and the other controlling a robber, take alternating turns. In a turn,…
We bound the condition number of the Jacobian in pseudo arclength continuation problems, and we quantify the effect of this condition number on the linear system solution in a Newton GMRES solve. In pseudo arclength continuation one…
The stable marriage and stable roommates problems have been extensively studied due to their high applicability in various real-world scenarios. However, it might happen that no stable solution exists, or stable solutions do not meet…
Competition among cooperators, defectors, and loners is studied in an evolutionary prisoner's dilemma game with optional participation. Loners are risk averse i.e. unwilling to participate and rather rely on small but fixed earnings. This…
Several differential equations usually appearing in mathematical physics are solved through a power series expansion, which reduces in solving difference equations. In this paper a probability problem is presented whose solution follows a…
The Stable Marriage Problem is to find a one-to-one matching for two equally sized sets of agents. Due to its widespread applications in the real world, especially the unique importance to the centralized match maker, a very large number of…
We introduce a discrete-time fractional calculus of variations on the time scale $h\mathbb{Z}$, $h > 0$. First and second order necessary optimality conditions are established. Examples illustrating the use of the new Euler-Lagrange and…
This is a short historical note concerning the evolution of Wetzel's problem and Erdos' solution.