Related papers: The Generalized Interval Polynomial of a Poset

Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…

In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…

We study a generalization of the classical Pentagonal Number Theorem and its applications. We derive new identities for certain infinite series, recurrence relations and convolution sums for certain restricted partitions and divisor sums.…

We establish new operational formulae of Burchnall type for the complex disk polynomials (generalized Zernike polynomials). We then use them to derive some interesting identities involving these polynomials. In particular, we establish…

In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…

The general position problem in graphs seeks the largest set of vertices such that no three vertices lie on a common geodesic. Its counting refinement, the general position polynomial $\psi(G)$, asks for all such possible sets. In this…

The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

We show that the integral \int e^{S(x_1,...,x_n)}dx_1...dx_n, for an arbitrary polynomial S, satisfies a generalized hypergeometric system of differential equations in the sense of I. M. Gelfand et al.

We define integer multimodal sequences, which are generalizations of unimodal sequences having multiple local peaks of equal size. The generating functions for multimodal sequences represent novel types of $q$-series that combine generating…

This paper provides a thorough introduction to the causal set hypothesis aimed at students, and other interested persons, with some knowledge of general relativity and nonrelativistic quantum mechanics. I elucidate the arguments for why the…

Let $G$ be a simple, undirected, finite graph with vertex set $V(G)$ and edge set $E(G)$. A $k$-dimensional box is a Cartesian product of closed intervals $[a_1,b_1]\times [a_2,b_2]\times...\times [a_k,b_k]$. The {\it boxicity} of $G$,…

The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…

This paper formulates a generalization of our work on quantum knots to explain how to make quantum versions of algebraic, combinatorial and topological structures. We include a description of previous work on the construction of Hilbert…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

We study the probability distribution of the number of zeros of multivariable polynomials with bounded degree over a finite field. We find the probability generating function for each set of bounded degree polynomials. In particular, in the…

We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Let $T$ be a tree on $n$ vertices with Laplacian $L_T$ and let $GTS_n$ be the generalized tree shift poset on the set of unlabelled trees on $n$ vertices. Inequalities are known for coefficients of the characteristic polynomial of $L_T$ as…