Related papers: Power sum polynomials in a discrete tomography per…
Inspired by Feynman integral computations in quantum field theory, Kontsevich conjectured in 1997 that the number of points of graph hypersurfaces over a finite field $\F_q$ is a (quasi-) polynomial in $q$. Stembridge verified this for all…
In the past two decades, many researchers have studied {\it index $2$} Gauss sums, where the group generated by the characteristic $p$ of the underling finite field is of index $2$ in the unit group of ${\mathbb Z}/m{\mathbb Z}$ for the…
The subset sum problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two extensions of this problem: The subset sum problem with digraph constraint (SSG) and subset sum problem with…
Let GF(q)[x,y] be the polynomial algebra in two variables over the finite field GF(q) with q elements. We give an exact formula and the asymptotics for the number p(n) of automorphisms (f,g) of GF(q)[x,y] such that max{deg(f),deg(g)}=n. We…
In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…
We study the computational complexity of approximating the 2->q norm of linear operators (defined as ||A||_{2->q} = sup_v ||Av||_q/||v||_2), as well as connections between this question and issues arising in quantum information theory and…
Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer coefficients, how does the property that they are coprime relate to their values $P(\underline n), Q(\underline n)$ at integer points…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
Let $q, m\geq 2$ be integers with $(m,q-1)=1$. Denote by $s_q(n)$ the sum of digits of $n$ in the $q$-ary digital expansion. Further let $p(x)\in mathbb{Z}[x]$ be a polynomial of degree $h\geq 3$ with $p(\mathbb{N})\subset \mathbb{N}$. We…
One of the remarkable differences between renormalizable quantum gravity with four-derivative action and its superrenormalizable polynomial generalizations is that the latter admit a more sophisticated particle mass spectrum. Already in the…
We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…
Building on the results of [1,2], we study the resurgence of $q$-Pochhammer symbols and determine their summability and quantum modularity properties. We construct a new, infinite family of pairs of modular resurgent series from the…
A monic polynomial in F_q[t] of degree n over a finite field F_q of odd characteristic can be written as the sum of two irreducible monic elements in F_q[t] of degrees n and n-1 if q is larger than a bound depending only on n. The main tool…
A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…
In this paper, we present a $q$-analogue of the polynomial reduction which was originally developed for hypergeometric terms. Using the $q$-Gosper representation, we describe the structure of rational functions that are summable when…
Let $\mu$ and $\nu$ be probability measures in the complex plane, and let $p$ and $q$ be independent random polynomials of degree $n$, whose roots are chosen independently from $\mu$ and $\nu$, respectively. Under assumptions on the…
The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes…
We consider summations over digamma and polygamma functions, often with summands of the form (\pm 1)^n\psi(n+p/q)/n^r and (\pm 1)^n\psi^{(m)} (n+p/q)/n^r, where m, p, q, and r are positive integers. We develop novel general integral…
In 2023 we obtained a $Q$-polynomial structure for the projective geometry $L_N(q)$. In the present paper, we display a more general $Q$-polynomial structure for $L_N(q)$. Our new $Q$-polynomial structure is defined using a free parameter…
We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…