Related papers: Computational aspects of rational residuosity
We investigate the possibilities to calculate vector partition functions by means of iterated partial fraction decomposition, as suggested by Beck (2004). Particularly, for an important type of families of rational functions, we describe an…
Let $p\equiv1\pmod 4$ be a prime. In this paper, with the help of Jacobsthal sums, we study some permutation problems involving biquadratic residues modulo $p$.
The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…
In this paper, we introduce Jacobi polynomial generalizations of several classical invariants in coding theory over finite fields, specifically, the higher and extended weight enumerators, and we establish explicit correspondences between…
In this paper, a new criterion is given to determine the $p-$rationality of some complex cubic number fields in terms of $ p-$divisibility of certain terms of a third-order recurrence sequence, several illustrated examples are…
Using numerical, theoretical and general methods, we construct evaluation formulas for the Jacobi $\theta$ functions. Some of our results are conjectures, but are verified numerically.
A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction.…
We characterize the atomic probability measure on $\mathbb{R}^d$ which having a finite number of atoms. We further prove that the Jacobi sequences associated to the multiple Hermite (resp. Laguerre, resp. Jacobi) orthogonal polynomials are…
Complex functions have multiple uses in various fields of study, so analyze their characteristics it is of extensive interest to other sciences. This work begins with a particular class of rational functions of a complex variable; over this…
Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…
We develop a theory of the field of double Laurent series, iterated Laurent series, and Malcev-Neumann series that applies to most constant term evaluation problems. These include (i) MacMahon's partition analysis, counting solutions of…
Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set…
An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface $x_1y_1^2+\dots+x_4y_4^2=0$ in…
We show that there is a query expressible in first-order logic over the reals that returns, on any given semi-algebraic set A, for every point a radius around which A is conical. We obtain this result by combining famous results from…
By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…
Using known entropic and information inequalities new inequalities for some classical polynomials are obtained. Examples of Jacobi and Legendre polynomials are considered.
This study proposes an approach toward the first principles electronic structure calculation with the aid of symbolic-numeric solving. The symbolic computation enables us to express the Hartree-Fock-Roothaan equation and the molecular…
The authors review results implicit in their recent paper [2] on the product/quotient representation of rationals by rationals of the type $( an + b )/ ( An+ B )$ and give a detailed account of a particular related non-intuitive…
We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…