Related papers: Symmetry groups, semidefinite programs, and sums o…
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,…
Invariant coordinate selection is an unsupervised multivariate data transformation useful in many contexts such as outlier detection or clustering. It is based on the simultaneous diagonalization of two affine equivariant and positive…
We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…
Let $f$ be a polynomial system consisting of $n$ polynomials $f_1,\cdots, f_n$ in $n$ variables $x_1,\cdots, x_n$, with coefficients in $\mathbb{Q}$ and let $\langle f\rangle$ be the ideal generated by $f$. Such a polynomial system, which…
We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\"atze. First, we…
A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…
Symmetry in integer programming causes redundant search and is often handled with symmetry breaking constraints that remove as many equivalent solutions as possible. We propose an algebraic method which allows to generate a random family of…
In this paper we consider the problem of group invariant subspace clustering where the data is assumed to come from a union of group-invariant subspaces of a vector space, i.e. subspaces which are invariant with respect to action of a given…
Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…
We consider the example from invariant theory concerning the conjugation action of the general linear group on several copies of the $n \times n$ matrices, and examine a symmetric function which stably describes the Hilbert series for the…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
Symmetry groups allow to transform solutions of differential equations continuously into other solutions. This property can be used for the observability analysis of infinite-dimensional systems with input and output. In this contribution,…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
A presentation by generators and relations of the $n$th symmetric power $B$ of a commutative algebra $A$ over a field of characteristic zero or greater than $n$ is given. This is applied to get information on a minimal homogeneous…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
We introduce an approximation method to solve an optimal control problem via the Lagrange dual of its weak formulation. It is based on a sum-of-squares representation of the Hamiltonian, and extends a previous method from polynomial…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…