Related papers: Erratum to: Lattice point methods for combinatoria…
Using an efficient algorithmic implementation of Caratheodory's theorem, we propose three enhanced versions of the Projection and Rescaling algorithm's basic procedures each of which improves upon the order of complexity of its analogue in…
In this paper we define the canonical mixed extension of a decision form game. We motivate the necessity to introduce this concept and we show several examples about the new concept. In particular we focus our study upon the mixed…
A very short note, explaining the error in the original paper, which renders its central result incorrect.
We continue the work of [4, 2, 3], in which we discuss published assertions that are incorrect or incorrectly proven; that are severely limited or reduce to triviality; or that we improve upon.
We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the…
In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of…
We continue the work of [5] and [3], in which are considered papers in the literature that discuss fixed point assertions in digital topology. We discuss published assertions that are incorrect or incorrectly proven; that are severely…
Typographical corrections to the original paper, intended for publication in Physical Review E.
Some corrections are made in our article, which was published in Appl. Anal. Optim. Vol. 3 (2019), No. 1, 103--127. These corrections are intended to transform the equation \eqref{eq:1.1} \begin{equation}\label{eq:1.1} x(t) +…
This paper develops a unified framework for zero-sum games in which both the pure strategies and the payoff matrices contain complex-valued entries. By leveraging a linear isomorphism between complex and real vector spaces, we extend key…
We study the $\star$-operator (Larsson et al. 2011) of impartial vector subtraction games (Golomb 1965). Here we extend the notion to the mis\`ere-play convention, and prove convergence and other properties; notably more structure is…
Some misleading statements in a recent paper in PRE are corrected.
In 1901, Bouton proved that a winning strategy of the game of Nim is given by the bitwise XOR, called the nim-sum. But, why does such a weird binary operation work? Led by this question, this paper introduces a categorical reinterpretation…
The note presents a modified proof of a loss bound for the exponentially weighted average forecaster with time-varying potential. The regret term of the algorithm is upper-bounded by sqrt{n ln(N)} (uniformly in n), where N is the number of…
This technical communiqu\'e aims at correcting an erroneous statement (Lemma 2.4) in an earlier paper by the same authors concerning a sufficient condition of uniform observability for a Linear Time-Varying (LTV) system. In this earlier…
In a previous article [N. Delice, F.W. Nijhoff and S. Yoo-Kong, J. Phys. A: Math. Theor. 48(3) (2015), 035206] a novel class of elliptic Lax pairs for integrable lattice equations was introduced. The present article proposes a…
This erratum addresses an error in the text of Lo et al. (2013) and more importantly corrects a computational error that was made in all previously published relativistic computations of absolute pulse waveform fluxes produced by hot spots…
This paper provides a new version of matrix semi-tensor product method based on adjacent transpositions to test symmetric games. The advantage of using adjacent transpositions lies in the great simplification of analysis of symmetric games.…
In this paper, we analyze the mis\`ere versions of two impartial combinatorial games: k-Bounded Greedy Nim and Greedy Nim. We present a complete solution to both games by showing necessary and sufficient conditions for a position to be…
We construct algorithms via binomial approximations for computation of prices of game put options and obtain estimates of approximation errors.