Related papers: Erratum to: Lattice point methods for combinatoria…
In this paper we present a new proof of a proposition presented in the article: Complexes of tournaments, directionality filtrations and persistent homology. This paper is part of Joaqu\'in Casta\~neda's undergraduate thesis.
This note contains a correction to the paper, ``Local contribution to the Lefschetz fixed point formula'', Inv. Math. 111 (1993), pp. 1-33.
We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…
It has been pointed out to the author by David Glickenstein that the proof of the (closely related) Lemmas 1.2 and 3.2 in the title paper is incorrect. The statements of both Lemmas are correct, and the purpose of this note is to give a…
This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…
This note covers two parts. The first one provides an errata to the paper "Numerical and analytical modeling of busbar systems". We mainly give the correction for three equations affected by a typographical mistake. Despite the corrections…
The first paper is an invited comment on arXiv:1110.5527 presented at Hypercomplex Seminar 2012 and on sixteen earlier published papers by Zhidong Zhang and Norman H. March. All these works derive from an erroneous solution of the…
In our paper "Dendroidal sets as models for homotopy operads" (J. Topol. 4 (2011), no. 2, 257-299, and arXiv:0902.1954), we made the wrong claim about the behaviour of the tensor product with respect to cofibrations of dendroidal sets. We…
Theorem 2 of A. Kercheval, "Denjoy minimal sets are far from affine", Ergodic Theory and Dynamical Systems 22 (2002), 1803-1812 is corrected by adding a C^2 bound to the hypotheses.
We study combinatorial games under mis\`ere convention. Several sets of games have been considered earlier to better understand the behaviour of mis\`ere games. We here connect several of these sets. In particular, we prove that comparison…
This paper continues a series discussing flaws in published assertions concerning fixed points in digital images.
We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…
We correct the statements and proofs of the (auxiliary) Propositions 4.1 and 4.2 of our paper `Evaluation of motivic functions, non-nullity, and integrability in fibers' in Advances in Mathematics, Vol. 409, Part A, Paper No. 108635, 29…
Many analysis and verifications tasks, such as static program analyses and model-checking for temporal logics reduce to the solution of systems of equations over suitable lattices. Inspired by recent work on lattice-theoretic progress…
A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning optimal outcomes were resolved. By generalizing standard game…
Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
We correct a mistake in the paper "On the cuspidal cohomology of $S$-arithmetic subgroups of reductive groups over number fields " by A. Borel, J.-P. Labesse, J. Schwermer that appeared in Compositio Mathematica, 102 (1996), 1-40.
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
The expression for $\hat{\kappa}$ in J. Math. Phys. 36, 3191 (1995) was miswritten. The correct expression is given.