Related papers: Set maps, umbral calculus, and the chromatic polyn…
We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials. The simplest example is the following. For every finite coloring of the natural numbers…
We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…
Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…
This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
The q-state Potts model can be defined on an arbitrary finite graph, and its partition function encodes much important information about that graph, including its chromatic polynomial, flow polynomial and reliability polynomial. The complex…
We give several families of polynomials which are related by Eulerian summation operators. They satisfy interesting combinatorial properties like being integer-valued at integral points. This involves nearby-symmetries and a recursion for…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
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…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
In this paper, by using the orthogonality type as defined in the umbral calculus, we derive explicit formula for several well known polynomials as a linear combination of the Apostol-Euler polynomials.
J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcc_t-colorings, and…
Let $\mathcal{P}$ be a graph property. A $\mathcal{P}$-coloring with at most $k$ colors is a coloring of the vertices of a simple graph $G$ such that each color class induces a graph in $\mathcal{P}$. Harary polynomials are generalizations…
Let $X$ and $Y$ be Banach spaces, let $\mathcal{A}(X)$ stands for the algebra of approximable operators on $X$, and let $P\colon\mathcal{A}(X)\to Y$ be an orthogonally additive, continuous $n$-homogeneous polynomial. If $X^*$ has the…
We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Q_s colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition…
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying…
We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…