Related papers: A classification of one dimensional affine rank th…

A subperiodic group is a group of motions of $d$-dimensional Euclidean space $\R^d$ which contains a translation lattice $\Z^r$ of rank $r < d$ as a subgroup of finite index. A classification into abstract group isomorphism classes is…

The notion of poor manifolds was introduced by Bandman and Zarhin, who asked for their classification. We study poor compact K\"ahler manifolds, i.e. those containing no rational curves and no codimension-one analytic subvarieties. We…

We exhibit finitely generated groups with prescribed Poincar\'e profiles. It can be prescribed for functions between $n/\log n$ and linear, and is sharp for functions at least $n/(\log\log n)$. Those profiles were introduced by Hume, Mackay…

We show that the category of affine bundles over a smooth manifold M is equivalent to the category of affine spaces modelled on projective finitely generated C^\infty(M)-modules. Using this equivalence of categories, we are able to give an…

Let $k \geq 2$ be an integer. Let $q$ be a prime power such that $q \equiv 1 \pmod {k}$ if $q$ is even, or, $q \equiv 1 \pmod {2k}$ if $q$ is odd. The generalized Paley graph of order $q$, $G_k(q)$, is the graph with vertex set…

Graph Neural Nets (GNNs) have received increasing attentions, partially due to their superior performance in many node and graph classification tasks. However, there is a lack of understanding on what they are learning and how sophisticated…

Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…

We study the cohomological classification of vector bundles on smooth real affine surfaces and threefolds. We show that, as was observed in joint work in A. Asok and J. Fasel and in a coming joint paper with S. Banerjee and J. Fasel, under…

We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…

Let f be a smooth diffeomorphism of the half-line fixing only the origin and Z^r its centralizer in the group of C^r diffeomorphisms. According to well-known results of Szekeres and Kopell, Z^1 is a one-parameter group. On the other hand,…

Graph kernels have become an established and widely-used technique for solving classification tasks on graphs. This survey gives a comprehensive overview of techniques for kernel-based graph classification developed in the past 15 years. We…

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

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…

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

We propose graph kernels based on subgraph matchings, i.e. structure-preserving bijections between subgraphs. While recently proposed kernels based on common subgraphs (Wale et al., 2008; Shervashidze et al., 2009) in general can not be…

In his PhD Thesis, E.R. Scheinerman conjectured that planar graphs are intersection graphs of line segments in the plane. This conjecture was proved with two different approaches by J. Chalopin and the author, and by the author, L.…

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…

The sparsity order of a (simple undirected) graph is the highest possible rank (over ${\mathbb R}$ or ${\mathbb C}$) of the extremal elements in the matrix cone that consists of positive semidefinite matrices with prescribed zeros on the…

Graph classification plays a pivotal role in various domains, including pathology, where images can be represented as graphs. In this domain, images can be represented as graphs, where nodes might represent individual nuclei, and edges…

An enumerative problem on a variety $V$ is usually solved by reduction to intersection theory in the cohomology of a compactification of $V$. However, if the problem is invariant under a "nice" group action on $V$ (so that $V$ is…