Related papers: A study on prefixes of $c_2$ invariants

We introduce a type of graph integrals which are holomorphic analogs of configuration space integrals. We prove their (ultraviolet) finiteness by considering a compactification of the moduli space of graphs with metrics, and study their…

We examine invariant nonrecurrent Fatou components of automorphisms of $\mathbb{C}^2$ in the case where all limit maps are constant. We show that except in special cases there cannot be more than one such limit map. We also briefly examine…

We derive an inductive, combinatorial definition of a polynomial-valued regular isotopy invariant of links and tangled graphs. We show that the invariant equals the Reshetikhin-Turaev invariant corresponding to the exceptional simple Lie…

We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…

Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…

We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…

For families of 4-regular directed circulant graphs with $n$ vertices, we count the number of primitive periodic orbits of length up to at least $n$. The relevant counting techniques are then extended to count the number of primitive pseudo…

We explore a family of invariants obtained from linking numbers. This is a family of Kauffman finite type invariants.

Using the spectral theory of weakly convergent sequences of finite graphs, we prove the uniform existence of the integrated density of states for a large class of infinite graphs.

We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$-factor $\mathcal{C}$ and a $1$-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where…

Let $R$ be a commutative ring with identity. The involutory Cayley graph $\mathcal{G}(R)$ of $R$ is defined as the graph whose vertex set is the set of elements of $R$, where two vertices $a$ and $b$ are adjacent exactly when $(a-b)^2=1$.…

We establish analytically several new identities connecting enumerators of different types of circulant graphs of prime, twice prime and prime-squared orders. In particular, it is shown that the semi-sum of the number of undirected…

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

In this paper, we study the vector invariants, ${\bf{F}}[m V_2]^{C_p}$, of the 2-dimensional indecomposable representation $V_2$ of the cylic group, $C_p$, of order $p$ over a field ${\bf{F}}$ of characteristic $p$. This ring of invariants…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…

This paper presents algebraic methods for the study of polynomial relative invariants, when the group G formed by the symmetries and relative symmetries is a compact Lie group. We deal with the case when the subgroup H of symmetries is…

It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…