Related papers: The separating variety for matrix semi-invariants

In recent years, digraph induced generators of quantum dynamical semigroups have been introduced and studied, particularly in the context of unique relaxation and invariance. In this article we define the class of pair block diagonal…

In the case of finite groups, a separating algebra is a subalgebra of the ring of invariants which separates the orbits. Although separating algebras are often better behaved than the ring of invariants, we show that many of the criteria…

For any graph $G=(V,E)$, a subset $S\subseteq V$ is called {\it an isolating set} of $G$ if $V\setminus N_G[S]$ is an independent set of $G$, where $N_G[S]=S\cup N_G(S)$, and {\it the isolation number} of $G$, denoted by $\iota(G)$, is the…

The orthogonal group acts on the space of several $n\times n$ matrices by simultaneous conjugation. For an infinite field of characteristic different from two, relations between generators for the algebra of invariants are described. As an…

In this paper, we study the vector invariants, ${\bf{F}}[m V_2]^{C_p}$, of the 2-dimensional indecomposable representation $V_2$ of the cylic group, $C_p$, of order $p$ over a field ${\bf{F}}$ of characteristic $p$. This ring of invariants…

The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…

A set $S$ of vertices in a graph $G$ is a dominating set if every vertex of $V(G) \setminus S$ is adjacent to a vertex in $S$. A coalition in $G$ consists of two disjoint sets of vertices $X$ and $Y$ of $G$, neither of which is a dominating…

We prove that an invariant subalgebra A_n^W of the Weyl algebra A_n is a Galois order over an adequate commutative subalgebra \Gamma when W is a two-parameters irreducible unitary reflection group G(m,1,n), m\geq 1, n\geq 1, including the…

The separation dimension of a graph $G$ is the smallest natural number $k$ for which the vertices of $G$ can be embedded in $\mathbb{R}^k$ such that any pair of disjoint edges in $G$ can be separated by a hyperplane normal to one of the…

We determine the rings of invariants in the symmetric algebra on the dual of a vector space V over the field of two elements, for the group G of orthogonal transformations preserving a non-singular quadratic form on V. The invariant ring is…

The algebra of invariants of several 3 x 3 matrices under the action of the orthogonal group by simultaneous conjugation is considered over a field of characteristic different from two. The maximal degree of elements of minimal system of…

Let $B$ be an induced complete bipartite subgraph of $G$ on vertex sets of bipartition $B_{X}$ and $B_{Y}$. The subgraph $B$ is {\it generating} if there exists an independent set $S$ such that each of $S \cup B_{X}$ and $S \cup B_{Y}$ is a…

A path separator of a graph $G$ is a set of paths $\mathcal{P}=\{P_1,\ldots,P_t\}$ such that for every pair of edges $e,f\in E(G)$, there exist paths $P_e,P_f\in\mathcal{P}$ such that $e\in E(P_e)$, $f\not\in E(P_e)$, $e\not\in E(P_f)$ and…

The algebra of invariants of d-tuples of n x n skew-symmetric matrices under the action of the orthogonal group by simultaneous conjugation is considered over an infinite field of characteristic different from two. For n=3 and d>0 a minimal…

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

Denote the free group on two letters by F2 and the SL(3,C)-representation variety of F2 by R = Hom(F2, SL(3,C)). There is a SL(3,C)-action on the coordinate ring of R, and the geometric points of the subring of invariants is an affine…

For a graph $G=(V,E)$ with no isolated vertices, a set $D\subseteq V$ is called a semipaired dominating set of G if $(i)$ $D$ is a dominating set of $G$, and $(ii)$ $D$ can be partitioned into two element subsets such that the vertices in…

Consider the action of a subgroup $G$ of the permutation group on the polynomial ring $S := k[x_{1}, \ldots, x_{n}]$ via permutations. We show that if $k$ does not have characteristic two, then the following are independent of $k$: the…

A dominating set of a graph $G$ is a set $D \subseteq V(G)$ such that every vertex in $V(G) \setminus D$ is adjacent to at least one vertex in $D$. A set $L\subseteq V(G)$ is a locating set of $G$ if every vertex in $V(G) \setminus L$ has…