Related papers: Koszul Algebras and Flow Lattices

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

We show that the number Z of q-edge-colourings of a simple regular graph of degree q is deducible from functions describing dimers on the same graph, viz. the dimer generating function or equivalently the set of connected dimer correlation…

Si Li and author suggested in that, in some cases, the AdS/CFT correspondence can be formulated in terms of the algebraic operation of Koszul duality. In this paper this suggestion is checked explicitly for $M2$ branes in an…

The Bitableax correspondence isomorphism/Koszul map Theorem (BCK Theorem, for short, Theorem 6.5 below) describes a relevant pair of mutually inverse vector space isomorphisms, the Koszul map K : U(gl(n))-> Sym(gl(n)) and the bitableaux…

This paper studies the homotopy theory of algebras and homotopy algebras over an operad. It provides an exhaustive description of their higher homotopical properties using the more general notion of morphisms called infinity-morphisms. The…

Let A, B, S be categories, let F:A-->S and G:B-->S be functors. We assume that for "many" objects a in A, there exists an object b in B such that F(a) is isomorphic to G(b). We establish a general framework under which it is possible to…

Given a standard graded algebra over a field, we consider the relationship between G-quadraticity and the existence of a Koszul filtration. We show that having a quadratic Gr\"obner basis implies the existence of a Koszul filtration for…

We study polytopes defined by inequalities of the form $\sum_{i\in I} z_{i}\leq 1$ for $I\subseteq [d]$ and nonnegative $z_i$ where the inequalities can be reordered into a matrix inequality involving a column-convex $\{0,1\}$-matrix. These…

In this paper, we introduce the class of finitely semi-graded algebras which extends the connected graded algebras finitely generated in degree one. The Koszul behavior of finitely semi-graded algebras is investigated by the distributivity…

In this paper we study finite generation of the Ext algebra of a Brauer graph algebra by determining the degrees of the generators. As a consequence we characterize the Brauer graph algebras that are Koszul and those that are K_2.

The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…

We show that the Koszul functor of a homologically smooth graded gentle algebra can be realized as the half rotation in a geometric model. As a byproduct, we prove an intersection-dim formula involving the Koszul functor.

We explicitly identify the algebra generated by symplectic Fourier-Deligne transforms (i.e. convolution with Kazhdan-Laumon sheaves) acting on the Grothendieck group of perverse sheaves on the basic affine space $G/U$, answering a question…

We prove several theorems concerning Tutte polynomials $T(G,x,y)$ for recursive families of graphs. In addition to its interest in mathematics, the Tutte polynomial is equivalent to an important function in statistical physics, the Potts…

For a positive integer n we introduce quadratic Lie algebras tr_n qtr_n and discrete groups Tr_n, QTr_n naturally associated with the classical and quantum Yang-Baxter equation, respectively. We prove that the universal enveloping algebras…

Let $A$ be an augmented differential graded algebra over a field $k$ of characteristic zero, and let $A^!=\mathbf{R}\mathrm{Hom}_A(k,k)$ be its Koszul dual algebra. Blumberg and Mandell showed that, under some finiteness conditions of $A$,…

We study the algebraic connectivity (or second Laplacian eigenvalue) of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$,…

The lattice of integer flows of a graph is known to determine the graph up to 2-isomorphism (work of Su--Wagner and Caporaso--Viviani). In this paper we give an algorithmic construction of the graphic matroid $\calM(G)$ of a graph $G$,…

Associated with the fundamental representation of a quantum algebra such as $U_q(A_1)$ or $U_q(A_2)$, there exist infinitely many gauge-equivalent $R$-matrices with different spectral-parameter dependences. It is shown how these can be…

The $N$-Koszul algebras are $N$-homogeneous algebras which satisfy an homological property. These algebras are characterised by their Koszul complex: an $N$-homogeneous algebra is $N$-Koszul if and only if its Koszul complex is acyclic.…