Related papers: On unimodular tournaments
We introduce the Tournament Rank Probability Score (TRPS) as a measure to evaluate and compare pre-tournament predictions, where predictions of the full tournament results are required to be available before the tournament begins. The TRPS…
Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…
We prove that any invariant of a 4-quiver, that is piecewise polynomial, moreover, polynomial for fixed signs of entries, is a function of determinant of a quiver.
In a round-robin tournament, a team may lack the incentive to win if its final rank does not depend on the outcome of the matches still to be played. This paper introduces a classification scheme to determine these weakly (where one team is…
We study statistics of the knockout tournament, where only the winner of a fixture progresses to the next. We assign a real number called competitiveness to each contestant and find that the resulting distribution of prize money follows a…
A tournament is an orientation of a complete graph. We say that a vertex $x$ in a tournament $\vec T$ controls another vertex $y$ if there exists a directed path of length at most two from $x$ to $y$. A vertex is called a king if it…
We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and $2-$structures. We show that, under some axioms, a unique decomposition…
A generalized $N$-sided die is a random variable $D$ on a sample space of $N$ equally likely outcomes taking values in the set of positive integers. We say of independent $N$ sided dice $D_i, D_j$ that $D_i$ beats $D_j$, written $D_i \to…
We define a tournament to be alternation acyclic if it does not contain a cycle in which descents and ascents alternate. Using a result by Athanasiadis on hyperplane arrangements, we show that these tournaments are counted by the median…
Existing match classification models in the tournament design literature have two major limitations: a contestant is considered indifferent only if uncertain future results do never affect its prize, and competitive matches are not…
An edge coloring of a tournament $T$ with colors $1,2,\dots,k$ is called \it $k$-transitive \rm if the digraph $T(i)$ defined by the edges of color $i$ is transitively oriented for each $1\le i \le k$. We explore a conjecture of the second…
We revisit the well-studied problem of designing fair and manipulation-resistant tournament rules. In this problem, we seek a mechanism that (probabilistically) identifies the winner of a tournament after observing round-robin play among…
In the tournament game two players, called Maker and Breaker, alternately take turns in claiming an unclaimed edge of the complete graph on n vertices and selecting one of the two possible orientations. Before the game starts, Breaker fixes…
A multipartite tournament is an orientation of a complete $c$-partite graph. In [L. Volkmann, A remark on cycles through an arc in strongly connected multipartite tournaments, Appl. Math. Lett. 20 (2007) 1148--1150], Volkmann proved that a…
An equivalent directed version of the celebrated unresolved conjecture of Erdos and Hajnal proposed by Alon, Pack, and Solymosi states that for every tournament H there exists epsilon(H)>0 such that every H-free n-vertex tournament T…
In this paper, we study $(1,2)$-step competition graphs of bipartite tournaments. A bipartite tournament means an orientation of a complete bipartite graph. We show that the $(1,2)$-step competition graph of a bipartite tournament has at…
Let $V$ be a simple vertex operator algebra, and $G$ a finite automorphism group of $V$ such that $V^G$ is regular. The definition of entries in $S$-matrix on $V^G$ is discussed, and then is extended. The set of $V^G$-modules can be…
We consider a random knockout tournament among players $1, \ldots, n$, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round…
An oriented graph $\vec{H}$ is said to be tournament anti-Sidorenko if the homomorphism density of $\vec{H}$ in any tournament $\vec{T}$ is bounded above by the homomorphism density of $\vec{H}$ in a large uniformly random tournament. We…
Let $X$ be a finite partially ordered set, $R$ an associative unital ring and $\sigma$ an endomorphism of $R$. We describe some properties of the skew incidence ring $I(X,R,\sigma)$ such as invertible elements, idempotents, the Jacobson…