Related papers: Composition sums related to the hypergeometric fun…
For a polynomial map $\mathbf{f} : k^n \to k^m$ ($k$ a field), we investigate those polynomials $g \in k[t_1,\ldots, t_n]$ that can be written as a composition $g = h \circ \mathbf{f}$, where $h: k^m \to k$ is an arbitrary function. In the…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
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 begin by defining general hypergeometric functions over finite fields and obtaining a finite field analogue of a classical symmetry in their complex counterparts. We give a geometric proof for the symmetry by constructing isomorphisms…
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…
Mott noted a one-to-one correspondence between saturated multiplicatively closed subsets of a domain D and directed convex subgroups of the group of divisibility D. With this, we construct a functor between inclusions into saturated…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
An integer composition of a nonnegative integer $n$ is a tuple $(\pi_1,\ldots,\pi_k)$ of nonnegative integers whose sum is $n$; the $\pi_i$'s are called the parts of the composition. For fixed number $k$ of parts, the number of $f$-weighted…
This paper is dedicated to the analysis and detailed study of a procedure to generate both the weighted arithmetic and harmonic means of $n$ positive real numbers. Together with this interpretation, we prove some relevant properties that…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
We study multiplicative nested sums, which are generalizations of harmonic sums, and provide a calculation through multiplication of index matrices. Special cases interpret the index matrices as stochastic transition matrices of random…
We study selfadjoint functors acting on categories of finite dimensional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint functors satisfying several easy relations, in…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
We study orthogonal polynomials for a weight function defined over a domain of revolution, where the domain is formed from rotating a two-dimensional region and goes beyond the quadratic domains. Explicit constructions of orthogonal bases…
Generic Newton polygons for L-functions of exponential sums associated to Laurent polynomials in one variable are determined. The corresponding Hasse polynomials are also determined.
We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…
We construct a class of representations of the quadratic R-matrix algebra, given by the reflection equation with the spectral parameter, in terms of certain ordinary difference operators. These operators turn out to act as parameter…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
Identities involving finite sums of products of hypergeometric functions and their duals have been studied since 1930s. Recently Beukers and Jouhet have used an algebraic approach to derive a very general family of duality relations. In…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…