相关论文: Denominator Bounds for Systems of Recurrence Equat…
This paper provides a general account of the notion of recursive program schemes, studying both uninterpreted and interpreted solutions. It can be regarded as the category-theoretic version of the classical area of algebraic semantics. The…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
Algorithms for the symbolic computation of polynomial conservation laws, generalized symmetries, and recursion operators for systems of nonlinear differential-difference equations (DDEs) are presented. The algorithms can be used to test the…
A complex spherical code is a finite subset on the unit sphere in $\mathbb{C}^d$. A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed inner products. In this paper, we determine the irreducible…
We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
Elimination of unknowns in systems of equations, starting with Gaussian elimination, is a problem of general interest. The problem of finding an a priori upper bound for the number of differentiations in elimination of unknowns in a system…
The now classical replicator equation describes a wide variety of biological phenomena, including those in theoretical genetics, evolutionary game theory, or in the theories of the origin of life. Among other questions, the permanence of…
We present a simple systematic algorithm for construction of expansions of the solutions of ordinary differential equations with rational coefficients in terms of mathematical functions having indefinite integral representation. The…
Resolution over linear equations is a natural extension of the popular resolution refutation system, augmented with the ability to carry out basic counting. Denoted Res(lin_R), this refutation system operates with disjunctions of linear…
Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…
We investigate in the paper general (not necessarily definite) canonical systems of differential equation in the framework of extension theory of symmetric linear relations. For this aim we first introduce the new notion of a boundary…
Exploring the power of linear programming for combinatorial optimization problems has been recently receiving renewed attention after a series of breakthrough impossibility results. From an algorithmic perspective, the related questions…
In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
We examine regular and irregular repeat-accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, we give an upper bound on the decoding error probability of a…
A recurrence relations for sums of powers of complex functions can be written as a system of linear equation AX=B. Using properties of determinant and Cramer's rule for solving systems of linear equation, this paper presents an absolutely…
In 2007, A.I.Aptekarev and his collaborators discovered a sequence of rational approximations to Euler's constant $\gamma$ defined by a linear recurrence. In this paper, we generalize this result and present an explicit construction of…