Related papers: Decision problem for a class of univariate Pfaffia…
We describe an explicit algorithm to factorize an even antisymmetric N^2 matrix into triangular and trivial factors. This allows for a straight forward computation of Pfaffians (including their signs) at the cost of N^3/3 flops.
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
Recent work introduced Generalized First Order Decision Diagrams (GFODD) as a knowledge representation that is useful in mechanizing decision theoretic planning in relational domains. GFODDs generalize function-free first order logic and…
In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…
We study how the choices made when designing an oracle affect the complexity of quantum property testing problems defined relative to this oracle. We encode a regular graph of even degree as an invertible function $f$, and present $f$ in…
Consider the operator $E$ on arithmetic functions such that $Ef$ is the multiplicative arithmetic function defined by $(Ef)(p^a) = f(a)$ for every prime power $p^a$. We investigate the behaviour of $E^m\tau_k$, where $\tau_k$ is a…
This preliminary report addresses the expressive power of unit resolution regarding input data encoded with partial truth assignments of propositional variables. A characterization of the functions that are computable in this way, which we…
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 present an algorithm for the numerical solution of nonlinear parabolic partial differential equations. This algorithm extends the classical Feynman-Kac formula to fully nonlinear partial differential equations, by using random trees that…
Imposing some conditions on derivatives of the known functions, using the Fiber Contraction Theorem we prove the existence of $C^1$ solutions of a class of iterative functional equations which involves iterates of the unknown functions and…
We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…
A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…
We present an algorithm producing all rational functions $f$ with prescribed $n+1$ Taylor coefficients at the origin and such that $\|f\|_\infty\le 1$ and $\deg f\le k$ for every fixed $k\ge n$. The case where $k<n$ is also discussed.
Type-and-effect systems help the programmer to organize data and computational effects in a program. While for traditional type systems expressive variants with sophisticated inference algorithms have been developed and widely used in…
We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…
In modern usage the Bernoulli numbers and Bernoulli polynomials follow Euler's approach and are defined using generating functions. We consider the functional equation $f(x)+x^k=f(x+1)$ and show that a solution can be derived from…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
Several neural network approaches for solving differential equations employ trial solutions with a feedforward neural network. There are different means to incorporate the trial solution in the construction, for instance one may include…
The integral of a function $f$ defined on a symmetric space $M \simeq G/K$ may be expressed in the form of a determinant (or Pfaffian), when $f$ is $K$-invariant and, in a certain sense, a tensor power of a positive function of a single…