相关论文: The Andrews-Stanley partition function and Al-Sala…

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

We propose a linear algorithm for determining two function parameters by their linear combination. These functions must satisfy the first order differential equations with polynomial coefficients and our parameters are the coefficients of…

Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…

Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…

We expand the Chebyshev polynomials and some of its linear combination in linear combinations of the q-Hermite, the Rogers (q-utraspherical) and the Al-Salam--Chihara polynomials and vice versa. We use these expansions to obtain expansions…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

We study the density of the weights of Generalized Reed--Muller codes. Let $RM_p(r,m)$ denote the code of multivariate polynomials over $\F_p$ in $m$ variables of total degree at most $r$. We consider the case of fixed degree $r$, when we…

We revisit the proposal that the ensemble average over free boson CFTs in two dimensions - parameterized by Narain's moduli space - is dual to an exotic theory of gravity in three dimensions dubbed $U(1)$ gravity. We consider flavored…

This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…

The study of images of noncommutative polynomials on algebras has attracted considerable attention. We investigate polynomial images and the additive structures they generate in associative algebras, focusing on sums and products of values.…

We estimate the sum of products or quotients of $L$-functions, where the sum is taken over all quadratic extensions of given genus over a fixed global function field. Our estimate for the sum of the quotient of two $L$-functions is…

We find an involution as a combinatorial proof of a Ramanujan's partial theta identity. Based on this involution, we obtain a Franklin type involution for squares in the sense that the classical Franklin involution provides a combinatorial…

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

We study rather general multiple zeta-functions whose denominators are given by polynomials. The main aim is to prove explicit formulas for the values of those multiple zeta-functions at non-positive integer points. We first treat the case…

We use the $q$-binomial theorem, the $q$-Gauss sum, and the ${}_2\phi_1 \rightarrow {}_2\phi_2$ transformation of Jackson to discover and prove many new weighted partition identities. These identities involve unrestricted partitions,…

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Following attempts at an analytic proof of the Pentagonal Number Theorem, we report on the discovery of a general principle leading to an unexpected cancellation of oscillating sums. After stating the motivation, and our theorem, we apply…

We consider orthogonal polynomials on the unit circle associated with certain semi-classical weight functions. This means that the Pearson-type differential equations satisfied by these weight functions involve two polynomials of degree at…