Related papers: Binomiality of colored Gaussian models

Let $p(Y_1, \dots, Y_d, Z_1, \dots, Z_e)$ be a self-adjoint noncommutative polynomial, with coefficients from $\mathbb{C}^{r \times r}$, in the indeterminates $Y_1, \dots, Y_d$ (considered to be self-adjoint), the indeterminates $Z_1,…

We study two variations of the Gyarfas--Lehel conjecture on the minimum number of monochromatic components needed to cover an edge-coloured complete bipartite graph. Specifically, we show the following. - For p>> (\log n/n)^{1/2},…

We provide a short proof of a conic version of the colorful Carath\'eodory theorem for oriented matroids. Holmsen's extension of the colorful Carath\'eodory theorem to oriented matroids (Advances in Mathematics, 2016) already encompasses…

We consider spaces of plane curves in the setting of algebraic geometry and of singularity theory. On one hand there are the complete linear systems, on the other we consider unfolding spaces of bivariate polynomials of Brieskorn-Pham type.…

The main feature of color Hom-algebras is that the identities defining the structures are twisted by even linear maps. The purpose of this paper is to introduce and give some constructions of admissible Hom-Novikov-Poisson color…

The generalised colouring numbers $\mathrm{adm}_r(G)$, $\mathrm{col}_r(G)$, and $\mathrm{wcol}_r(G)$ were introduced by Kierstead and Yang as generalisations of the usual colouring number, also known as the degeneracy of a graph, and have…

Bayesian statistical graphical models are typically classified as either continuous and parametric (Gaussian, parameterized by the graph-dependent precision matrix with Wishart-type priors) or discrete and non-parametric (with…

The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…

We survey the techniques used in our recent resolution of the Kadison-Singer problem and proof of existence of Ramanujan Graphs of every degree: mixed characteristic polynomials and the method of interlacing families of polynomials. To…

We consider the graph coloring game, a game in which two players take turns properly coloring the vertices of a graph, with one player attempting to complete a proper coloring, and the other player attempting to prevent a proper coloring.…

In this note we extend the spectral theorem for bimodules to the higher rank graph C*-algebra context. Under the assumption that the graph is row finite and has no sources, we show that a bimodule over a natural abelian subalgebra is…

A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be…

Every better quasi-order codifies a Borel graph that does not contain a copy of the shift graph. It is known that there is a better quasi-order that codes a Borel graph with infinite Borel chromatic number, though one has yet to be…

Colored graphical models provide a parsimonious approach to modeling high-dimensional data by exploiting symmetries in the model parameters. In this work, we introduce the notion of coloring for extremal graphical models on multivariate…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…

In this article we further the study of non-commutative motives. We prove that bivariant cyclic cohomology (and its variants) becomes representable in the category of non-commutative motives. Furthermore, Connes' bilinear pairings…

Let $R=K[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over a field $K$. We show that if $G$ is a connected graph with a basic $5$-cycle $C$, then $G$ is a sequentially Cohen-Macaulay graph if and only if there exists a shedding…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…