Related papers: Theorems, Problems and Conjectures
It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…
This is an introduction to the Volume Conjecture and its generalizations for nonexperts. The Volume Conjecture states that a certain limit of the colored Jones polynomial of a knot would give the volume of its complement. If we deform the…
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…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…
We adapt ideas of Phong, Stein and Sturm and ideas of Ikromov and M\"uller from the continuous setting to various discrete settings, obtaining sharp bounds for exponential sums and the number of solutions to polynomial congruences for…
In this paper, we consider higher-order Frobenius-Euler polynomi- als associated with poly-Bernoulli polynomials which are derived from polylogarithmic function. These polynomials are called higher-order Frobenius-Euler and poly-Bernoulli…
This thesis is basically devoted to matroids -- fundamental structure of combinatorial optimization -- though some of our results concern simplicial complexes, or Euclidean spaces. We study old and new problems for these structures, with…
The purpose of this paper is mostly to present conjectures that extend, to the ``triangular partition'' context (partitions ``under any line'' in the terminology of Blaziak-Haiman-Morse-Pun-Seelinger), properties of Frobenius of…
These notes, connected to a "potpourri" topics course currently underway, are concerned with some interrelated themes of polynomials, functions on the unit circle or interval, and norms.
Phil Hanlon proved that the coefficients of the chromatic polynomial of a graph G are equal (up to sign) to the dimensions of the summands in a Hodge-type decomposition of the top homology of the coloring complex for G. We prove a type B…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of…
For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…
We provide methods to compute the colored HOMFLY polynomials of knots and links with symmetric representations based on the linear skein theory. By using diagrammatic calculations, several formulae for the colored HOMFLY polynomials are…
Let $k,a\in \mathbb{N}$ and let $p_1,\cdots,p_k\in \mathbb{Q}[n]$ with zero constant term. We show that for any finite coloring of $\mathbb{Q}$, there are non-zero $x,y\in \mathbb{Q}$ such that there exists a color which contains a set of…
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…
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
We prove partition regularity of the configuration $x,y,x+y,y/x$ in a strong infinitary form that extends Hindman's Theorem. We study the related issue of partition regularity of configurations involving products of a degree one polynomial…
In this paper we give an introduction to the volume conjecture and its generalizations. Especially we discuss relations of the asymptotic behaviors of the colored Jones polynomials of a knot with different parameters to representations of…