Related papers: Universal Properties of Some Quivers

This paper is a survey on invariants of representations of quivers and their generalizations. We present the description of generating systems for invariants and relations between generators.

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…

In this paper we construct strong exceptional collections of vector bundles on smooth projective varieties that have a prescribed endomorphism algebra. We prove the construction problem always have a solution. We consider some applications…

Joint degree vectors give the number of edges between vertices of degree $i$ and degree $j$ for $1\le i\le j\le n-1$ in an $n$-vertex graph. We find lower and upper bounds for the maximum number of nonzero elements in a joint degree vector…

A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two…

For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.

We produce full strong exceptional collections consisting of vector bundles on the geometric invariant theory quotient of certain linear actions of a split reductive group $G$ of rank two. The vector bundles correspond to irreducible…

We study real nonsingular projective cubic fourfolds up to deformation equivalence combined with projective equivalence and prove that they are classified by the conjugacy classes of involutions induced by the complex conjugation in the…

Let $C$ be an arrangement of affine hyperplanes in a complex affine space $X$, $D$ the ring of algebraic differential operators on $X$. We define a category of quivers associated with $C$. A quiver is a collection of vector spaces, attached…

We provide a complete classification of all algebras of generalised dihedral type, which are natural generalizations of algebras which occurred in the study of blocks with dihedral defect groups. This gives a description by quivers and…

Two directed graphs are called covariance equivalent if they induce the same set of covariance matrices, up to a Lebesgue measure zero set, on the random variables of their associated linear structural equation models. For acyclic graphs,…

In this paper we describe projective curves and surfaces such that almost all their hyperplane sections are projectively equivalent. Our description is complete for curves and close to being complete for smooth surfaces. In the appendix we…

Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of…

Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…

A complete list of all connected arc-transitive asymmetric digraphs of in-valence and out-valence 2 on up to 1000 vertices is presented. As a byproduct, a complete list of all connected 4-valent graphs admitting a half-arc-transitive group…

A new class of simple symmetric digraphs called $\mathcal{D}$ is defined and studied here. Any digraph in $\mathcal{D}$ has the property that each non-pendant vertex is adjacent to at least one pendant vertex. A graph theoretical…

We prove that every (possibly infinite) graph of degree at most $d$ has a 4-dependent random proper $4^{d(d+1)/2}$-coloring, and one can construct it as a finitary factor of iid. For unimodular transitive (or unimodular random) graphs we…

Recently it has been noticed that many interesting combinatorial objects belong to a class of semigroups called left regular bands, and that random walks on these semigroups encode several well-known random walks. For example, the set of…

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is $k$-linked if, for every…