Related papers: On tournaments combinatorics
In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…
The paper presents an enriched categorical account of homological perturbation theory, including the formulation, proof and functoriality properties of the homological perturbation lemma.
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
Sumner's universal tournament conjecture states that any tournament on $2n-2$ vertices contains any directed tree on $n$ vertices. In this paper we prove that this conjecture holds for all sufficiently large $n$. The proof makes extensive…
Competitive tournaments appear in sports, politics, population ecology, and animal behavior. All of these fields have developed methods for rating competitors and ranking them accordingly. A tournament is intransitive if it is not…
We consider sequences of absolute and relative homology and cohomology groups that arise naturally for a filtered cell complex. We establish algebraic relationships between their persistence modules, and show that they contain equivalent…
In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games. In this paper we give a detailed, self-contained and slightly-updated account of the…
As a directed analog of Sidorenko's conjecture in extremal graph theory, Fox, Himwich, Zhou, and the second author defined an oriented graph $H$ to be tournament Sidorenko (anti-Sidorenko) if the random tournament asymptotically minimizes…
We study a high-dimensional analog for the notion of an acyclic (aka transitive) tournament. We give upper and lower bounds on the number of $d$-dimensional $n$-vertex acyclic tournaments. In addition, we prove that every $n$-vertex…
This thesis will be discussing scoring play combinatorial games and looking at the general structure of these games under different operators. I will also be looking at the Sprague-Grundy values for scoring play impartial games, and…
Knockout tournaments, also known as single-elimination or cup tournaments, are a popular form of sports competitions. In the standard probabilistic setting, for each pairing of players, one of the players wins the game with a certain (a…
This is the final version of the 2007 preprint titled "On the derived category of 1-motives, I". It has been substantially expanded to contain a motivic proof of (two thirds of) Deligne's conjecture on 1-motives with rational coefficients,…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
Several conjectural continued fractions found with the help of various algorithms are published in this paper.
Let $D$ be a $k$-regular bipartite tournament on $n$ vertices. We show that, for every $p$ with $2 \le p \le n/2-2$, $D$ has a cycle $C$ of length $2p$ such that $D \setminus C$ is hamiltonian unless $D$ is isomorphic to the special digraph…
In this article, we consider some simple combinatorial game and a winning strategy in this game. This game is then used to prove several known results about non-repetitive sequences and approximations with denominators from a lacunary…
A digraph $D$ is called \emph{path extendable} if for every nonhamiltonian (directed) path $P$ in $D$, there exists another path $P^\prime$ with the same initial and terminal vertices as $P$, and $V(P^\prime) = V (P)\cup \{w\}$ for a vertex…
We consider the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments. We prove that for every simple digraph $H$, $k\in \mathbb{N}$, and tournament $T$, the following statements hold: (i) If in $T$ one cannot find…