Related papers: Binomiality of colored Gaussian models
The theory of colorful graphs can be developed by working in Galois field modulo (p), p > 2 and a prime number. The paper proposes a program of possible conversion of graph theory into a pleasant colorful appearance. We propose to paint the…
Given a polynomial ring $S = \Bbbk[x_1, \dots, x_n]$ over a field $\Bbbk$, and a monomial ideal $M$ of $S$, we say the quotient ring $R = S/M$ is Macaulay-Lex if for every graded ideal of $R$, there exists a lexicographic ideal of $R$ with…
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no two vertices x in B and y in W are adjacent. In this paper we show that the…
We prove that the group of birational automorphisms of a geometrically irreducible algebraic surface over a finite field is Jordan. We show that the analogous statement fails in higher dimensions. Finally, we prove that groups of birational…
A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability. We explore this relationship in a more general setting with relaxed assumptions on color classes, encoded by a graph…
Inspired by recent developments generalizing Jordan-Wigner dualities to higher dimensions, we develop a framework of such dualities using an algebraic formalism for translation-invariant Hamiltonians proposed by Haah. We prove that given a…
Graphical models provide a framework for exploration of multivariate dependence patterns. The connection between graph and statistical model is made by identifying the vertices of the graph with the observed variables and translating the…
We conclude an investigation of Abrishami, Esperet, Giocanti, Hamman, Knappe and M\"oller studying the existence of periodic colourings of locally finite graphs. A colouring of a graph $\Gamma$ is periodic if the resulting coloured graph…
A bridgeless cubic graph $G$ is said to have a 2-bisection if there exists a 2-vertex-colouring of $G$ (not necessarily proper) such that: (i) the colour classes have the same cardinality, and (ii) the monochromatic components are either an…
In this paper, we prove that a graph $G$ with no $K_{s,s}$-subgraph and twin-width $d$ has $r$-admissibility and $r$-coloring numbers bounded from above by an exponential function of $r$ and that we can construct graphs achieving such a…
Coloured Jones and Alexander polynomials are sequences of quantum invariants recovering the Jones and Alexander polynomials at the first terms. We show that they can be seen conceptually in the same manner, using topological tools, as…
Hadwiger's transversal theorem gives necessary and sufficient conditions for a family of convex sets in the plane to have a line transversal. A higher dimensional version was obtained by Goodman, Pollack and Wenger, and recently a colorful…
We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations on surfaces. The configuration spaces are spaces of points grouped into colors. Whether two points are allowed…
We use a Mayer-Vietoris-like spectral sequence to establish vanishing results for the cohomology of complements of linear and elliptic hyperplane arrangements, as part of a more general framework involving duality and abelian duality…
Color-kinematics duality states that the kinematic numerators of the cubic tree-level Yang-Mills scattering amplitudes obey the same symmetry properties that the color factors obey due to the Jacobi identity. We present a novel strategy for…
We study forced periodicity of two-dimensional configurations under certain constraints and use an algebraic approach to multidimensional symbolic dynamics in which $d$-dimensional configurations and finite patterns are presented as formal…
We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose…
We present a new notion of probabilistic duality for random variables involving mixture distributions. Using this notion, we show how to implement a highly-parallelizable Gibbs sampler for weakly coupled discrete pairwise graphical models…
An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors…
We improve upper bounds on the chromatic number proven independently in \cite{reedNote} and \cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an…