English
Related papers

Related papers: Summing a polynomial function over integral points…

200 papers

This paper summarizes the essential functionality of the computer algebra package HarmonicSums. On the one hand HarmonicSums can work with nested sums such as harmonic sums and their generalizations and on the other hand it can treat…

Symbolic Computation · Computer Science 2014-07-24 Jakob Ablinger

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…

Combinatorics · Mathematics 2012-03-02 Martin Trinks

There is shown how to compute the sum of indices of critical points of rank two for polynomial selmaps of R^4

Algebraic Geometry · Mathematics 2016-03-03 Zbigniew Szafraniec

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

Number Theory · Mathematics 2022-10-31 Geoffrey Price , Katherine Thompson

This paper provides a Liouville principle for integration in terms of dilogarithm and partial result for polylogarithm.

Number Theory · Mathematics 2019-06-24 Waldemar Hebisch

We describe Maple packages for the automatic generation of generating functions(and series expansions) for counting lattice animals(fixed polyominoes), in the two-dimensional hexagonal lattice, of bounded but arbitrary width. Our Maple…

Combinatorics · Mathematics 2009-02-28 Mohamud Mohammed

This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…

Symbolic Computation · Computer Science 2025-11-07 Jean-Guillaume Dumas , Bruno Grenet

In this article, we continue our recent investigations on bilinear sums and additive energies with modular square roots. Here we improve our recent results for the case when the ranges of variables are large. We use these results to make…

Number Theory · Mathematics 2026-03-24 Stephan Baier

The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…

Dynamical Systems · Mathematics 2016-03-04 Laura Menini , Corrado Possieri , Antonio Tornambè

The $\texttt{IntegerHull}$ function is part of Maple's $\texttt{PolyhedralSets}$ library, which calculates the integer hull of a given polyhedral set. This algorithm works by translating the supporting hyperplanes of the facets of the input…

Combinatorics · Mathematics 2025-09-12 Chirantan Mukherjee

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

Number Theory · Mathematics 2013-08-23 Omran Ahmadi , Igor E. Shparlinski

We utilize the trip matrix method of calculating the Jones Polynomial to give an alternative proof that the Jones Polynomial is multiplicative under connect sums.

Geometric Topology · Mathematics 2025-10-02 Molly A. Moran , Emerson Worrell

It is a well known result that the number of points over a finite field on the Legendre family of elliptic curves can be written in terms of a hypergeometric function modulo $p$. In this paper, we extend this result, due to Igusa, to a…

Number Theory · Mathematics 2012-01-17 Adriana Salerno

In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.

Combinatorics · Mathematics 2016-01-13 Ada Morse

Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.

Number Theory · Mathematics 2024-05-08 V. Vinay Kumaraswamy

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

Rings and Algebras · Mathematics 2012-02-20 Miguel Couceiro , Jean-Luc Marichal

This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…

High Energy Physics - Phenomenology · Physics 2008-11-26 J. A. M. Vermaseren

In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…

Combinatorics · Mathematics 2025-04-02 Kunle Adegoke , Robert Frontczak , Karol Gryszka

This paper is an edited and shortened version of Chapter 6 from the thesis of the author. First the one dimensional orthogonal derivative will be extended to the two-dimensional case. In the two-dimensional case we have to define the region…

Classical Analysis and ODEs · Mathematics 2020-12-29 Enno Diekema
‹ Prev 1 8 9 10 Next ›