Related papers: Computation of Zolotarev rational functions

We describe a method for computing the highest degree coefficients of a weighted Ehrhart quasi-polynomial for a rational simple polytope.

We describe dynamical properties of a map $\mathfrak{F}$ defined on the space of rational functions. The fixed points of $\mathfrak{F}$ are classified and the long time behavior of a subclass is described in terms of Eulerian polynomials.

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

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 give two approximation algorithms solving the Stochastic Boolean Function Evaluation (SBFE) problem for symmetric Boolean functions. The first is an $O(\log n)$-approximation algorithm, based on the submodular goal-value approach of…

For the Tornheim double zeta function T(s1,s2,s3) of complex variables,we obtain its functional equations,which are new.Using the calculus of r-th order derivative of zeta(s,alpha) as a function of alpha(developed in author[7])as the…

We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…

Ehrhart's famous theorem states that the number of integral points in a rational polytope is a quasi-polynomial in the integral dilation factor. We study the case of rational dilation factors and it turns out that the number of integral…

In this work, a sequence of orthonormal rational functions that is also biorthogonal to another sequence of rational functions arising from recurrence relations of $R_{II}$ type is constructed. The biorthogonality is proved by a procedure…

The algebraic degree of Boolean functions (or vectorial Boolean functions) is an important cryptographic parameter that should be computed by fast algorithms. They work in two main ways: (1) by computing the algebraic normal form and then…

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…

The integer complexity $f(n)$ of a positive integer $n$ is defined as the minimum number of 1's needed to represent $n$, using additions, multiplications and parentheses. We present two simple and faster algorithms for computing the integer…

The AAA algorithm for rational approximation is employed to illustrate applications of rational functions all across numerical analysis.

The papers shows an algorithm to search for approximations of reals to rationals of the form a/b^2 that runs on \sqrt(b) polynomial time steps.

Greene's rational function $\Psi_P({\bf x})$ is a sum of certain rational functions in ${\bf x}=(x_1, \ldots, x_n)$ over the linear extensions of the poset $P$ (which has $n$ elements), which he introduced in his study of the…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…

We propose an algorithm for reduction of the problem of maximization of fraction of two functionals to the equivalent procedure including maximization of difference between the functionals and the solution of an equation of scalar unknown.…

By restricting the variables running over various (possibly different) subfields, we introduce the notion of a partial zeta function. We prove that the partial zeta function is rational in an interesting case, generalizing Dwork's well…