Related papers: Erratum to: "Remarks on the second neighborhood pr…

The score sequence of a tournament is the sequence of the out-degrees of its vertices arranged in nondecreasing order. The problem of counting score sequences of a tournament with $n$ vertices is more than 100 years old (MacMahon 1920). In…

Recently, we discovered a mistake in our Letter on phase dynamics in granular d-wave superconductors, which we corrected in an Erratum published last week. This is an expanded version of the Erratum, containing details and supporting…

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…

A long-standing conjecture of Kelly states that every regular tournament on n vertices can be decomposed into (n-1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large n. In fact, we prove a far more general result, based on…

This note corrects a technical error in the ACM Computing Surveys paper mentioned in the title. The flaw involved constructions for showing that timed automata with urgent locations have the same expressiveness as timed automata that allow…

We show that if $D$ is a tournament of arbitrary size then $D$ has finite strong components after reversing a locally finite sequence of cycles. In turn, we prove that any tournament can be covered by two acyclic sets after reversing a…

In this paper, we show that the stability analysis in the paper A note on stability of fractional logistic maps, Appl. Math. Lett. 125 (2022) 107787 is incorrect and repeat a proof of a theorem on the convergence of a convolution of the…

Sumner's universal tournament conjecture states that any tournament on $2n-2$ vertices contains a copy of any directed tree on $n$ vertices. We prove an asymptotic version of this conjecture, namely that any tournament on $(2+o(1))n$…

Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability, i.e. how "much" it is attacked by other arguments. Many different gradual semantics have been proposed in the literature, each…

We prove a conjecture by Aboulker, Charbit and Naserasr by showing that every oriented graph in which the out-neighborhood of every vertex induces a transitive tournament can be partitioned into two acyclic induced subdigraphs. We prove…

Theorem 6.1.1 of [H.A.H.A.] on the existence of a model structure on the category of operads is not valid in the generality claimed. We present here a counter-example (due to B. Fresse) and a corrected version of the theorem.

We exposit two previously unpublished theorems of Leo Harrington. The first theorem says that there exist arithmetical singletons which are arithmetically incomparable. The second theorem says that there exists a ranked point which is not…

The purpose of this erratum is to fill a gap in the proof of the `Composite Braid Theorem' in the manuscript "Studying Links Via Closed Braids IV: Composite Links and Split Links (SLVCB-IV)", Inventiones Math, \{bf 102\} Fasc. 1 (1990),…

The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism problems for signed graphs. Signed graphs arise naturally in many…

For a fixed simple digraph $H$ without isolated vertices, we consider the problem of deleting arcs from a given tournament to get a digraph which does not contain $H$ as an immersion. We prove that for every $H$, this problem admits a…

We find it necessary to advise the interested and active instructor of Physics on the wrongness of some computations in the aforementioned article. Surprisingly, the Journal refuses to even publish an erratum on the paper, which naturally…

In this article, we give a counter-example to Lemma 12 of the article "On Operations and Linear Extensions of Well Partially Ordered Sets" by Maciej Malicki and Aleksander Rutkowski.

In the well-studied metric distortion problem in social choice, we have voters and candidates located in a shared metric space, and the objective is to design a voting rule that selects a candidate with minimal total distance to the voters.…

Combining the representations of the words that make up a sentence into a cohesive whole is difficult, since it needs to account for the order of words, and to establish how the words present relate to each other. The solution we propose…

For two integers $n\geq 3$ and $2\leq p\leq n$, we denote $D(n,p)$ the digraph obtained from a directed $n$-cycle by changing the orientations of $p-1$ consecutive arcs. In this paper, we show that a family of $k$-regular $(k\geq 3)$…