Related papers: Polynomial Bounds for Invariant Functions Separati…
Given a set of endomorphisms on $\mathbb{P}^N$, we establish an upper bound on the number of points of bounded height in the associated monoid orbits. Moreover, we give a more refined estimate with an associated lower bound when the monoid…
In this article, we study algebraic decompositions and secondary constructions of almost perfect nonlinear (APN) functions. In many cases, we establish precise criteria which characterize when certain modifications of a given APN function…
We present an algorithm for synthesizing program loops satisfying a given polynomial loop invariant. The class of loops we consider can be modeled by a system of algebraic recurrence equations with constant coefficients. We turn the task of…
We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally…
We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…
We define the notion of an invariant function on a cluster ensemble with respect to an action of the cluster modular group on its associated function fields. We realize many examples of previously studied functions as elements of this type…
In this work, a functional variant of the polynomial analogue of the classical Gandy's fixed point theorem is obtained. Sufficient conditions have been found to ensure that the complexity of the recursive function does not go beyond the…
Automatically generating invariants, key to computer-aided analysis of probabilistic and deterministic programs and compiler optimisation, is a challenging open problem. Whilst the problem is in general undecidable, the goal is settled for…
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…
We study the space of invariant generalized functions supported on an orbit of the action of a real algebraic group on a real algebraic manifold. This space is equipped with the Bruhat filtration. We study the generating function of the…
We define a GL-variety to be a (typically infinite dimensional) algebraic variety equipped with an action of the infinite general linear group under which the coordinate ring forms a polynomial representation. Such varieties have been used…
If G is a finitely generated group, and A an algebraic group, then Hom(G,A) is a possibly reducible algebraic variety denoted by R_A(G). Here we define the profile function, P_d(R_A(G)), of the representation variety of G over A to be…
We give two results concerning the construction of modular invariant partition functions for conformal field theories constructed by tensoring together other conformal field theories. First we show how the possible modular invariants for…
Classical invariant theory establishes a systematic correspondence between algebraic and smooth invariants for compact and reductive Lie groups. However, the extension of these results to non-compact and non-reductive regimes remains a…
We compute the number of orbits of pairs in a finitely generated torsion module (more generally, a module of bounded order) over a discrete valuation ring. The answer is found to be a polynomial in the cardinality of the residue field whose…
Let $G$ be one of the ind-groups $GL(\infty)$, $O(\infty)$, $Sp(\infty)$, and $P_1,\dots, P_l$ be an arbitrary set of $l$ splitting parabolic subgroups of $G$. We determine all such sets with the property that $G$ acts with finitely many…
We present a method for constructing superoscillatory functions the superoscillatory part of which approximates a given polynomial with arbitrarily small error in a fixed interval. These functions are obtained as the product of the…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
An integer program (IP) with a finite number of feasible solutions may have an unbounded linear programming relaxation if it contains irrational parameters, due to implicit constraints enforced by the irrational numbers. We show that those…