Related papers: Making a tournament indecomposable by one subtourn…

We study the problem of indecomposability of translations of simple modules in the principal block of BGG category $\mathcal{O}$ for $\mathfrak{sl}_n$, as conjectured in \cite{KiM}. We describe some general techniques and prove a few…

A ring $R$ is said to be i-reversible if for every $a,b$ $\in$ $R$, $ab$ is a non-zero idempotent implies $ba$ is an idempotent. It is known that the rings $M_n(R)$ and $T_n(R)$ (the ring of all upper triangular matrices over $R$) are not…

Given $a,b,c\in\mathbb N$, let $D_{a,b,c}$ be the tournament on $a+b+c$ vertices obtained by replacing the vertices of the directed triangle $C_3$ with transitive tournaments $TT_a$, $TT_b$, and $TT_c$, respectively. Keevash and Sudakov…

A fundamental property of choice functions is stability, which, loosely speaking, prescribes that choice sets are invariant under adding and removing unchosen alternatives. We provide several structural insights that improve our…

The celebrated Erd\"{o}s-Hajnal conjecture 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 contains a clique or…

Let $\Lambda $ be an artin algebra and $T$ a $\tau$-tilting $\Lambda$-module. We prove that $T$ is a tilting module if and only if ${\rm Ext}_{\Lambda}^{i}(T,\Fac T)=0$ for all $i\geq 1$, where $\Fac T$ is the full subcategory consisting of…

A tournament is a directed graph T such that every pair of vertices are connected by an arc. A feedback vertex set is a set S of vertices in T such that T - S is acyclic. In this article we consider the Feedback Vertex Set problem in…

We prove the existence of a function $h(k)$ such that every simple digraph with minimum outdegree greater than $h(k)$ contains an immersion of the transitive tournament on $k$ vertices. This solves a conjecture of Devos, McDonald, Mohar and…

A Walecki tournament is any tournament that can be formed by choosing an orientation for each of the Hamilton cycles in the Walecki decomposition of a complete graph on an odd number of vertices. In this paper, we show that if some arc in a…

Suppose that $G$ is a finite solvable group and $V$ is a finite, faithful and completely reducible $G$-module. Let $N$ be a nilpotent subgroup of $G$, then there exits $v \in V$ such that $|\bC_N(v)| \leq (|N|/p)^{1/p}$, where $p$ is the…

We study a high-dimensional analog for the notion of an acyclic (aka transitive) tournament. We give upper and lower bounds on the number of $d$-dimensional $n$-vertex acyclic tournaments. In addition, we prove that every $n$-vertex…

In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the concept of a vertex splittable ideal and show that a simplicial complex $\Delta$ is vertex decomposable if and only if $I_{\Delta^{\vee}}$…

A rotational subset, relative to a continuous transformation $T: \mathbb{T} \to \mathbb{T}$ on the unit circle, is a closed, invariant subset of $\mathbb{T}$ that is minimal and on which $T$ respects the standard orientation of the unit…

In this paper we discuss the structure of the tensor product V'_{\alpha,\beta}\otimes L(c,h) of irreducible module from intermediate series and irreducible highest weight module over the Virasoro algebra. We generalize Zhang's…

A directed graph where there is exactly one edge between every pair of vertices is called a {\em tournament}. Finding the "best" set of vertices of a tournament is a well studied problem in social choice theory. A {\em tournament solution}…

We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…

Let $V$ be a strongly rational vertex operator algebra, and let $g_1, g_2, g_3$ be three commuting finitely ordered automorphisms of $V$ such that $g_1g_2=g_3$ and $g_i^T=1$ for $i=1, 2, 3$ and $T\in \N$. Suppose $M^1$ is a $g_1$-twisted…

The orientation completion problem for a class of oriented graphs asks whether a given partially oriented graph can be completed to an oriented graph in the class by orienting the unoriented edges of the partially oriented graph.…

Let $A$ be an artinian algebra, and let $\mathcal{C}$ be a subcategory of mod$A$ that is closed under extensions. When $\mathcal{C}$ is closed under kernels of epimorphisms (or closed under cokernels of monomorphisms), we describe the…

Given a simple, undirected graph $G$ with a threshold function $\tau:V(G) \rightarrow \mathbb{N}$, the \textsc{Target Set Selection} (TSS) problem is about choosing a minimum cardinality set, say $S \subseteq V(G)$, such that starting a…