Related papers: Construction Methods for Gaussoids

The success of machine learning methods heavily relies on having an appropriate representation for data at hand. Traditionally, machine learning approaches relied on user-defined heuristics to extract features encoding structural…

In this paper, we survey and refine several results -- some previously established in the literature -- that facilitate the construction of exponential bases on planar domains with explicit control over the associated frame bounds. We apply…

Let $n\geq 3$ and $r_n$ be a $3$-polytopal graph such that for every $3\leq i\leq n$, $r_n$ has at least one vertex of degree $i$. We find the minimal vertex count for $r_n$. We then describe an algorithm to construct the graphs $r_n$. A…

The sub-Gaussian stable distribution is a heavy-tailed elliptically contoured law which has interesting applications in signal processing and financial mathematics. This work addresses the problem of feasible estimation of distributions. We…

Bi-spinor and G-structure methods are used to classify the possible consistent truncations of type II supergravity to $d=6$ Einstein-Maxwell (gauged) supergravity, and its consistent sub-sectors. In the absence of R-symmetry gauging and a…

The paper bounds the number of tessellations with T-shaped vertices on a fixed set of $k$ lines: tessellations are efficiently encoded, and algorithms retrieve them, proving injectivity. This yields existence of a completely random…

We show that density models describing multiple observables with (i) hard boundaries and (ii) dependence on external parameters may be created using an auto-regressive Gaussian mixture model. The model is designed to capture how observable…

This text contains some notes on the Griesmer bound. In particular, we give a geometric proof of the Griesmer bound for the generalized weights and show that a Solomon--Stiffler type construction attains it if the minimum distance is…

Representation theory provides a suitable framework to count and classify invariants in tensor models. We show that there are two natural ways of counting invariants, one for arbitrary rank of the gauge group and a second, which is only…

We prove that for every graph $G$ with $n$ vertices, the treewidth of $G$ plus the treewidth of the complement of $G$ is at least $n-2$. This bound is tight.

For a class of Gaussian stationary processes, we prove a limit theorem on the convergence of the distributions of the scaled last exit time over a slowly growing linear boundary. The limit is a double exponential (Gumbel) distribution.

We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not…

Finite subdivision rules in high dimensions can be difficult to visualize and require complex topological structures to be constructed explicitly. In many applications, only the history graph is needed. We characterize the history graph of…

A constructive method is provided that outputs a directed graph which is named a broken crown graph, containing $5n-9$ vertices and $k$ Hamiltonian cycles for any choice of integers $n \geq k \geq 4$. The construction is not designed to be…

An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…

We construct a weakly complete flat surface in hyperbolic 3-space having a pair of hyperbolic Gauss maps both of whose images are contained in an arbitrarily given open disc in the ideal boundary of H^3. This construction is accomplished as…

We set forth a new method for generating model-agnostic, nonparametric priors for neutron star equation-of-state inference that are stable, causal and thermodynamically consistent by construction. This generalizes Gaussian processes to…

In this paper we study the problem of prescribing the Gaussian curvature under a conformal change of the metric. We are concerned with the problem posed on a subdomain of the 2-sphere under Neumann boundary conditions of the conformal…

Gaussian process (GP) models provide a powerful tool for prediction but are computationally prohibitive using large data sets. In such scenarios, one has to resort to approximate methods. We derive an approximation based on a composite…

We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…