相关论文: A graphic generalization of arithmetic

Graphical models have proven to be powerful tools for representing high-dimensional systems of random variables. One example of such a model is the undirected graph, in which lack of an edge represents conditional independence between two…

We present a geometric approach to defining an algebra $\hat{\mathcal G}(M)$ (the Colombeau algebra) of generalized functions on a smooth manifold $M$ containing the space ${\mathcal D}'(M)$ of distributions on $M$. Based on differential…

Let $L_n$ be a line graph with $n$ edges and $\F(L_n)$ the facet ideal of its matching complex. In this paper, we provide the irreducible decomposition of $\F(L_n)$ and some exact formulas for the projective dimension and the regularity of…

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…

We provide a "shared axiomatization" of natural numbers and hereditarily finite sets built around a polymorphic abstraction of bijective base-2 arithmetics. The "axiomatization" is described as a progressive refinement of Haskell type…

Built upon the shoulders of graph theory, the field of complex networks has become a central tool for studying real systems across various fields of research. Represented as graphs, different systems can be studied using the same analysis…

Plural (or multiple-conclusion) cuts are inferences made by applying a structural rule introduced by Gentzen for his sequent formulation of classical logic. As singular (single-conclusion) cuts yield trees, which underlie ordinary natural…

We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…

Recent work has generalized the Furstenberg correspondence between sets of integers and dynamical systems to versions which involve sequences of finite graphs or sequences of $L^\infty$ functions. We give a unified version of the theorem…

Suppose we have an arrangement $\mathcal{A}$ of $n$ geometric objects $x_1, \dots, x_n \subseteq \mathbb{R}^2$ in the plane, with a distinguished point $p_i$ in each object $x_i$. The generalized transmission graph of $\mathcal{A}$ has…

We develop a graphical notation to introduce classical Lie algebras. Although this paper deals with well-known results, our pictorial point of view is slightly different to the traditional one. Our graphical notation is fairly elementary…

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…

For a set-endofunctor $F$, a graph is triple $(V,E,g)$ with a structure map $g:E\rightarrow F V$. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over $Set\times Set$ and use the…

We present a new probabilistic modelling framework based on the recent notion of normal factor graph (NFG). We show that the proposed NFG models and their transformations unify some existing models such as factor graphs, convolutional…

We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…

In this paper, author uses set theory to construct a logic model of abstract figure from binary relation. Based on the uniform quantified structure, author gives two logic system for graph traversal and graph coloring respectively, moreover…

It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…

The area of graph property testing seeks to understand the relation between the global properties of a graph and its local statistics. In the classical model, the local statistics of a graph is defined relative to a uniform distribution…

In this work, we consider an extension of graphical models to random graphs, trees, and other objects. To do this, many fundamental concepts for multivariate random variables (e.g., marginal variables, Gibbs distribution, Markov properties)…

Let $\mathbb {F}_q$ be finite field with $q$ elements. Let $\alpha\leqslant n$ be positive integers. Consider the general linear group $\mathrm{GL}(\alpha+n, \mathbb {F}_q) $ and its subgroup $H(n)$, which fixes the first $\alpha$ basis…