Related papers: Polynomial Invariants for Affine Programs
Affine Cartesian codes are defined by evaluating multivariate polynomials at a cartesian product of finite subsets of a finite field. In this work we examine properties of these codes as batch codes. We consider the recovery sets to be…
This paper studies separating invariants of finite groups acting on affine varieties through automorphisms. Several results, proved by Serre, Dufresne, Kac-Watanabe and Gordeev, and Jeffries and Dufresne exist that relate properties of the…
In this paper, we study some bounds for nonconvex quadratically constrained quadratic programs. We propose two types of bounds for quadratically constrained quadratic programs, quadratic and cubic bounds. For quadratic bounds, we use affine…
This paper investigates the usage of generating functions (GFs) encoding measures over the program variables for reasoning about discrete probabilistic programs. To that end, we define a denotational GF-transformer semantics for…
We present and expand some existing results on the Zariski closure of cyclic groups and semigroups of matrices. We show that, with the exclusion of isolated points, their irreducible components are toric varieties. Additionally, we…
We develop a method for determining the density of squarefree values taken by certain multivariate integer polynomials that are invariants for the action of an algebraic group on a vector space. The method is shown to apply to the…
We study the arithmetic circuit complexity of some well-known family of polynomials through the lens of parameterized complexity. Our main focus is on the construction of explicit algebraic branching programs (ABP) for determinant and…
We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…
We study over a number field, the iterates of automorphisms of the affine space. More precisely, we are interested in the periodic and non-periodic points; for the former the questions are similar to the ones about torsion points on abelian…
A system of polynomial ordinary differential equations (ODEs) is specified via a vector of multivariate polynomials, or vector field, $F$. A safety assertion $\psi\rightarrow[F]\phi$ means that the trajectory of the system will lie in a…
We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or…
We describe explicitly the algebra of polynomial functions on the Hilbert space of four qubit states which are invariant under the SLOCC group $SL(2,{\mathbb C})^{4}$. From this description, we obtain a closed formula for the…
The dynamics of many systems from physics, economics, chemistry, and biology can be modelled through polynomial functions. In this paper, we provide a computational means to find positively invariant sets of polynomial dynamical systems by…
This paper studies, for the first time, a bilevel polynomial program whose constraints involve uncertain linear constraints and another uncertain linear optimization problem. In the case of box data uncertainty, we present a sum of squares…
We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…
For each integer $d\geq 2$, let $M_d$ denote the moduli space of maps $f: \mathbb{P}^1\to \mathbb{P}^1$ of degree $d$. We study the geometric configurations of subsets of postcritically finite (or PCF) maps in $M_d$. A complex-algebraic…
We prove that invariant subbundles of the Kontsevich-Zorich cocycle respect the Hodge structure. In particular, we establish a version of Deligne semisimplicity in this context. This implies that invariant subbundles must vary polynomially…
In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our…
Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…
In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…