Related papers: A Reduction theorem for the $W$-graph decompositio…

For a graph $G$, let $\chi (G)$ denote the chromatic number. In graph theory, the following famous conjecture posed by Hedetniemi has been studied: For two graphs $G$ and $H$, $\chi (G\times H)=\min\{\chi (G),\chi (H)\}$, where $G \times H$…

For a finite Coxeter group $W$ and $w$ an element of $W$ the `excess' of $w$ is defined to be $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, \; x^2 = y^2 = 1\}$ where $\ell$ is the length function on $W$. Here we investigate the…

Let $S\subseteq \mathbb{N}$ be a numerical semigroup with multiplicity $m$, embedding dimension $\nu$ and conductor $c=f+1=qm-\rho$ for some $q,\rho\in\mathbb{N}$ with $\rho<m$. Let Ap$(S,m) = \{w\_0<w_1 < \ldots < w_{m-1}\}$ be the Ap\'ery…

This paper gives a precise structure theorem for the class of graphs which do not contain $W_4$ as an immersion. This strengthens a previous result of Belmonte at al. that gives a rough description of this class. In fact, we prove a…

Assume that we are given a coaction \delta of a locally compact group G on a C*-algebra A and a T-valued Borel 2-cocycle \omega on G. Motivated by the approach of Kasprzak to Rieffel's deformation we define a deformation A_\omega of A.…

In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…

In this paper, we are motivated by the conjectures proposed by C.~Bender \textit{et al.}, \cite{C} in 2024. We have settled the first two conjectures negatively by providing a counter example in \cite{KTJ}, whereas in this paper, we prove…

We prove the long-standing conjecture on the coset construction of the minimal series principal $W$-algebras of $ADE$ types in full generality. We do this by first establishing Feigin's conjecture on the coset realization of the universal…

Tuza's Conjecture states that if a graph $G$ does not contain more than $k$ edge-disjoint triangles, then some set of at most $2k$ edges meets all triangles of $G$. We prove Tuza's Conjecture for all graphs $G$ having no subgraph with…

Given a Coxeter group $W$ with Coxeter system $(W,S)$, where $S$ is finite. We provide a complete characterization of Boolean intervals in the weak order of $W$ uniformly for all Coxeter groups in terms of independent sets of the Coxeter…

We establish versions of Szeg\H{o}'s distance formula and Widom's theorem on invertibility of (a family of) Toeplitz operators in a class of finite codimension subalgebras of uniform algebras, obtained by imposing a finite number of linear…

In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

Let $\mathfrak{X}$ be a class of finite groups closed under taking subgroups, homomorphic images and extensions. It is known that if $A$ is a normal subgroup of a finite group $G$ then the image of an $\mathfrak{X}$-maximal subgroup $H$ of…

We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expansion and from nowhere dense classes. In both cases, the…

In 2006, Bar\'at and Thomassen posed the following conjecture: for each tree $T$, there exists a natural number $k_T$ such that, if $G$ is a $k_T$-edge-connected graph and $|E(G)|$ is divisible by $|E(T)|$, then $G$ admits a decomposition…

In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the…

Erd\H{o}s, Gallai, and Tuza posed the following problem: given an $n$-vertex graph $G$, let $\tau_1(G)$ denote the smallest size of a set of edges whose deletion makes $G$ triangle-free, and let $\alpha_1(G)$ denote the largest size of a…

We define an admissible decomposition of a graph $E$ into subgraphs $F_1$ and $F_2$, and consider the intersection graph $F_1\cap F_2$ as a subgraph of both $F_1$ and $F_2$. We prove that, if the graph $E$ is row finite and its…

We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…