Related papers: Incidence Gain Graphs and Generalized Quadrangles
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
Probabilistic generative models of graphs are important tools that enable representation and sampling. Many recent works have created probabilistic models of graphs that are capable of representing not only entity interactions but also…
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…
Structure learning methods for covariance and concentration graphs are often validated on synthetic models, usually obtained by randomly generating: (i) an undirected graph, and (ii) a compatible symmetric positive definite (SPD) matrix. In…
It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…
We use finite incident structures to construct new infinite families of directed strongly regular graphs with parameters \[(l(q-1)q^l,\ l(q-1)q^{l-1},\ (lq-l+1)q^{l-2},\ (l-1)(q-1)q^{l-2},\ (lq-l+1)q^{l-2})\] for integers $q$ and $l$ ($q,…
We study the deep interplay between geometry of quadrics in d-dimensional space and the dynamics of related integrable billiard systems. Various generalizations of Poncelet theorem are reviewed. The corresponding analytic conditions of…
We take the fundamental group of the complement of the branch curve of a generic projection induced from canonical embedding of a surface. This group is stable on connected components of moduli spaces of surfaces. Since for many classes of…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
Graph neural networks (GNN) represent an emerging line of deep learning models that operate on graph structures. It is becoming more and more popular due to its high accuracy achieved in many graph-related tasks. However, GNN is not as well…
In this note, we introduce the first basics on Grothendieck rings for incidence geometries as a new motivic way and tool to study synthetic geometry. In this first instance, we concentrate on generalized quadrangles and related geometries.…
The generalized winding number is an essential part of the geometry processing toolkit, allowing to quantify how much a given point is inside a surface, even when the surface has boundaries and noise. We propose a new universal method to…
In this paper we make an overview of results relating the recent "discoveries" in differential geometry, such as higher structures and differential graded manifolds with some natural problems coming from mechanics. We explain that a lot of…
This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…
We study some graded geometric constructions appearing naturally in the context of gauge theories. Inspired by a known relation of gauging with equivariant cohomology we generalize the latter notion to the case of arbitrary Q-manifolds…
Co lombeau's construction of generalized functions (in its special variant) is extended to a theory of generalized sections of vector bundles. As particular cases, generalized tensor analysis and exterior algebra are studied. A point value…
We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short. FGGs generate sets of factor graphs and can describe a more general class of models than plate notation, dynamic…
A lemma of Tits establishes a connection between the simple connectivity of an incidence geometry and the universal completion of an amalgam induced by a sufficiently transitive group of automorphisms of that geometry. In the present paper,…
We present a construction method for mappings between generalized connections, comprising, e.g., the action of gauge transformations, diffeomorphisms and Weyl transformations. Moreover, criteria for continuity and measure preservation are…
Mean value coordinates can be used to map one polygon into another, with application to computer graphics and curve and surface modelling. In this paper we show that if the polygons are quadrilaterals, and if the target quadrilateral is…