Related papers: Making a tournament indecomposable by one subtourn…

Isaak posed the following problem. Suppose $T$ is a tournament having a minimum feedback arc set which induces an acyclic digraph with a hamiltonian path. Is it true that the maximum number of arc-disjoint cycles in $T$ equals the…

In arXiv:1811.04649, we extended the Dong-Mason theorem on irreducibility of modules for cyclic orbifold vertex algebras to the entire category weak modules and applied this result to Whittaker modules. In this paper we present further…

Let $G$ be a simple algebraic group over an algebraically closed field $K$ of characteristic $p\geqslant 0$, let $H$ be a proper closed subgroup of $G$ and let $V$ be a nontrivial irreducible $KG$-module, which is $p$-restricted, tensor…

Tournaments are widely used models to represent pairwise dominance between candidates, alternatives, or teams. We study the problem of providing certified explanations for why a candidate appears among the winners under various tournament…

We consider in this paper the family of triples $(V, T, U),$ where $ V$ is a finite dimensional space, $T $ is a nilpotent linear operator on $V$ and $U $ is an invariant subspace of $T$. Denote $[U]= ker(T_{|U})$, and $n_U= dim([U] )$. Our…

We show that a tilted algebra $A$ is tame if and only if for each generic root $\dd$ of $A$ and each indecomposable irreducible component $C$ of $\module(A,\dd)$, the field of rational invariants $k(C)^{\GL(\dd)}$ is isomorphic to $k$ or…

Suppose $V^G$ is the fixed-point vertex operator subalgebra of a compact group $G$ acting on a simple abelian intertwining algebra $V$. We show that if all irreducible $V^G$-modules contained in $V$ live in some braided tensor category of…

For a finite dimensional representation $V$ of a group $G$ over a field $F$, the degree of reductivity $\delta(G,V)$ is the smallest degree $d$ such that every nonzero fixed point $v\in V^{G}\setminus\{0\}$ can be separated from zero by a…

In the Feedback Arc Set in Tournaments (Subset-FAST) problem, we are given a tournament $D$ and a positive integer $k$, and the objective is to determine whether there exists an arc set $S \subseteq A(D)$ of size at most $k$ whose removal…

A well-known theorem of Chung and Graham states that if $h\geq 4$ then a tournament $T$ is quasirandom if and only if $T$ contains each $h$-vertex tournament the "correct number" of times as a subtournament. In this paper we investigate the…

Let A be a commutative ring, and let \a = \frak{a} be a finitely generated ideal in it. It is known that a necessary and sufficient condition for the derived \a-torsion and \a-adic completion functors to be nicely behaved is the weak…

Let V be a simple vertex operator algebra and G a finite automorphism group of V such that V^G is regular. It is proved that every irreducible V^G-module occurs in an irreducible g-twisted V-module for some g in G. Moreover, the quantum…

A tournament $H$ is said to force quasirandomness if it has the property that a sequence $(T_n)_{n\in \mathbb{N}}$ of tournaments of increasing orders is quasirandom if and only if the homomorphism density of $H$ in $T_n$ tends to…

Given a graph $G=(V,E)$, a subset $X$ of $V$ is an interval of $G$ provided that for any $a, b\in X$ and $ x\in V \setminus X$, $\{a,x\}\in E$ if and only if $\{b,x\}\in E$. For example, $\emptyset$, $\{x\}(x\in V)$ and $V$ are intervals of…

In a digraph $D$, an arc $e=(x,y) $ in $D$ is considered transitive if there is a path from $x$ to $y$ in $D- e$. A digraph is transitive-free if it does not contain any transitive arc. In the Transitive-free Vertex Deletion (TVD) problem,…

A {\em bipartite tournament} is a directed graph $T:=(A \cup B, E)$ such that every pair of vertices $(a,b), a\in A,b\in B$ are connected by an arc, and no arc connects two vertices of $A$ or two vertices of $B$. A {\em feedback vertex set}…

Given a tournament T and a positive integer k, the C_3-Pakcing-T problem asks if there exists a least k (vertex-)disjoint directed 3-cycles in T. This is the dual problem in tournaments of the classical minimal feedback vertex set problem.…

An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…

Aboulker, Aubian, Charbit, and Lopes (2023) defined the clique number of a tournament to be the minimum clique number of one of its backedge graphs. Here we show that if $T$ is a tournament of sufficiently large clique number, then $T$…

Both the original Temperley-Lieb algebras $\mathsf{TL}_{n}$ and their dilute counterparts $\mathsf{dTL}_{n}$ form families of filtered algebras: $\mathsf{TL}_{n}\subset \mathsf{TL}_{n+1}$ and $\mathsf{dTL}_{n}\subset\mathsf{dTL}_{n+1}$, for…