Related papers: Characterizing the Value Functions of Polynomial G…
In this paper, some sufficient conditions for the differentiability of the $n$-variable real-valued function are obtained, which are given based on the differentiability of the $n-1$-variable real-valued function and are weaker than…
Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…
Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with…
Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time.…
We prove that P != NP by proving the existence of a class of functions we call Tau, each of whose members satisfies the conditions of one-way functions. Each member of Tau is a function computable in polynomial time, with negligible…
Let $\langle K,\nu \rangle$ be a real closed valued field, and let $S\subseteq K^n$ be an open semi-algebraic set. Using tools from model theory, we find an algebraic characterization of rational functions which admit, on $S$, only values…
We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential…
We first show the existence of an effective determinantal representation for any univariate polynomial with real coefficients. Then, we more precisely establish that any univariate polynomial with real coefficients has an effective…
We derive the Taylor polynomial of a function, which is $m$-times continuously differentiable and positive homogeneous of order $m$. The Taylor polynomial in $a$ for $f(b)$ of order $m$ in general is a polynomial of order $m$ in $b-a$. If…
One-parameter smooth families of circles in the complex plane with the following property are described: a function is polyanalytic if and only if it has meromorphic extension inside any circle from the family, with the only singularity-a…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
In this paper, as an extension of the integer case, we define polynomial functions over the residue class rings of Dedekind domains, and then we give canonical representations and counting formulas for such polynomial functions. In…
We study resonant billiard trajectories within quadrics in the $d$-dimensional Euclidean space. We relate them to the theory of approximation, in particular the extremal rational functions on the systems of $d$ intervals on the real line.…
We revisit games in partition function form, i.e. cooperative games where the payoff of a coalition depends on the partition of the entire set of players. We assume that each coalition computes its worth having probabilistic beliefs over…
We consider the space of convex functions defined in the Euclidean $n$-dimensional space, which are lower semi-continuous and tend to infinity at infinity. We study real-valued valuations defined on this space of functions, which are…
Poker is one of the most popular card games, whose rational investigation represents also one of the major challenges in several scientific areas, spanning from information theory and artificial intelligence to game theory and statistical…
We prove that, if f:R^n\to R satisfies Fr\'echet's functional equation and f(x_1,...,x_n) is not an ordinary algebraic polynomial in the variables x_1,...,x_n, then f is unbounded on all non-empty open set U of R^n. Furthermore, the closure…
The notion of a root functional of a system of polynomials or ideal of polynomials is a generalization of the notion of a root, in particular, for a multiple root. A root functional is a linear functional that is defined on a polynomial…