相关论文: Set maps, umbral calculus, and the chromatic polyn…

Chromatic polynomials are important objects in graph theory and statistical physics, but as a result of computational difficulties, their study is limited to graphs that are small, highly structured, or very sparse. We have devised and…

These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

The representation is essentially the same as that given by J.P.Nagle in J. Comb. Theory (B), 1971, 10:1, 42--59. The distinction is in the definition of the weighting function via the number of flows. This new definition allows one to…

The article focuses on three different notions of polynomiality for maps of modules. In addition to the polynomial maps studied by Eilenberg and Mac Lane and the strict polynomial maps ("lois polynomes") considered by Roby, we introduce…

Motivated by Dohmen-P\"onitz-Tittmann's bivariate chromatic polynomial $\chi_G(x,y)$, which counts all $x$-colorings of a graph $G$ such that adjacent vertices get different colors if they are $\le y$, we introduce a bivarate version of…

Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.

The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

This article is a survey of the exponential polynomials (also called single-variable Bell polynomials) from the point of view of Analysis. Some new properties are included and several Analysis-related applications are mentioned.

P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…

The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…

In an earlier paper, the present authors (2013) introduced the altermatic number of graphs and used Tucker's Lemma, an equivalent combinatorial version of the Borsuk-Ulam Theorem, to show that the altermatic number is a lower bound for the…

A k-uniform hypergraph is algebraic if its vertex set is n-dimensional Euclidean space, for some n, and its hyperedge set is defined from the zero set of some polynomial. The chromatic numbers of all algebraic hypergraphs are determined,…

We consider the bialgebra of hypergraphs, a generalization of Schmitt's Hopf algebra of graphs, and show it has a cointeracting bialgebra. So one has a double bialgebra in the sense of L. Foissy, who recently proved there is then a unique…

This paper presents the basic properties of chromatic derivatives and chromatic expansions and provides an appropriate motivation for introducing these notions. Chromatic derivatives are special, numerically robust linear differential…

In this note, by the umbra calculus method, the Sun and Zagier's congruences involving the Bell numbers and the derangement numbers are generalized to the polynomial cases. Some special congruences are also provided.

One discovers why the solution of generalized umbral calculus difference nonhomogeneous equation in the form recently proposed by the author extends here now to generalized appellian delta operator and corresponding polynomials case almost…

Khovanov introduced a bigraded cohomology theory of links whose graded Euler characteristic is the Jones polynomial. The theory was subsequently applied to the chromatic polynomial of graph, resulting in a categorification known as the…

We exhibit non-switching-isomorphic signed graphs that share a common underlying graph and common chromatic polynomials, thereby answering a question posed by Zaslavsky. For various joins of all-positive or all-negative signed complete…