中文
相关论文

相关论文: A weighted graph problem from commutative algebra

200 篇论文

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

表示论 · 数学 2024-11-20 Rebecca Bourn , William Q. Erickson , Jeb F. Willenbring

Goda showed that the twisted Alexander polynomial can be recovered from the zeta function of a matrix-weighted graph. Motivated by this, we study transformations of weighted graphs that preserve this zeta function, introducing a notion of…

几何拓扑 · 数学 2025-04-01 Atsuhide Nagasaka

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

量子代数 · 数学 2007-05-23 Laure Helme-Guizon , Yongwu Rong

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

组合数学 · 数学 2007-05-23 Aleksandr Golubchik

We discuss the formal aspects of the factorial polynomials and of the associated series. We develop the theory using the formalism of quasi-monomials and prove the usefulness of the method for the solutions of nontrivial difference…

偏微分方程分析 · 数学 2011-07-21 D. Babusci , G. Dattoli , M. Carpanese

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

数据结构与算法 · 计算机科学 2012-04-13 Vinícius G. P. de Sá , Guilherme D. da Fonseca , Raphael Machado , Celina M. H. de Figueiredo

We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let $G$ be a weighted graph with $n$ vertices. In the most general setting, the $n$ vertices are known and no other information about $G$…

组合数学 · 数学 2012-01-19 Jeong Han Kim

We establish connectedness criteria for graphs associated to monomials in certain quotients of the mod 2 dual Steenrod algebra. We also investigate questions about trees and Hamilton cycles in the context of these graphs. Finally, we…

代数拓扑 · 数学 2021-06-08 Donald M. Larson

In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…

动力系统 · 数学 2023-05-04 Alexander Mundey

For any unital commutative ring $R$ and for any graph $E$, we identify the commutative core of the Leavitt path algebra of $E$ with coefficients in $R$, which is a maximal commutative subalgebra of the Leavitt path algebra. Furthermore, we…

环与代数 · 数学 2018-12-18 Cristóbal Gil Canto , Alireza Nasr-Isfahani

The complexity class NP of decision problems that can be solved nondeterministically in polynomial time is of great theoretical and practical importance where the notion of polynomial-time reductions between NP-problems is a key concept for…

计算复杂性 · 计算机科学 2022-12-23 Hans-Jörg Kreowski , Sabine Kuske , Aaron Lye , Aljoscha Windhorst

A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.

组合数学 · 数学 2007-05-23 Baris Altunkaynak

Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…

组合数学 · 数学 2026-04-13 Feihu Liu

Motivated by questions about square-free monomial ideals in polynomial rings, in 2010 Francisco et al. conjectured that for every positive integer k and every k-critical (i.e., critically k-chromatic) graph, there is a set of vertices whose…

组合数学 · 数学 2014-01-15 Tomáš Kaiser , Matěj Stehlík , Riste Škrekovski

Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_1, \ldots, x_n\}$ and $I(G) \subset K[V(G)]$ its edge ideal, where $K[V(G)]$ is the polynomial ring in $x_1, \ldots, x_n$ over a field $K$ with each ${\rm deg} x_i = 1$ and…

交换代数 · 数学 2019-02-28 Takayuki Hibi , Hiroju Kanno , Kazunori Matsuda

We define the notion of a twisted topological graph algebra associated to a topological graph and a $1$-cocycle on its edge set. We prove a stronger version of a Vasselli's result. We expand Katsura's results to study twisted topological…

算子代数 · 数学 2019-02-20 Hui Li

In the polynomial ring $T=k[y_1,...,y_n]$, with $n>1$, we bound the multiplicity of homogeneous radical ideals $I\subset (y_1^{a_1},...,y_n^{a_n})$ such that $T/I$ is a graded $k$-algebra with Krull dimension one. As a consequence we solve…

交换代数 · 数学 2011-10-05 Enrico Carlini , Maria Virginia Catalisano , Anthony V. Geramita

We introduce a universal weight system (a function on chord diagrams satisfying the $4$-term relation) taking values in the ring of polynomials in infinitely many variables whose particular specializations are weight systems associated with…

组合数学 · 数学 2024-11-19 Maxim Kazarian , Zhuoke Yang

Let $R$ be a commutative ring with $\Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $\T(\Gamma(R))$. It is the (undirected) graph with all elements of $R$ as vertices, and for distinct $x, y\in…

交换代数 · 数学 2010-02-01 Hamid Reza Maimani , Cameron Wickham , Siamak Yassemi

This paper is concerned with the combinatorial description of the graded minimal free resolution of certain monomial algebras which includes toric rings. Concretely, we explicitly describe how the graded minimal free resolution of those…

交换代数 · 数学 2010-01-21 Ignacio Ojeda , A. Vigneron-Tenorio