Related papers: Diagrammatic Categories which arise from Represent…

Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…

We develop the general formalism of approximable triangulated categories, and prove two representability theorems.

Working in the framework of $(T, V)$-categories, for a symmetric monoidal closed category $V$ and a (not necessarily cartesian) monad $T$, we present a common account to the study of ordered compact Hausdorff spaces and stably compact…

We use the theory of approximable triangulated categories to give a condition for a proper DG-category to be reflexive in the sense of Kuznetsov and Shinder. To do this we provide another description of the completion of an approximable…

Since the seminal result of Karger, Motwani, and Sudan, algorithms for approximate 3-coloring have primarily centered around SDP-based rounding. However, it is likely that important combinatorial or algebraic insights are needed in order to…

Consider the real vector space of formal sums of non-empty, finite unoriented graphs without multiple edges and loops. Let the vertices of graphs be unlabelled but let every graph $\gamma$ be endowed with an ordered set of edges…

Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…

We study the relationship between derived categories of factorizations on gauged Landau-Ginzburg models related by variations of the linearization in Geometric Invariant Theory. Under assumptions on the variation, we show the derived…

Modular tensor categories are generalizations of the representation categories of quantum groups at roots of unity axiomatizing the properties necessary to produce 3-dimensional TQFTs. Although other constructions have since been found,…

Let k be an algebraically closed field of characteristic zero, F its algebraically closed extension, and G be the group of k-automorphisms of F endowed with a natural topology. One of the purposes of this paper is to show that any…

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

The interplay between groups and graphs have been the most famous and productive area of algebraic graph theory. In this paper, we introduce and study the graphs whose vertex set is group G such that two distinct vertices a and b having…

In a directed graph $D$, a vertex subset $S\subseteq V$ is a total dominating set if every vertex of $D$ has an in-neighbor from $S$. A total dominating set exists if and only if every vertex has at least one in-neighbor. We call the…

We prove that for any presentably symmetric monoidal $\infty$-category $\mathcal{V}$, the $\infty$-category $\mathbf{Mod}_\mathcal{V}(\mathbf{Pr}^{\mathrm{L}})^{\mathrm{dbl}}$ of dualizable presentable $\mathcal{V}$-modules and internal…

Let G be a unipotent algebraic group over an algebraically closed field k of characteristic p > 0 and let l be a prime different from p. Let e be a minimal idempotent in D_G(G), the braided monoidal category of G-equivariant (under…

Graphs are important data representations for describing objects and their relationships, which appear in a wide diversity of real-world scenarios. As one of a critical problem in this area, graph generation considers learning the…

Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…

We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…

The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…

To each finite frame $\varphi$ in an inner product space $\mathcal{H}$ we associate a simple graph $G(\varphi)$, called {\it frame graph}, with the vectors of the frame as vertices and there is an edge between vertices $f$ and $g$ provided…