Related papers: A note on Gorenstein monomial curves
Relations between Gorenstein derived categories, Gorenstein defect categories and Gorenstein stable categories are established. Using these, the Gorensteinness of an algebra $A$ and invariants with respect to recollements of the bounded…
For a vector space $V$ the \emph{intersection graph of subspaces} of $V$, denoted by $G(V)$, is the graph whose vertices are in a one-to-one correspondence with proper nontrivial subspaces of $V$ and two distinct vertices are adjacent if…
Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed in 1878 for each graph with possible multiple edges but without loops its symmetrized graph monomial which is a polynomial in the vertex labels…
Let $\mathcal A=\{A_1,\ldots,A_n\}$ be a family of sets in the plane. For $0 \leq i < n$, denote by $f_i$ the number of subsets $\sigma$ of $\{1,\ldots,n\}$ of cardinality $i+1$ that satisfy $\bigcap_{i \in \sigma} A_i \neq \emptyset$. Let…
A curve in the plane is $x$-monotone if every vertical line intersects it at most once. A family of curves are called pseudo-segments if every pair of them have at most one point in common. We construct $2^{\Omega(n^{4/3})}$ families, each…
If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$ in the graph $G$, then it is called the independence polynomial of $G$ (Gutman and Harary, 1983). Let $a$ be the size of a…
Many combinatorial matrices --- such as those of binomial coefficients, Stirling numbers of both kinds, and Lah numbers --- are known to be totally non-negative, meaning that all minors (determinants of square submatrices) are non-negative.…
A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…
Let $f,g:\cc^2\ra\cc$ be two quasi-homogeneous polynomials. We compute the $V$-filtration of the restriction of $f$ to any plane curve $C_t=g^{-1}(t)$ and show that the Gorenstein generator $dx\wedge dy/dg$ is a primitive form. Using…
A homogeneous set of an $n$-vertex graph is a set $X$ of vertices ($2\le |X|\le n-1$) such that every vertex not in $X$ is either complete or anticomplete to $X$. A graph is called prime if it has no homogeneous set. A chain of length $t$…
We generalize the monomorphism category from quiver (with monomial relations) to arbitrary finite dimensional algebras by a homological definition. Given two finite dimension algebras $A$ and $B$, we use the special monomorphism category…
Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…
Given the germ of a smooth plane curve $(\{f(x,y)=0\},0)\subset (\mathbb{K}^2,0), \mathbb{K}=\mathbb{R}, \mathbb{C}$, with an isolated singularity, we define two invariants $I_f$ and $V_f \in \mathbb{N} \cup\{\infty\}$, which count the…
We show that there exist functions $c$ and $g$ such that, if $k$, $n$ and $d$ are positive integers with $d> g(n)$ and $\Gamma$ is a $d$-valent $2$-arc-transitive graph of order $kp^n$ with $p$ a prime, then $p\leqslant kc(d)$. In other…
It is a well-known result that a stable curve of compact type over $\mathbb{C}$ having two components is hyperelliptic if and only if both components are hyperelliptic and the point of intersection is a Weierstrass point for each of them.…
If for any $k$ the $k$-th coefficient of a polynomial $I(G;x)$ is equal to the number of stable sets of cardinality $k$ in the graph $G$, then it is called the independence polynomial of $G$ (Gutman and Harary, 1983). Alavi, Malde, Schwenk…
Let $\Lambda$ be the path algebra of a finite quiver $Q$ over a finite-dimensional algebra $A$. Then $\Lambda$-modules are identified with representations of $Q$ over $A$. This yields the notion of monic representations of $Q$ over $A$. If…
If $G$ is a finite group, then the spectrum $\omega(G)$ is the set of all element orders of $G$. The prime spectrum $\pi(G)$ is the set of all primes belonging to $\omega(G)$. A simple graph $\Gamma(G)$ whose vertex set is $\pi(G)$ and in…
The classification of complete multipartite graphs whose edge rings are nearly Gorenstein as well as that of finite perfect graphs whose stable set rings are nearly Gorenstein is achieved.
Stanley proved that, in characteristic zero, all artinian monomial complete intersections have the strong Lefschetz property. We provide a positive characteristic complement to Stanley's result in the case of artinian monomial complete…