Related papers: RTD-Conjecture and Concept Classes Induced by Grap…
In this article functorial Feynman rules are introduced as large generalizations of physicists Feynman rules, in the sense that they can be applied to arbitrary classes of hypergraphs, possibly endowed with any kind of structure on their…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
Knowledge graphs represent known facts using triplets. While existing knowledge graph embedding methods only consider the connections between entities, we propose considering the relationships between triplets. For example, let us consider…
We characterise the computational power of recurrent graph neural networks (GNNs) in terms of arithmetic circuits over the real numbers. Our networks are not restricted to aggregate-combine GNNs or other particular types. Generalising…
We provide two representations of the Segal category $\mathcal{X}$ modeling natural phenomena, the first one being based on the concept of micro-reversibility, producing a long sequence $\Sigma$ of categories as a resolution of…
We introduce a notion of global dimension for a triangulated category relative to a compact silting object. We prove that the finiteness of this dimension is an intrinsic property of the triangulated category itself and, therefore,…
The purpose of the present paper is to prove for finitely generated groups of type I the following conjecture of A.Fel'shtyn and R.Hill, which is a generalization of the classical Burnside theorem. Let G be a countable discrete group, f one…
In the realm of machine learning theory, to prevent unnatural coding schemes between teacher and learner, No-Clash Teaching Dimension was introduced as provably optimal complexity measure for collusion-free teaching. However, whether…
Let $G=(V,E)$ be a countable graph. The Bunkbed graph of $G$ is the product graph $G \times K_2$, which has vertex set $V\times \{0,1\}$ with "horizontal'' edges inherited from $G$ and additional "vertical'' edges connecting $(w,0)$ and…
Continual learning enables models to acquire new knowledge over time while retaining previously learned capabilities. However, its application to text-to-3D generation remains unexplored. We present ReConText3D, the first framework for…
We continue the study of $(tw,\omega)$-bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the…
We propose a recurrent extension of the Ladder networks whose structure is motivated by the inference required in hierarchical latent variable models. We demonstrate that the recurrent Ladder is able to handle a wide variety of complex…
The notion of virtual global generation (VGG) for a vector bundle has multiple possible generalization from the case of curves to higher dimensional normal projective varieties. We study relationship between these notions. All these notions…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…
We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $G^{epex}$ the class of graphs that are at most one edge away from being in $\mathcal{G}$. We note that $G^{epex}$ is…
We state and prove a topological recursion relation that expresses any genus-g Gromov-Witten invariant of a projective manifold with at least a (3g-1)-st power of a cotangent line class in terms of invariants with fewer cotangent line…
We introduce a new class of graphical models that generalizes Lauritzen-Wermuth-Frydenberg chain graphs by relaxing the semi-directed acyclity constraint so that only directed cycles are forbidden. Moreover, up to two edges are allowed…