Related papers: Extreme coefficients of Jones polynomials and grap…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We extend our recent work on set-theoretic solutions of the Yang-Baxter or braid relations with new results about their automorphism groups, strong twisted unions of solutions and multipermutation solutions. We introduce and study graphs of…
In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…
Roots of graph polynomials such as the characteristic polynomial, the chromatic polynomial, the matching polynomial, and many others are widely studied. In this paper we examine to what extent the location of these roots reflects the graph…
We investigate a family of (reducible) representations of Artin's braid groups corresponding to a specific solution to the Yang-Baxter equation. The images of the braid groups under these representations are finite groups, and we identify…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s. This survey presents these families and their applications related to graphs, digraphs, and hypergraphs.…
For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…
This article contains general formulas for Tutte and Jones polynomial for families of knots and links given in Conway notation.
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…
Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…
The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…
A very simple expression is conjectured for arbitrary colored Jones and HOMFLY polynomials of a rich $(g+1)$-parametric family of Pretzel knots and links. The answer for the Jones and HOMFLY polynomials is fully and explicitly expressed…
Even with the introduction of supercharacter theories, the representation theory of many unipotent groups remains mysterious. This paper constructs a family of supercharacter theories for normal pattern groups in a way that exhibit many of…
We extend several predecessor works on even sextic monogenic polynomials. In particular, we prove a conjecture of Lenny Jones, thereby classifying even sextic monogenic polynomials with cyclic Galois group. This result is key to completing…
We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for $k \geq 18$, most graphs of order $k$ are…
This paper computes the Jones polynomial and the invariants obstructing cosmetic surgery which are derived from it for two infinite families of knots, proving they satisfy the Purely Cosmetic Surgery Conjecture. Both the method of…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
The volume conjecture and its generalization state that the series of certain evaluations of the colored Jones polynomials of a knot would grow exponentially and its growth rate would be related to the volume of a three-manifold obtained by…