We develop a dimer model for the Alexander polynomial of a knot. This recovers Kauffman's state sum model for the Alexander polynomial using the language of dimers. By providing some additional structure we are able to extend this model to give a state sum formula for the twisted Alexander polynomial of a knot depending on a representation of the knot group.

We consider a polynomial – which we term the “slope polynomial” – that encodes information about slopes of lines defined by a point-set in finite affine planes. When the aforementioned point-set is the graph of a permutation, we show that constancy of the polynomial is equivalent to the permutation being linear. This has immediate consequences for the structure of the 3-uniform hypergraph of co...

the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. 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 particular, the polynomial enumerates the number of different ways the unlabeled imbeddings can be vertex colored and enumerates the labeled and unlabele...

By establishing a connection between the sigma polynomial and the homomorphism polynomial, many of the proofs for computing the sigma polynmial are simplified, the homomorphism polynomial can be identified for several new classes of graphs, and progress can be made on identifying homomorphism polynomials.

We give resource bounded versions of the Completeness Theorem for propositional and predicate logic. For example, it is well known that every computable consistent propositional theory has a computable complete consistent extension. We show that, when length is measured relative to the binary representation of natural numbers and formulas, every polynomial time decidable propositional theory ha...

A general classification of linear differential and finite-difference operators possessing a finite-dimensional invariant subspace with a polynomial basis is given. The main result is that any operator with the above property must have a representation as a polynomial element of the universal enveloping algebra of the algebra of differential (difference) operators in finitedimensional represent...

We define a class of generic CR submanifolds of C n of real codi-mension d, 1 ≤ d ≤ n − 1, called the Bloom-Graham model graphs, whose graphing functions are partially decoupled in their dependence on the variables in the real directions. We prove a global version of the Baouendi-Treves CR approximation theorem, for Bloom-Graham model graphs with a polynomial growth assumption on their graphing...

We construct the polynomial induction functor, which is right adjoint to restriction functor from category of representations a general linear group its Weyl group. This construction leads representation-theoretic proof Littlewood’s plethystic formula for multiplicity an irreducible representation symmetric in such restriction. The unimodality certain bipartite partition functions follows.

We obtain new necessary conditions on a graph which shares the same chromatic polynomial as that of the complete tripartite graph Km,n,r. Using these, we establish the chromatic equivalence classes for K1,n,n+1 (where n ≥ 2). This gives a partial solution to a question raised earlier by the authors. With the same technique, we further show that Kn−3,n,n+1 is chromatically unique if n ≥ 5. In th...