Related papers: On unimodular tournaments
Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller games, McNaughton games, Muller games, Rabin games, and Streett games. These games are played on directed…
The Day Reflection Theorem gives conditions under which a reflective subcategory of a closed monoidal category can be equipped with a closed monoidal structure in such a way that the reflection adjunction becomes a monoidal adjunction. We…
We show that every principal submatrix of a square matrix $A$ with only entries in $\{0,1,-1\}$ has even rank if and only if $A$ is skew-symmetric up to multiplication of rows/columns by $-1$.
The set of (ordered) score sheets of a round-robin football tournament played between $n$ teams together with the pointwise addition has the structure of an affine monoid. In this paper we study (using both theoretical and computational…
A single-elimination (SE) tournament is a popular way to select a winner in both sports competitions and in elections. A natural and well-studied question is the tournament fixing problem (TFP): given the set of all pairwise match outcomes,…
The sequence counting the number of unique tournaments with n people is the same as the sequence counting non-tracking binary strings corresponding to n-2 radar observations with the tracking rule "3 out of 5 with loss 2." This fact allows…
We show that the class of all finite regular tournaments is cofinal in the class of finite tournaments. In addition, we establish cofinality results for certain special subclasses of regular tournaments. We also provide an algorithm for…
This note is concerned with isometries on the spaces of self-adjoint traceless matrices. We compute the group of isometries with respect to any unitary similarity invariant norm. This completes and extends the result of Nagy on Schatten…
We say that a digraph $D$ is $(i,j)$-step competitive if any two vertices have an $(i,j)$-step common out-neighbor in $D$ and that a graph $G$ is $(i,j)$-step competitively orientable if there exists an $(i,j)$-step competitive orientation…
A tournament organizer must select one of $n$ possible teams as the winner of a competition after observing all $\binom{n}{2}$ matches between them. The organizer would like to find a tournament rule that simultaneously satisfies the…
Let $S$ be a unital associative ring and $S[t;\sigma,\delta]$ be a skew polynomial ring, where $\sigma$ is an injective endomorphism of $S$ and $\delta$ a left $\sigma$-derivation. For each $f\in S[t;\sigma,\delta]$ of degree $m>1$ with a…
Tournaments are a widely used mechanism to rank alternatives in a noisy environment. This paper investigates a fundamental issue of economics in tournament design: what is the best usage of limited resources, that is, how should the…
The group stage of a sports tournament is often made more appealing by introducing additional constraints in the group draw that promote an attractive and balanced group composition. For example, the number of intra-regional group matches…
An $n\times n$ complex matrix $A$ is called coninvolutory if $\bar AA=I_n$ and skew-coninvolutory if $\bar AA=-I_n$ (which implies that $n$ is even). We prove that each matrix of size $n\times n$ with $n>1$ is a sum of 5 coninvolutory…
We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of…
A celebrated unresolved conjecture of Erd\"{o}s and Hajnal states that for every undirected graph $H$ there exists $ \epsilon(H) > 0 $ such that every undirected graph on $ n $ vertices that does not contain $H$ as an induced subgraph…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
Let $RG$ be the group ring of a finite group $G$ over a commutative ring $R$ with $1$. An element $x$ in $RG$ is said to be skew-symmetric with respect to an involution $\sigma$ of $RG$ if $\sigma(x)=-x.$ A structure theorem for the…
We consider the manipulability of tournament rules, in which $n$ teams play a round robin tournament and a winner is (possibly randomly) selected based on the outcome of all $\binom{n}{2}$ matches. Prior work defines a tournament rule to be…
We study the tensor product $V$ of any number of "elementary" irreducible modules over the Yangian of the general linear Lie algebra. An elementary module is determined by a skew Young diagram and by a complex parameter, and contains a…