Related papers: Number systems and the Chinese Remainder Theorem
We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…
In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…
In this paper we present two efficient methods for reconstructing a rational number from several residue-modulus pairs, some of which may be incorrect. One method is a natural generalization of that presented by Wang, Guy and Davenport in…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…
A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
We show a Condition Number Theorem for the condition number of zero counting for real polynomial systems. That is, we show that this condition number equals the inverse of the normalized distance to the set of ill-posed systems (i.e., those…
We study a generalization of the classical Pentagonal Number Theorem and its applications. We derive new identities for certain infinite series, recurrence relations and convolution sums for certain restricted partitions and divisor sums.…
Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that…
We give a factorization of the cycle of a bounded complex of vector bundles in terms of certain associated differential forms and residue currents. This is a generalization of previous results in the case when the complex is a locally free…
An MV-algebra (equivalently, a lattice-ordered Abelian group with a distinguished order unit) is strongly semisimple if all of its quotients modulo finitely generated congruences are semisimple. All MV-algebras satisfy a Chinese Reminder…
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…