Related papers: Plane partitions and their pedestal polynomials

For any orthogonal polynomials system on real line we construct an appropriate oscillator algebra such that the polynomials make up the eigenfunctions system of the oscillator hamiltonian. The general scheme is divided into two types: a…

We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…

We define a poset of partitions associated to an operad. We prove that the operad is Koszul if and only if the poset is Cohen-Macaulay. In one hand, this characterisation allows us to compute the homology of the poset. This homology is…

We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several graph invariants.

For a polynomial in several variables depending on some parameters, we discuss some results to the effect that for almost all values of the parameters the polynomial is irreducible. In particular we recast in this perspective some results…

We study the orthogonal projection of homogeneous polynomials onto the space of homogeneous polyharmonic polynomials. To do this we derive the decomposition of homogeneous polynomials in terms of the Kelvin transform of derivatives of the…

We study a type of object, called a pathway (generalizing pathways in the sense of P. E. Cohen [Proc. Amer. Math. Soc. 74, No. 2 (1979), 318--321]), which is useful for several set-theoretic constructions and whose existence, in a sense,…

We obtain some recurrence relationships among the partition vectors of the partial exponential Bell polynomials. On using such results, the $n$-th Adomian polynomial for any nonlinear operator can be expressed explicitly in terms of the…

In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…

Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another…

Phase space of General Relativity is extended to a Poisson manifold by inclusion of the determinant of the metric and conjugate momentum as additional independent variables. As a result, the action and the constraints take a polynomial…

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…

Let (K, v) be a henselian valued field of arbitrary rank. In this paper, we give an irreducibility criterion for multivariate polynomials over K using valuation theory.

We give a direct deduction and proof of two identities in the theory of plane partitions. The first one is known to enumerate the traces of plane partitions. The second one comes without any combinatorial interpretation.

A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…

We explore the notion of sectional number of a group homomorphism, leading to a generalization of the covering number of a group, and present several characterizations when the sectional number is finite, providing estimates for computing…

The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…