Related papers: Counting quadrant walks via Tutte's invariant meth…
The spectral theory of the Laplace differential operator for biregular quantum graphs is developed. Trees are studied in detail. Generating functions for closed non backtracking walks appear when resolvents for trees are related to…
We introduce enumerative invariants of real del Pezzo surfaces that count real rational curves belonging to a given divisor class, passing through a generic conjugation-invariant configuration of points and satisfying preassigned tangency…
A fourientation of a graph $G$ is a choice for each edge of the graph whether to orient that edge in either direction, leave it unoriented, or biorient it. We may naturally view fourientations as a mixture of subgraphs and graph…
We consider the enumeration of walks on the non-negative lattice $\mathbb{N}^d$, with steps defined by a set $\mathcal{S} \subset \{-1, 0, 1\}^d \setminus \{\mathbf{0}\}$. Previous work in this area has established asymptotics for the…
Using the framework of Tutte embeddings, we begin an exploration of \emph{quantum graph drawing}, which uses quantum computers to visualize graphs. The main contributions of this paper include formulating a model for quantum graph drawing,…
We extend the classification of nearest neighbour walks in the quarter plane to models in which multiplicities are attached to each direction in the step set. Our study leads to a small number of infinite families that completely…
We prove some variants of the exponential formula and apply them to the multivariate Tutte polynomials (also known as Potts-model partition functions) of graphs. We also prove some further identities for the multivariate Tutte polynomial,…
We present two classes of random walks restricted to the quarter plane whose generating function is not holonomic. The non-holonomy is established using the iterated kernel method, a recent variant of the kernel method. This adds evidence…
In a 1976 paper published in Science, Knuth presented an algorithm to sample (non-uniform) self-avoiding walks crossing a square of side k. From this sample, he constructed an estimator for the number of such walks. The quality of this…
We propose an experimental mathematics approach leading to the computer-driven discovery of various structural properties of general counting functions coming from enumeration of walks.
In the literature can be found several descriptions of the Tutte polynomial of graphs. Tutte defined it thanks to a notion of activity based on an ordering of the edges. Thereafter, Bernardi gave a non-equivalent notion of the activity…
Various lattice path models are reviewed. The enumeration is done using generating functions. A few bijective considerations are woven in as well. The kernel method is often used. Computer algebra was an essential tool. Some results are…
Recent work of Kass--Wickelgren gives an enriched count of the $27$ lines on a smooth cubic surface over arbitrary fields. Their approach using $\mathbb{A}^1$-enumerative geometry suggests that other classical enumerative problems should…
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…
We take an elementary and systematic approach to the problem of extending the Tutte polynomial to the setting of embedded graphs. Four notions of embedded graphs arise naturally when considering deletion and contraction operations on graphs…
This thesis deals with the Tutte polynomial, studied from different points of view. In the first part, we address the enumeration of planar maps equipped with a spanning forest, here called forested maps, with a weight $z$ per face and a…
The functions satisfying the mean value property for an n-dimensional cube are determined explicitly. This problem is related to invariant theory for a finite reflection group, especially to a system of invariant differential equations.…
We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues…
The dynamical triangulations approach to quantum gravity is investigated in detail for the first time in five dimensions. In this case, the most general action that is linear in components of the f-vector has three terms. It was suspected…
We define a quaternionic extension of the Szegedy walk on a graph and study its right spectral properties. The condition for the transition matrix of the quaternionic Szegedy walk on a graph to be quaternionic unitary is given. In order to…