Construction Methods for Gaussoids

02/28/2019
by   Tobias Boege, et al.
0

The number of n-gaussoids is shown to be a double exponential function in n. The necessary bounds are achieved by studying construction methods for gaussoids that rely on prescribing 3-minors and encoding the resulting combinatorial constraints in a suitable transitive graph. Various special classes of gaussoids arise from restricting the allowed 3-minors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2021

Asymptotics of running maxima for φ-subgaussian random double arrays

The article studies the running maxima Y_m,j=max_1 ≤ k ≤ m, 1 ≤ n ≤ j X_...
research
01/12/2018

Estimating the Number of Connected Components in a Graph via Subgraph Sampling

Learning properties of large graphs from samples has been an important p...
research
06/13/2019

Link Dimension and Exact Construction of a Graph

Minimum resolution set and associated metric dimension provide the basis...
research
01/03/2020

Representing graphs as the intersection of cographs and threshold graphs

A graph G is said to be the intersection of graphs G_1,G_2,...,G_k if V(...
research
01/05/2023

Double-Exponential transformation: A quick review of a Japanese tradition

This article is a short introduction to numerical methods using the doub...
research
09/02/2022

Models of VTC^0 as exponential integer parts

We prove that (additive) ordered group reducts of nonstandard models of ...
research
07/13/2020

Performance Analysis of Identification Codes

In this paper we analyse the construction of identification codes. Ident...

Please sign up or login with your details

Forgot password? Click here to reset