Related papers: Reflexive graph lenses in univalent foundations
The representation theorem for odd or even involutive FLe-chains by bunches of layer groups, as discussed in [10], is redefined to demonstrate a more straightforward constructional relationship between odd or even involutive FLe-chains and…
We prove Leavitt path algebra versions of the two uniqueness theorems of graph C*-algebras. We use these uniqueness theorems to analyze the ideal structure of Leavitt path algebras and give necessary and sufficient conditions for their…
A classical approach for surface classification is to find a compact algebraic representation for each surface that would be similar for objects within the same class and preserve dissimilarities between classes. We introduce Self…
Representing a graph as a vector is a challenging task; ideally, the representation should be easily computable and conducive to efficient comparisons among graphs, tailored to the particular data and analytical task at hand. Unfortunately,…
Let G be a graph with undirected and directed edges. Its representation is given by assigning a vector space to each vertex, a bilinear form on the corresponding vector spaces to each directed edge, and a linear map to each directed edge.…
Given a compact metric graph $\Gamma$ and the Laplacian $\Delta_{\Gamma}$ coupled with standard (Kirchhoff) vertex conditions, solutions to fractional elliptic partial differential equations of the form $(\kappa^2 -…
Given experimental data, one of the main objectives of biological modeling is to construct a model which best represents the real world phenomena. In some cases, there could be multiple distinct models exhibiting the exact same dynamics,…
For a graph $\Gamma$ and group $G$, $G^\Gamma$ is the subgroup of $G^{|\Gamma|}$ generated by elements with $g$ in the coordinates corresponding to $v$ and its neighbors in $\Gamma$. There is a natural epimorphism $G^\Gamma \to…
The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…
In recent work on holomorphic maps that are symmetric under certain complex reflection groups---generated by complex reflections through a set of hyperplanes, the author announced a general conjecture related to reflection groups. The claim…
We give an interpretation of the path model of a representation \cite{Lit1} of a complex semisimple algebraic group $G$ in terms of the geometry of its affine Grassmannian. In this setting, the paths are replaced by LS--galleries in the…
We consider the problem of classification of an object given multiple observations that possibly include different transformations. The possible transformations of the object generally span a low-dimensional manifold in the original signal…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…
Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
Recall that the Rado graph is the unique countable graph that realizes all one-point extensions of its finite subgraphs. The Rado graph is well-known to be universal and homogeneous in the sense that every isomorphism between finite…
This PhD thesis deals with some new models of intensional type theory and the Univalence Axiom introduced by Vladimir Voevodsky. Our work takes place in the framework of the definitions of type-theoretic fibration categories (the notion of…
Most graph kernels are an instance of the class of $\mathcal{R}$-Convolution kernels, which measure the similarity of objects by comparing their substructures. Despite their empirical success, most graph kernels use a naive aggregation of…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…