Related papers: Pfaffians and nonintersecting paths in graphs with…

In quantum field theory the path integral is usually formulated in the wave picture, i.e., as a sum over field evolutions. This path integral is difficult to define rigorously because of analytic problems whose resolution may ultimately…

Many science phenomena are described as interacting particle systems (IPS). The mean field limit (MFL) of large all-to-all coupled deterministic IPS is given by the solution of a PDE, the Vlasov Equation (VE). Yet, many applications demand…

A traversal of a connected graph is a linear ordering of its vertices all of whose initial segments induce connected subgraphs. Traversals, and their refinements such as breadth-first and depth-first traversals, are computed by various…

A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection…

Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $(\Gamma,\psi)$ through the choice of an incidence $G$-phase matrix inducing $\psi$. We prove that the switching equivalence class of the gain function on the line…

Let $n$ be a positive integer. For each $0\leq j \leq n-1$ we let $C_n^{j}$ denote Cayley graph for the cyclic group ${\mathbb Z}_n $ with respect to the subset $\{1, j\}$. For any such pair $(n,j)$ we compute the size of the Grothendieck…

We consider a model for chaotic diffusion with amplification on graphs associated with piecewise-linear maps of the interval [S. Lepri, Chaos Solitons & Fractals, 139,110003 (2020)]. We determine the conditions for having fat-tailed…

We describe an algorithm for computing certain characteristic numbers of surface scrolls using degenerations. As a corollary we obtain a method for computing the corresponding Gromov-Witten invariants of Grassmannians.

Finding a Hamilton graph from simple connected graphs is an important problem in discrete mathematics and computer science. Grinberg Theorem is a well-known necessary condition for planar Hamilton graphs. It divides a plane into two parts:…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

We will pursue a way of building up an algebraic structure that involves, in a mathematical abstract way, the well known Grassmann variables. The problem arises when we tried to understand the grassmannian polynomial expansion on the scope…

For a given manifold $M$ we consider the non-linear Grassmann manifold $Gr_n(M)$ of $n$-dimensional submanifolds in $M$. A closed $(n+2)$-form on $M$ gives rise to a closed 2-form on $Gr_n(M)$. If the original form was integral, the 2-form…

The intuitive notion of the Gromov invariant for maps from a Riemann surface to a Grassmannian is shown to agree with the definition in \cite{BDW}. Also, an induction on the genus is proved, which extends the results of \cite{BDW} to a…

The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…

We formulate a conjecture classifying algebraic solutions to (possibly non-linear) algebraic differential equations, in terms of the primes appearing in the denominators of the coefficients of their Taylor expansion at a non-singular point.…

We investigate the Drazin invertibility of adjacency matrices associated with a class of oriented graphs known as oriented Dutch windmill graphs. By analyzing walks of prescribed lengths and exploiting the structure of the minimal…

We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…

We construct novel solutions to the set-theoretical entwining Yang-Baxter equation. These solutions are birational maps involving non-commutative dynamical variables which are elements of the Grassmann algebra of order $n$. The maps arise…

Given a base field $\Bbbk$ of characteristic zero, for each graph $G$, we associate the artinian algebra $A(G)$ defined by the edge ideal of $G$ and the squares of the variables. We study the weak Lefschetz property of $A(G)$. We classify…

Arithmetical structures on a graph were introduced by Lorenzini as some intersection matrices that arise in the study of degenerating curves in algebraic geometry. In this article we study these arithmetical structures, in particular we are…