Related papers: A Counting Function
The $q$-Whittaker function $W_\lambda(\mathbf{x};q)$ associated to a partition $\lambda$ is a $q$-analogue of the Schur function $s_\lambda(\mathbf{x})$, and is defined as the $t=0$ specialization of the Macdonald polynomial…
We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…
The theorem below gives another way of computing the distribution prime counting function without using recursion and the values of Prime numbers
In this document I develop a weight function theory of positive order basis function interpolants and smoothers. **In Chapter 1 the basis functions and data spaces are defined directly using weight functions. The data spaces are used to…
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
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…
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…
We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…
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.…
We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…
How many odd numbers are there? How many even numbers? From Galileo to Cantor, the suggestion was that there are the same number of odd, even and natural numbers, because all three sets can be mapped in one-one fashion to each other. This…
Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties…
Let R be a commutative ring and let n,m be two positive integers. The symmetric group on n letters acts diagonally on the ring of polynomials in nxm variables with coefficients in R. The subrings of invariants for this action is called the…
A {+,x}-circuit counts a given multivariate polynomial f, if its values on 0-1 inputs are the same as those of f; on other inputs the circuit may output arbitrary values. Such a circuit counts the number of monomials of f evaluated to 1 by…
We completely characterize the unimodal category for functions $f:\mathbb R\to[0,\infty)$ using a decomposition theorem obtained by generalizing the sweeping algorithm of Baryshnikov and Ghrist. We also give a characterization of the…
While discrete harmonic functions have been objects of interest for quite some time, this is not the case for discrete polyharmonic functions, as appear for instance in the asymptotics of path counting problems. In this article, a novel…
We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and…
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
In this paper we study the following type of functions $f: \mathcal{Q}_{\mathbb{R}_{3}} \to \mathbb{R}_{3}$, where $ \mathcal{Q}_{\mathbb{R}_3}$ is the quadratic cone of the algebra $\mathbb{R}_{3}$. From the fact that it is possible to…