中文
相关论文

相关论文: The Gr\"obner fan of the Hilbert scheme

200 篇论文

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

组合数学 · 数学 2017-12-27 Péter E. Frenkel

The Parameter Continuation Theorem is the theoretical foundation for polynomial homotopy continuation, which is one of the main tools in computational algebraic geometry. In this note, we give a short proof using Gr\"obner bases. Our…

代数几何 · 数学 2024-07-18 Viktoriia Borovik , Paul Breiding

Suppose we are given a bipartite graph that admits a perfect matching and an adversary may delete any edge from the graph with the intention of destroying all perfect matchings. We consider the task of adding a minimum cost edge-set to the…

数据结构与算法 · 计算机科学 2018-12-06 Felix Hommelsheim , Moritz Mühlenthaler , Oliver Schaudt

A graph $G$ is well-covered if all its maximal stable sets have the same size, denoted by alpha(G) (M. D. Plummer, 1970). If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$…

组合数学 · 数学 2007-05-23 Vadim E. Levit , Eugen Mandrescu

For a hypergraph $\mathcal H$, we consider the edge-induced and vertex-induced subhypergraph polynomials and study their relation. We use this relation to prove that both polynomials are reconstructible, and to prove a theorem relating the…

交换代数 · 数学 2013-03-20 Yohannes Tadesse

Graph matching pairs corresponding nodes across two or more graphs. The problem is difficult as it is hard to capture the structural similarity across graphs, especially on large graphs. We propose to incorporate high-order information for…

人工智能 · 计算机科学 2020-10-12 Hui Xu , Liyao Xiang , Youmin Le , Xiaoying Gan , Yuting Jia , Luoyi Fu , Xinbing Wang

Discovering the underlying structure of a given graph is one of the fundamental goals in graph mining. Given a graph, we can often order vertices in a way that neighboring vertices have a higher probability of being connected to each other.…

数据结构与算法 · 计算机科学 2019-04-10 Nikolaj Tatti

This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse…

K理论与同调 · 数学 2014-04-28 Rufus Willett

Let $m_{12}$, $m_{13}$, ..., $m_{n-1,n}$ be the slopes of the $\binom{n}{2}$ lines connecting $n$ points in general position in the plane. The ideal $I_n$ of all algebraic relations among the $m_{ij}$ defines a configuration space called…

代数几何 · 数学 2007-05-23 Jeremy L. Martin

In hep-th/0111053, a complete simplicial fan was associated to an arbitrary finite root system. It was conjectured that this fan is the normal fan of a simple convex polytope (a generalized associahedron of the corresponding type). Here we…

组合数学 · 数学 2007-05-23 Frederic Chapoton , Sergey Fomin , Andrei Zelevinsky

The $\mathbf{g}$-vector fan of a finite-dimensional algebra is a fan whose rays are the $\mathbf{g}$-vectors of its $2$-term presilting objects. We prove that the $\mathbf{g}$-vector fan of a tame algebra is dense. We then apply this result…

表示论 · 数学 2020-07-09 Bernhard Keller , Pierre-Guy Plamondon , Toshiya Yurikusa

A multiplicative $\alpha$-spanner $H$ is a subgraph of $G=(V,E)$ with the same vertices and fewer edges that preserves distances up to the factor $\alpha$, i.e., $d_H(u,v)\leq\alpha\cdot d_G(u,v)$ for all vertices $u$, $v$. While many…

数据结构与算法 · 计算机科学 2021-07-06 Markus Chimani , Finn Stutzenstein

We study the closure of the locus of radical ideals in the multigraded Hilbert scheme associated with a standard graded polynomial ring and the Hilbert function of a homogeneous coordinate ring of points in general position in projective…

代数几何 · 数学 2021-12-01 Tomasz Mańdziuk

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

群论 · 数学 2020-02-18 Andrea Lucchini

For various Hilbert spaces of analytic functions on the unit disk, we characterize when a function $f$ has optimal polynomial approximants given by truncations of a single power series. We also introduce a generalized notion of optimal…

泛函分析 · 数学 2023-07-11 Christopher Felder

We consider a connected negative definite plumbing graph, and we assume that the associated plumbed 3-manifold is a rational homology sphere. We provide two new combinatorial formulae for the Seiberg-Witten invariant of this manifold. The…

代数几何 · 数学 2010-10-07 András Némethi

Recent studies reveal the connection between GNNs and the diffusion process, which motivates many diffusion-based GNNs to be proposed. However, since these two mechanisms are closely related, one fundamental question naturally arises: Is…

社会与信息网络 · 计算机科学 2024-04-23 Yibo Li , Xiao Wang , Hongrui Liu , Chuan Shi

We generalize the finite version of Gowers' Ramsey theorem to multiple tetris-like operations and apply it to show that a group of homeomorphisms that preserve a "typical" linear order of branches of the Lelek fan, a compact connected…

逻辑 · 数学 2017-02-15 Dana Bartošová , Aleksandra Kwiatkowska

The stability number alpha(G) of a graph G is the cardinality of a maximum stable set in G, xi(G) denotes the size of core(G), where core(G) is the intersection of all maximum stable sets of G. In this paper we prove that for a graph G…

组合数学 · 数学 2007-05-23 Vadim E. Levit , Eugen Mandrescu

The length polyhedron $Q_P$ of an interval order $P$ is the convex hull of integral vectors representing the interval lengths in interval representations of $P$. This polyhedron has been studied by various authors, including Fishburn and…

组合数学 · 数学 2024-10-30 Csaba Biró , André E. Kézdy , Jenő Lehel
‹ 上一页 1 8 9 10 下一页 ›