Related papers: Making a tournament indecomposable by one subtourn…

We prove the following conjecture of Leighton and Moitra. Let $T$ be a tournament on $[n]$ and $S_n$ the set of permutations of $[n]$. For an arc $uv$ of $T$, let $A_{uv}=\{\sigma \in S_n \, : \, \sigma(u)<\sigma(v) \}$. $\textbf{Theorem.}$…

We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an…

We describe computer searches that prove the graph reconstruction conjecture for graphs with up to 13 vertices and some limited classes on larger sizes. We also investigate the reconstructibility of tournaments up to 13 vertices, digraphs…

A cycle C={v_1,v_2,....,v_1} in a tournament T is said to be even, if when walking along C, an even number of edges point in the wrong direction, that is, they are directed from v_{i+1} to v_i. In this short paper, we show that for every…

Ladder tournaments are widely used to rank individuals in real-world organizations and games. Their mathematical properties however are still poorly understood. We formalize the ranking rule generated by a ladder tournament, and we show…

Let $G$ be a simple classical algebraic group over an algebraically closed field $K$ of characteristic $p \ge 0$ with natural module $W$. Let $H$ be a closed subgroup of $G$ and let $V$ be a non-trivial irreducible tensor-indecomposable…

Let $\mathfrak{s}$ $\ltimes$ $\mathfrak{r}$ be a Levi decomposable Lie algebra, with Levi factor $\mathfrak{s}$, and radical $\mathfrak{r}$. A module $V$ of $\mathfrak{s}$ $\ltimes$ $\mathfrak{r}$ is cyclic indecomposable if it is…

We prove the first nontrivial reconstruction theorem for modular tensor categories: the category associated to any twisted Drinfeld double of any finite group, can be realised as the representation category of a completely rational…

Single-elimination (SE) tournaments are a popular format used in competitive environments and decision making. Algorithms for SE tournament manipulation have been an active topic of research in recent years. In this paper, we initiate the…

A directed graph $R^{\circ}$ on a set $X$ is a set of ordered pairs of distinct points called \emph{arcs}. It is a tournament when every pair of distinct points is connected by an arc in one direction or the other (and not both). We can…

Let A be a tame quasi-tilted algebra and d the dimension vector of an indecomposable A-module. In the paper we prove that each irreducible component of the variety of A-modules of dimension vector d is regular in codimension one.

The main objective of this project is to determine all irreducible modules of a given modular Lie algebra. In contrast to ordinary Lie algebras, modular Lie algebras require an additional structure known as the p-mapping. The minimal…

The dimension of any module over an algebra of affiliated operators ${\mathcal U}$ of a finite von Neumann algebra ${\mathcal A}$ is defined using a trace on ${\mathcal A}.$ All zero-dimensional ${\mathcal U}$-modules constitute the torsion…

In the problem {\sc Min-DESC}, we are given a digraph $D$ and an integer $k$, and asked if there exists a set $A'$ of at most $k$ arcs in $D$, such that if we remove the arcs of $A'$, in the resulting digraph every strong component is…

We consider the manipulability of tournament rules which map the results of $\binom{n}{2}$ pairwise matches and select a winner. Prior work designs simple tournament rules such that no pair of teams can manipulate the outcome of their match…

The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. A directed graph is said to support M if its adjacency matrix is the pattern of M. If M is an orthogonal matrix, then a digraph which supports M…

A non-empty subset $S$ of the vertices of a digraph $D$ is called a {\it safe set} if \begin{itemize} \item[(i)] for every strongly connected component $M$ of $D-S$, there exists a strongly connected component $N$ of $D[S]$ such that there…

We study the asymptotic behavior of the maximum number of directed cycles of a given length in a tournament: let $c(\ell)$ be the limit of the ratio of the maximum number of cycles of length $\ell$ in an $n$-vertex tournament and the…

Let $X$ be a nonempty set and $\mathcal{P}=\{X_i\colon i\in I\}$ a partition of $X$. Denote by $T(X)$ the full transformation semigroup on $X$, and $T(X, \mathcal{P})$ the subsemigroup of $T(X)$ consisting of all transformations that…

Let $a, b$ and $n$ be nonnegative integers $(b \geq a, \ b > 0, \ n \geq 1)$, $\mathcal{G}_n(a,b)$ be a multigraph on $n$ vertices in which any pair of vertices is connected with at least $a$ and at most $b$ edges and \textbf{v =} $(v_1,…