Related papers: Coefficients of Sylvester's Denumerant
We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…
For a linear matrix function $f$ in $X \in \R^{m\times n}$ we consider inhomogeneous linear matrix equations $f(X) = E$ for $E \neq 0$ that have or do not have solutions. For such systems we compute optimal norm constrained solutions…
We present a modular semantic account of Bayesian inference algorithms for probabilistic programming languages, as used in data science and machine learning. Sophisticated inference algorithms are often explained in terms of composition of…
In this paper, we focus on knapsack cones, a specific type of simplicial cones that arise naturally in the context of the knapsack problem $x_1 a_1 + \cdots + x_n a_n = a_0$. We present a novel combinatorial decomposition for these cones,…
We consider a family of integer linear programs in which the coefficients of the constraints and objective function are polynomials of an integer parameter $t.$ For $\ell$ in $\mathbb{Z}_+,$ we define $f_\ell(t)$ to be the…
Several determinants with gamma functions as elements are evaluated. This kind of determinants are encountered in the computation of the probability density of the determinant of random matrices. The s-shifted factorial is defined as a…
This work explores new classes of nonstationary stochastic sequences associated with polynomial hypergroups. Their covariance structures are analyzed through positive definite kernels and corresponding Hilbert spaces. Novel consistent…
Linear systems with a tensor product structure arise naturally when considering the discretization of Laplace type differential equations or, more generally, multidimensional operators with separable coefficients. In this work, we focus on…
For a positive integer n and a subset S of [n-1], the descent polytope DP_S is the set of points x_1, ..., x_n in the n-dimensional unit cube [0,1]^n such that x_i >= x_{i+1} for i in S and x_i <= x_{i+1} otherwise. First, we express the…
In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
We consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…
In this paper we describe an algorithm that takes as input a description of a semi-algebraic set $S \subset \R^k$, defined by a Boolean formula with atoms of the form $P > 0, P < 0, P=0$ for $P \in {\mathcal P} \subset \R[X_1,...,X_k],$ and…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
The problem of maximizing non-negative monotone submodular functions under a certain constraint has been intensively studied in the last decade. In this paper, we address the problem for functions defined over the integer lattice. Suppose…
Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…
The fastest known algorithm for factoring a degree $n$ univariate polynomial over a finite field $\mathbb{F}_q$ runs in time $O(n^{3/2 + o(1)}\text{polylog } q)$, and there is a reason to believe that the $3/2$ exponent represents a…
Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…