中文
相关论文

相关论文: Sullivant-Talaska ideal of the cyclic Gaussian Gra…

200 篇论文

We prove a conjecture due to Sturmfels and Uhler concerning the degree of the projective variety associated to the Gaussian graphical model of the cycle. We involve new methods based on the intersection theory in the space of complete…

代数几何 · 数学 2021-11-05 Rodica Andreea Dinu , Mateusz Michałek , Martin Vodička

In this article, we compute the precise value of the maximum likelihood degree of the Gaussian graphical model of a cycle, confirming a conjecture due to Drton, Sturmfels and Sullivant.

代数几何 · 数学 2025-03-05 Rodica Andreea Dinu , Martin Vodička

Gaussian graphical models are semi-algebraic subsets of the cone of positive definite covariance matrices. They are widely used throughout natural sciences, computational biology and many other fields. Computing the vanishing ideal of the…

代数几何 · 数学 2020-09-22 Pratik Misra , Seth Sullivant

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

交换代数 · 数学 2011-10-04 Alexander Engstrom , Patrik Noren

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $I(G)$ be its edge ideal in the ring $K[x_0,\ldots,x_{n-1}]$. Under the hypothesis that $n$ is prime we : 1) compute the…

交换代数 · 数学 2017-06-07 Giancarlo Rinaldo

A cut ideal of a graph records the relations among the cuts of the graph. These toric ideals have been introduced by Sturmfels and Sullivant who also posed the problem of relating their properties to the combinatorial structure of the…

交换代数 · 数学 2009-04-28 Uwe Nagel , Sonja Petrović

We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…

交换代数 · 数学 2015-01-14 Viviana Ene , Jürgen Herzog , Takayuki Hibi , Ayesha Asloob Qureshi

In this article, we provide an explicit description of a set of generators for any ideal of an ultragraph Leavitt path algebra. We provide several additional consequences of this description, including information about generating sets for…

环与代数 · 数学 2021-09-23 T. T. H. Duyen , D. ~Gonçalves , T. G. Nam

B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…

交换代数 · 数学 2011-05-19 Anda Olteanu

In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…

组合数学 · 数学 2014-04-08 P. Clarke

We introduce some determinantal ideals of the generalized Laplacian matrix associated to a digraph G, that we call critical ideals of G. Critical ideals generalize the critical group and the characteristic polynomials of the adjacency and…

交换代数 · 数学 2014-02-21 Hugo Corrales , Carlos E. Valencia

It is shown that every Leavitt path algebra L of an arbitrary directed graph E over a field K is an arithmetical ring, that is, the two-sided ideals of L form a distributive lattice. It is also shown that L is a multiplication ring, that…

环与代数 · 数学 2016-06-07 Kulumani M. Rangaswamy

Cut ideals are used in algebraic statistics to study statistical models defined by graphs. Intuitively, topological restrictions on the graphs should imply structural statements about the corresponding cut ideals. Several theorems and many…

交换代数 · 数学 2010-11-22 Alexander Engstrom

We give a necessary and sufficient graph-theoretic characterization of toric ideals of graphs that are unimodular. As a direct consequence, we provide the structure of unimodular graphs by proving that the incidence matrix of a graph $G$ is…

交换代数 · 数学 2025-10-15 Christos Tatakis

Generalizing a result of Conway, Sloane, and Wilkes for real reflection groups, we show the Cayley graph of an imprimitive complex reflection group with respect to standard generating reflections has a Hamiltonian cycle. This is consistent…

组合数学 · 数学 2014-03-05 Cathy Kriloff , Terry Lay

Let I be either the ideal of maximal minors or the ideal of 2-minors of a row graded or column graded matrix of linear forms L. In two previous papers we showed that I is a Cartwright-Sturmfels ideal, that is, the multigraded generic…

交换代数 · 数学 2016-09-01 Aldo Conca , Emanuela De Negri , Elisa Gorla

Based on the structure theory of pairs of skew-symmetric matrices, we give a conjecture for the Hilbert series of the exterior algebra modulo the ideal generated by two generic quadratic forms. We show that the conjectured series is an…

交换代数 · 数学 2019-07-08 Veronica Crispin Quiñonez , Samuel Lundqvist , Gleb Nenashev

We study phylogenetic invariants of models of evolution whose group of symmetries is the cyclic group with 3 elements. We prove that projective schemes corresponding to the ideal I of phylogenetic invariants of such a model and to its…

代数几何 · 数学 2015-09-30 Maria Donten-Bury

We describe primitive and prime ideals in the C*-algebra C*(E) of a graph E satisfying Condition (K), together with the topologies on each of these spaces. In particular, we find that primitive ideals correspond to the set of maximal tails…

算子代数 · 数学 2014-06-17 Gene Abrams , Mark Tomforde

In this paper we revisit the likelihood geometry of Gaussian graphical models. We give a detailed proof that the ML-degree behaves monotonically on induced subgraphs. Furthermore, we complete a missing argument that the ML-degree of the…

统计理论 · 数学 2024-10-10 Carlos Améndola , Rodica Andreea Dinu , Mateusz Michałek , Martin Vodička
‹ 上一页 1 2 3 10 下一页 ›