Related papers: The separating variety for matrix semi-invariants

Let Alt_n be the vector space of all alternating n-by-n complex matrices, on which the complex general linear group GL_n acts by $x \mapsto g x g^t$. The aim of this paper is to show that Pfaffian of a certain matrix whose entries are…

Given a finite $n$-element set $X$, a family of subsets ${\mathcal F}\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\mathcal F$. It is shown that if $|\mathcal F|>2^{n-1}$, then one…

Let $K$ be a field of characteristic different from 2 and let $C$ be an octonion algebra over $K$. We show that there is a seven-dimensional subspace of $7\times 7$ skew-symmetric matrices over $K$ which is invariant under the automorphism…

Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…

We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…

Let G be a connected reductive group acting on a finite dimensional vector space V. Assume that V is equipped with a G-invariant symplectic form. Then the ring C[V] of polynomial functions becomes a Poisson algebra. The ring C[V]^G of…

A set $W\subseteq V(G)$ is called a resolving set, if for each two distinct vertices $u,v\in V(G)$ there exists $w\in W$ such that $d(u,w)\neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality…

The catenary degree of an element $n$ of a cancellative commutative monoid $S$ is a nonnegative integer measuring the distance between the irreducible factorizations of $n$. The catenary degree of the monoid $S$, defined as the supremum…

We study the ring R(n,m) of invariants for the left-right action of SL_n \times SL_n on m-tuples of n by n complex matrices. We show that R(3,m) is generated by invariants of degree less equal 309 for all m. Then, we use a combinatorial…

A subset $S$ of the vertices $V$ of a connected graph $G$ resolves $G$ if no two vertices of $V$ share the same list of distances (shortest-path metric) with respect to the vertices of $S$ listed in a given order. The choice of such an $S$…

In this paper, we characterize the dynamic of every abelian subgroups $\mathcal{G}$ of GL($n$, $\mathbb{K}$), $\mathbb{K} = \mathbb{R}$ or $\mathbb{C}$. We show that there exists a $\mathcal{G}$-invariant, dense open set $U$ in…

We explore separable property of the joint numerical range $G(\Bbb R^n)$ of a special class of quadratic functions and apply it to solving the smallest enclosing ball (SEB) problem which asks to find a ball $B(a,r)$ in $\Bbb R^n$ with…

Let $G=(V(G), E(G))$ be an undirected graph with a measure function $\mu$ assigning non-negative values to subgraphs $H$ so that $\mu(H)$ does not exceed the clique cover number of $H$. When $\mu$ satisfies some additional natural…

A separating path system for a graph $G$ is a collection $\mathcal{P}$ of paths in $G$ such that for every two edges $e$ and $f$ in $G$, there is a path in $\mathcal{P}$ that contains $e$ but not $f$. We show that every $n$-vertex graph has…

For a given undirected graph $G$, an \emph{ordered} subset $S = {s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in…

We write $\mathbb P$ for the polynomial algebra in one variable over the finite field $\mathbb Z_2$ and $\mathbb P^{\otimes t} = \mathbb Z_2[x_1, \ldots, x_t]$ for its $t$-fold tensor product with itself. We grade $\mathbb P^{\otimes t}$ by…

Let $V$ be an $n$-dimensional algebraic representation over an algebraically closed field $K$ of a group $G$. For $m > 0$, we study the invariant rings $K[V^{ m}]^G$ for the diagonal action of $G$ on $V^m$. In characteristic zero, a theorem…

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U. A subset W is called a resolving set if every vertex in G is uniquely determined by its…

Covariant or invariant functions under a compact linear group can be expressed in terms of functions defined in the orbit space of the group. The semialgebraic relations defining the orbit spaces of all finite coregular real linear groups…