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

We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focus on graph homology and on the appearance of cubical complexes when either reducing internal edges or when removing them by putting them on…

As an extension of positive and almost positive diagrams and links, we study two classes of links we call successively almost positive and weakly successively almost positive links. We prove various properties of polynomial invariants and…

In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…

A new complete invariant for acyclic graphs is presented

We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars,…

We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…

This short survey, which was written to accompany a minicourse at the BIRS conference "Topology in dimension 4.5", concerns invariants of knotted $2$-spheres in $S^4$, also known as $2$-knots. It covers invariants extracted from the…

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,…

The investigation and classification of non-unique factorization phenomena has attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P.A. Garc\'ia-S\'anchez, together with several co-authors, derived…

We consider the algebra of invariants of binary forms of degree 10 with complex coefficients, construct a system of parameters with degrees 2, 4, 6, 6, 8, 9, 10, 14 and find the 106 basic invariants.

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $\Delta$ be its independence complex. We describe the well-covered circulant graphs with 2-dimensional $\Delta$ and…

We formalize eight different notions of isomorphism among (unital) graph C*-algebras, and initiate the study of which of these notions may be described geometrically as generated by moves. We propose a list of seven types of moves that we…

We describe the explicit construction of groves, the smallest gauge invariant classes of tree Feynman diagrams in gauge theories. The construction is valid for gauge theories with any number of group factors which may be mixed. It requires…

We study a class of two-generator two-relator groups, denoted $J_n(m,k)$, that arise in the study of relative asphericity as groups satisfying a transitional curvature condition. Particular instances of these groups occur in the literature…

We study the convergence of distributions on finite paths of weighted digraphs, namely the family of Boltzmann distributions and the sequence of uniform distributions. Targeting applications to the convergence of distributions on paths, we…

We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…

We define a new topological invariant of line arrangements in the complex projective plane. This invariant is a root of unity defined under some combinatorial restrictions for arrangements endowed with some special torsion character on the…

Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…