Related papers: Invariant polynomials, gaps, and sparseness

We introduce the notion of porous invariants for multipath (or branching/nondeterministic) affine loops over the integers; these invariants are not necessarily convex, and can in fact contain infinitely many 'holes'. Nevertheless, we show…

We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…

For modular indecomposable representations of a cyclic group $G$ of prime order $p$ we propose a list of polynomial invariants of degree $\leq 3$ that, together with a simple invariant of degree $p$, separate generic orbits and generate the…

In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…

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…

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…

Let $G\subset SO(4)$ denote a finite subgroup containing the Heisenberg group. In these notes we classify all these groups, we find the dimension of the spaces of $G$-invariant polynomials and we give equations for the generators whenever…

We generalize the index polynomial invariant to the case of virtual tangles. Three polynomial invariants result from this generalization; we give a brief overview of their definition and some basic properties.

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

We study a new biholomorphic invariant of holomorphic maps between domains in different dimensions based on generic initial ideals. We start with the standard generic monomial ideals to find invariants for rational maps of spheres and…

We investigate actions of cyclic groups on polynomial rings with two variables, and the minimal free resolution of the corresponding invariant ring. In particular, we fully classify several cases, including the case the defining ideal has…

A long-standing question is what invariant sets can be shared by two maps acting on the same space. A similar question stands for invariant measures. A particular interesting case are expanding Markov maps of the circle. If the two involved…

First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…

Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…

In a polydiagonal subspace of the Euclidean space, certain components of the vectors are equal (synchrony) or opposite (anti-synchrony). Polydiagonal subspaces invariant under a matrix have many applications in graph theory and dynamical…

Recently continuous rational maps between real algebraic varieties have attracted the attention of several researchers. In this paper we continue the investigation of approximation properties of continuous rational maps with values in…

Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

We introduce invariant rings for forms (homogeneous polynomials) and for d points on the projective space, from the point of view of representation theory. We discuss several examples, addressing some computational issues. We introduce the…

We address some questions concerning indecomposable polynomials and their spectrum. How does the spectrum behave via reduction or specialization, or via a more general ring morphism? Are the indecomposability properties equivalent over a…