相关论文: Making a tournament indecomposable by one subtourn…

For a fixed finite set of finite tournaments ${\mathcal F}$, the ${\mathcal F}$-free orientation problem asks whether a given finite undirected graph $G$ has an $\mathcal F$-free orientation, i.e., whether the edges of $G$ can be oriented…

The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector space, without placing any restrictions on the dimension of the space or on the base field. We define a…

Bermond and Thomassen conjectured in 1981 that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex-disjoint cycles,here $k$ is a positive integer. Lichiardopol conjectured in 2014 that for every positive integer $k$…

The tensor train decomposition decomposes a tensor into a "train" of 3-way tensors that are interconnected through the summation of auxiliary indices. The decomposition is stable, has a well-defined notion of rank and enables the user to…

A digraph is {\bf eulerian} if it is connected and every vertex has its in-degree equal to its out-degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. A digraph is {\bf semicomplete} if it has no…

We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS)…

Let A be an arbitrary set. For any transformation T (self-map of A) let T(f)(x):=f(T(x)) (for all x in A) be the usual shift operator. A function g is called periodic, i.e., invariant mod T, if Tg=g (=Ig, where I is the identity operator).…

Let $G$ be a graph, and let $u$, $v$, and $w$ be vertices of $G$. If the distance between $u$ and $w$ does not equal the distance between $v$ and $w$, then $w$ is said to resolve $u$ and $v$. The metric dimension of $G$, denoted $\beta(G)$,…

The class of support $\tau$-tilting modules was introduced to provide a completion of the class of tilting modules from the point of view of mutations. In this article we study $\tau$-tilting finite algebras, i.e. finite dimensional…

The Terwilliger algebras of asymmetric association schemes of rank $3$, whose nonidentity relations correspond to doubly regular tournaments, are shown to have thin irreducible modules, and to always be of dimension $4k+9$ for some positive…

The group draw of a sports tournament requires assigning teams to groups of (almost) the same size. The most important criteria for a draw procedure are balance, randomness, and transparency, which could not be satisfied simultaneously if…

We use Block's results to classify irreducible modules over the differential operator algebra $\mathbb{C}[t,t^{-1}, \frac d{dt}]$. From this classification and using "the twisting technique" we construct a lot of new irreducible modules…

We investigate tournaments with a specified score vector having additional structure: loopy tournaments in which loops are allowed, Hankel tournaments which are tournaments symmetric about the Hankel diagonal (the anti-diagonal), and…

Havet and Thomass\'{e} proved that every tournament of order $n\geq 8$ contains every oriented Hamiltonian path, which was conjectured by Rosenfeld. Recently, it was shown that in any tournament $T$ of order $n\geq 8$, there exists an arc…

Let $T$ be a strongly connected tournament of order $n\ge 4$ whose diameter does not exceed $d\ge 3.$ Denote by $c_{\ell}(T)$ the number of circuits of length $\ell$ in $T.$ In our recent paper, we construct a strongly connected tournament…

Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…

Let V be a simple vertex operator algebra satisfying the following conditions: (i) The homogeneous subspaces of V of weights less than 0 are 0, the homogeneous subspace of V of weight 0 is spanned by the vacuum and V' is isomorphic to V as…

The score set of a tournament is defined as the set of its distinct out-degrees. In 1978, Reid proposed the conjecture that for any set of nonnegative integers $D$, there exists a tournament $T$ with a degree set $D$. In 1989, Yao presented…

Continuing the program begun in the first paper of this series, we present a pair of non-reconstructable tournament on $p$ vertices for each $p=2^n \ge 4$.

We prove the Verlinde conjecture in the following general form: Let V be a simple vertex operator algebra satisfying the following conditions: (i) The homogeneous subspaces of V of weights less than 0 are 0, the homogeneous subspace of V of…