Related papers: Generalized Splines and Graphic Arrangements
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
Generalized complex geometry is a new mathematical framework that is useful for describing the target space of N=(2,2) nonlinear sigma-models. The most direct relation is obtained at the N=(1,1) level when the sigma model is formulated with…
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…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
We show that if the fundamental groups of the complements of two line arrangements in the complex projective plane are isomorphic to the same direct sum of free groups, then the complements of the arrangements are homotopy equivalent. For…
In this paper, we develop a general analysis for the fixed points of the operators defining the graph splitting methods from [SIAM J. Optim., 34 (2024), pp. 1569-1594] by Bredies, Chenchene and Naldi. We particularize it to the case where…
We extend the concept of Krylov complexity to include general unitary evolutions involving multiple generators. This generalization enables us to formulate a framework for generalized Krylov complexity, which serves as a measure of the…
We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
In this paper, we compute the graph skein algebra of the punctured disk with two holes. Then, we apply the graph skein techniques developed here to establish necessary conditions for a spatial graph to have a symmetry of order $p$, where…
In this note we study the logarithmic derivation module of a non-free arrangement. We prove a generalized addition theorem for all arrangements. This addition theorem allows us to find various relationships between non-free arrangements,…
If $R$ is a commutative ring, $M$ a compact $R$-oriented manifold and $G$ a finite graph without loops or multiple edges, we consider the graph configuration space $M^G$ and a Bendersky-Gitler type spectral sequence converging to the…
On the generalized tangent bundle of a smooth manifold, we study skew-symmetric endomorphism satisfying an arbitrary polynomial equation with real constant coefficients. We study the compatibility of these structures with the de Rham…
In this paper we consider the generalized anchored configuration spaces on $n$ labeled points on a~graph. These are the spaces of all configurations of $n$ points on a~fixed graph $G$, subject to the condition that at least $q$ vertices in…
We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint…
By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and…
In this work we develop a theory of hierarchical clustering for graphs. Our modeling assumption is that graphs are sampled from a graphon, which is a powerful and general model for generating graphs and analyzing large networks. Graphons…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Recently, Manolescu-Sarkar constructed a stable homotopy type for link Floer homology, which uses grid homology and accounts for all domains that do not pass through a specific square. In doing so, they produced an obstruction chain complex…