Related papers: Algebraic combinatorics on trace monoids: extendin…
Hypergraphs have been a recent focus of study in mathematical data science as a tool to understand complex networks with high-order connections. One question of particular relevance is how to leverage information carried in hypergraph…
Directed acyclic graphs whose nodes are all the divisors of a positive integer $n$ and arcs $(a,b)$ defined by $a$ divides $b$ are considered. Fourteen graph invariants such as order, size, and the number of paths are investigated for two…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
In this paper, we introduce a discrete quantum walk model called bipartite walks. Bipartite walks include many known discrete quantum walk models, like arc-reversal walks, vertex-face walks. For the transition matrix of a quantum walk,…
We consider the combinatorial properties of the trace of a random walk on the complete graph and on the random graph $G(n,p)$. In particular, we study the appearance of a fixed subgraph in the trace. We prove that for a subgraph containing…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
The spin analogues of several classical concepts and results for Hecke algebras are established. A Frobenius type formula is obtained for irreducible characters of the Hecke-Clifford algebra. A precise characterization of the trace…
In this paper, we study graph-theoretic analogies of the Mertens' theorems by using basic properties of the Ihara zeta-function. One of our results is a refinement of a special case of the dynamical system Mertens' second theorem due to…
We initiate the program of extending to higher-rank graphs ($k$-graphs) the geometric classification of directed graph $C^*$-algebras, as completed in the 2016 paper of Eilers, Restorff, Ruiz, and Sorensen [ERRS16]. To be precise, we…
Hecke-Kiselman monoids $\textrm{HK}_{\Theta}$ and their algebras $K[\textrm{HK}_{\Theta}]$, over a field $K$, associated to finite oriented graphs $\Theta$ are studied. In the case $\Theta $ is a cycle of length $n\geqslant 3$, a hierarchy…
We provide a generalization of an algebraic linear combination for the trace of certain elliptic modular forms, and through specializing the expression at a suitable pair consisting of an elliptic curve over algebraic number fields and its…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
We give a proof of a formula for the trace of self-braidings (in an arbitrary channel) in UMTCs which first appeared in the context of rational conformal field theories (CFTs). The trace is another invariant for UMTCs which depends only on…
We study graph-theoretic properties of the trace of a random walk on a random graph. We show that for any $\varepsilon>0$ there exists $C>1$ such that the trace of the simple random walk of length $(1+\varepsilon)n\ln{n}$ on the random…
Complex systems consist of interacting units whose interactions may be pairwise, involving two units, or higher-order, involving more than two units simultaneously. Graphs capture pairwise interactions and represent such systems as…
The study of matter fields on an ensemble of random geometries is a difficult problem still in need of new methods and ideas. We will follow a point of view inspired by probability theory techniques that relies on an expansion of the two…
In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their…
From the viewpoint of quantum walks, the Ihara zeta function of a finite graph can be said to be closely related to its evolution matrix. In this note we introduce another kind of zeta function of a graph, which is closely related to, as to…
We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…