Related papers: Invariant polynomials, gaps, and sparseness
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…
In these notes we investigate the rings of real polynomials in four variables, which are invariant under the action of the reflectiongroups [3,4,3] and [3,3,5]. It is well known that they are rationally generated in degree 2,6,8,12 and…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
Invariant manifolds are important sets arising in the stability theory of dynamical systems. In this article, we take a brief review of invariant sets. We provide some results regarding the existence of invariant lines and parabolas in…
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…
In a series of papers the authors associated to an $L^2$-acyclic group $\Gamma$ an invariant $\mathcal{P}(\Gamma)$ that is a formal difference of polytopes in the vector space $H_1(\Gamma;\Bbb{R})$. This invariant is in particular defined…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
Explicit generators are given for the ring of invariant polynomials under the coadjoint representation of certain inhomogeneous groups.
The work proves that, for three-dimensional upper triangular groups over a field of odd characteristic with an abelian unipotent subgroup, the ring of invariants is polynomial if and only if the unipotent subgroup is generated by…
We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…
We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system of polynomial inequalities be given where each…
Some polynomials $P$ with rational coefficients give rise to well defined maps between cyclic groups, $\Z_q\longrightarrow\Z_r$, $x+q\Z\longmapsto P(x)+r\Z$. More generally, there are polynomials in several variables with tuples of rational…
This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…
We study the existence of invariant quadrics for a class of systems of difference equations in ${\mathbb R}^n$ defined by linear fractionals sharing denominator. Such systems can be described in terms of some square matrix $A$ and we prove…
We provide new examples of integrable rational maps in four dimensions with two rational invariants, which have unexpected geometric properties, as for example orbits confined to non algebraic varieties, and fall outside classes studied by…