Related papers: Dual Graphs and Generating Sequences of Non-diviso…
A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…
We give a conceptual formulation of Kontsevich's `dual construction' producing graph cohomology classes from a differential graded Frobenius algebra with an odd scalar product. Our construction -- whilst equivalent to the original one -- is…
We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical examples of divisible design graphs without loops (DDG's).…
We prove a Bernstein-type theorem for two-valued minimal graphs in the four-dimensional Euclidean space $\mathbf{R}^4$. This states that two-valued functions defined on the entire $\mathbf{R}^3$, and whose graph is a minimal surface, must…
In this paper we find closed form for the generating function of powers of any non-degenerate second-order recurrence sequence, completing a study begun by Carlitz and Riordan in 1962. Moreover, we generalize a theorem of Horadam on partial…
We develop a generating-function formulation for the symbolic reduction of multi-loop Feynman integrals. In this framework, integration-by-parts identities are rewritten as differential equations for sector-wise generating functions, so the…
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…
Starting from the working hypothesis that both physics and the corresponding mathematics have to be described by means of discrete concepts on the Planck-scale, one of the many problems one has to face in this enterprise is to find the…
Training of semantic segmentation models for material analysis requires micrographs and their corresponding masks. It is quite unlikely that perfect masks will be drawn, especially at the edges of objects, and sometimes the amount of data…
Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…
Diffusion models, as a novel generative paradigm, have achieved remarkable success in various image generation tasks such as image inpainting, image-to-text translation, and video generation. Graph generation is a crucial computational task…
The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs,…
Preparing training data for deep vision models is a labor-intensive task. To address this, generative models have emerged as an effective solution for generating synthetic data. While current generative models produce image-level category…
The smallest set of vertices needed to differentiate or categorize every other vertex in a graph is referred to as the graph's metric dimension. Finding the class of graphs for a particular given metric dimension is an NP-hard problem. This…
In real world domains, most graphs naturally exhibit a hierarchical structure. However, data-driven graph generation is yet to effectively capture such structures. To address this, we propose a novel approach that recursively generates…
We consider a class of linear differential operators acting on vector-valued function spaces with general coupled boundary conditions. Unlike in the more usual case of so-called quantum graphs, the boundary conditions can be nonlinear.…
Graph structures offer a versatile framework for representing diverse patterns in nature and complex systems, applicable across domains like molecular chemistry, social networks, and transportation systems. While diffusion models have…
We introduce the concept of $\delta$-sequence. A $\delta$-sequence $\Delta$ generates a well-ordered semigroup $S$ in $\mathbb{Z}^2$ or $\mathbb{R}$. We show how to construct (and compute parameters) for the dual code of any evaluation code…
In this paper we study the algebra of graph invariants, focusing mainly on the invariants of simple graphs. All other invariants, such as sorted eigenvalues, degree sequences and canonical permutations, belong to this algebra. In fact,…