Do you want to publish a course? Click here

Coefficients of Sylvesters Denumerant

245   0   0.0 ( 0 )
 Added by Matthias K\\\"oppe
 Publication date 2013
  fields
and research's language is English




Ask ChatGPT about the research

For a given sequence $mathbf{alpha} = [alpha_1,alpha_2,dots,alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(mathbf{alpha})(t)$ that counts the nonnegative integer solutions of the equation $alpha_1x_1+alpha_2 x_2+cdots+alpha_{N} x_{N}+alpha_{N+1}x_{N+1}=t$, where the right-hand side $t$ is a varying nonnegative integer. It is well-known that $E(mathbf{alpha})(t)$ is a quasi-polynomial function in the variable $t$ of degree $N$. In combinatorial number theory this function is known as Sylvesters denumerant. Our main result is a new algorithm that, for every fixed number $k$, computes in polynomial time the highest $k+1$ coefficients of the quasi-polynomial $E(mathbf{alpha})(t)$ as step polynomials of $t$ (a simpler and more explicit representation). Our algorithm is a consequence of a nice poset structure on the poles of the associated rational generating function for $E(mathbf{alpha})(t)$ and the geometric reinterpretation of some rational generating functions in terms of lattice points in polyhedral cones. Our algorithm also uses Barvinoks fundamental fast decomposition of a polyhedral cone into unimodular cones. This paper also presents a simple algorithm to predict the first non-constant coefficient and concludes with a report of several computational experiments using an implementation of our algorithm in LattE integrale. We compare it with various Maple programs for partial or full computation of the denumerant.



rate research

Read More

75 - Liuquan Wang 2020
We study the parity of coefficients of classical mock theta functions. Suppose $g$ is a formal power series with integer coefficients, and let $c(g;n)$ be the coefficient of $q^n$ in its series expansion. We say that $g$ is of parity type $(a,1-a)$ if $c(g;n)$ takes even values with probability $a$ for $ngeq 0$. We show that among the 44 classical mock theta functions, 21 of them are of parity type $(1,0)$. We further conjecture that 19 mock theta functions are of parity type $(frac{1}{2},frac{1}{2})$ and 4 functions are of parity type $(frac{3}{4},frac{1}{4})$. We also give characterizations of $n$ such that $c(g;n)$ is odd for the mock theta functions of parity type $(1,0)$.
We propose higher-order generalizations of Jacobsthals $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $binom{ip}{p}$ ($i=1,2,dots$) that are divisible by arbitrarily large powers of prime $p$.
89 - Liuquan Wang 2021
We denote by $c_t^{(m)}(n)$ the coefficient of $q^n$ in the series expansion of $(q;q)_infty^m(q^t;q^t)_infty^{-m}$, which is the $m$-th power of the infinite Borwein product. Let $t$ and $m$ be positive integers with $m(t-1)leq 24$. We provide asymptotic formula for $c_t^{(m)}(n)$, and give characterizations of $n$ for which $c_t^{(m)}(n)$ is positive, negative or zero. We show that $c_t^{(m)}(n)$ is ultimately periodic in sign and conjecture that this is still true for other positive integer values of $t$ and $m$. Furthermore, we confirm this conjecture in the cases $(t,m)=(2,m),(p,1),(p,3)$ for arbitrary positive integer $m$ and prime $p$.
We extend the axiomatization for detecting and quantifying sign changes of Meher and Murty to sequences of complex numbers. We further generalize this result when the sequence is comprised of the coefficients of an $L$-function. As immediate applications, we prove that there are sign changes in intervals within sequences of coefficients of GL(2) holomorphic cusp forms, GL(2) Maass forms, and GL(3) Maass forms. Building on previous works by the authors, we prove that there are sign changes in intervals within sequences of partial sums of coefficients of GL(2) holomorphic cusp forms and Maass forms.
We study the question of Eulerianity (factorizability) for Fourier coefficients of automorphic forms, and we prove a general transfer theorem that allows one to deduce the Eulerianity of certain coefficients from that of another coefficient. We also establish a `hidden invariance property of Fourier coefficients. We apply these results to minimal and next-to-minimal automorphic representations, and deduce Eulerianity for a large class of Fourier and Fourier-Jacobi coefficients. In particular, we prove Eulerianity for parabolic Fourier coefficients with characters of maximal rank for a class of Eisenstein series in minimal and next-to-minimal representations of groups of ADE-type that are of interest in string theory.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا