Related papers: Polynomial Bounds for Invariant Functions Separati…

We study $\textrm{Sym}(\infty)$-orbit closures of not necessarily closed points in the Zariski spectrum of the infinite polynomial ring $\mathbb{C}[x_{ij}:\, i\in\mathbb{N},\,j\in[n]]$. Among others, we characterize invariant prime ideals…

Program analysis requires the generation of program properties expressing conditions to hold at intermediate program locations. When it comes to programs with loops, these properties are typically expressed as loop invariants. In this paper…

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…

Let V be a normal affine variety over the real numbers R, and let S be a semi-algebraic subset of V(R). We study the subring B(S) of the coordinate ring of V consisting of the polynomials that are bounded on S. We introduce the notion of…

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

We describe a collection of computer scripts written in PARI/GP to compute, for reflection groups determined by finite-volume polyhedra in $\mathbb{H}^3$, the commensurability invariants known as the invariant trace field and invariant…

We study the polyregular string-to-string functions, which are certain functions of polynomial output size that can be described using automata and logic. We describe a system of combinators that generates exactly these functions. Unlike…

Let $G$ be a reductive group acting on a path algebra $kQ$ as automorphisms. We assume that $G$ admits a graded polynomial representation theory, and the action is polynomial. We describe the quiver $Q_G$ of the smash product algebra $kQ\#…

Let $G$ be a compact group of linear transformations of an Euclidean space $V$. The $G$-invariant $C^\infty$ functions can be expressed as $C^\infty$ functions of a finite basic set of $G$-invariant homogeneous polynomials, called an…

For an arbitrary representation $\rho$ of a complex finite-dimensional Lie algebra, we construct a collection of numbers that we call the Jordan-Kronecker invariants of $\rho$. Among other interesting properties, these numbers provide lower…

Degree bounds for algebra generators of invariant rings are a topic of longstanding interest in invariant theory. We study the analogous question for field generators for the field of rational invariants of a representation of a finite…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

Loop invariants are software properties that hold before and after every iteration of a loop. As such, invariants provide inductive arguments that are key in automating the verification of program loops. The problem of generating loop…

In many physical problems or applications one has to study functions that are invariant under the action of a symmetry group G and this is best done in the orbit space of G if one knows the equations and inequalities defining the orbit…

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

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…

In numeric-intensive computations, it is well known that the execution of floating-point programs is imprecise as floating-point arithmetic incurs round-off errors. Although round-off errors are small for a single floating-point operation,…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by…

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…