中文
相关论文

相关论文: The Ideal Generation Problem for Fat Points

200 篇论文

The problem of computing all maximal induced subgraphs of a graph G that have a graph property P, also called the maximal P-subgraphs problem, is considered. This problem is studied for hereditary, connected-hereditary and rooted-hereditary…

数据结构与算法 · 计算机科学 2007-05-23 Sara Cohen , Yehoshua Sagiv

We study the finite generation of the intersection algebra of two principal ideals I and J in a unique factorization domain R. We provide an algorithm that produces a list of generators of this algebra over R. In the special case that R is…

交换代数 · 数学 2013-09-23 Sara Malec

Ideals in the ring of power series in three variables can be classified based on algebra structures on their minimal free resolutions. The classification is incomplete in the sense that it remains open which algebra structures actually…

交换代数 · 数学 2024-09-26 Lars Winther Christensen , Orin Gotchey , Alexis Hardesty

A current research theme is to compare symbolic powers of an ideal $I$ with the regular powers of $I$. In this paper, we focus on the case that $I=I_X$ is an ideal defining an almost complete intersection (ACI) sets of points $X$ in…

代数几何 · 数学 2016-11-03 Giuseppe Favacchio , Elena Guardo

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

群论 · 数学 2014-07-18 William M. Kantor , Alexander Lubotzky , Aner Shalev

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

Finding frequent itemsets in a data source is a fundamental operation behind Association Rule Mining. Generally, many algorithms use either the bottom-up or top-down approaches for finding these frequent itemsets. When the length of…

数据库 · 计算机科学 2011-09-13 M. Rajalakshmi , Dr. T. Purusothaman , Dr. R. Nedunchezhian

In this paper, we study minimal generators of the (saturated) defining ideal of $\sigma_k(v_d(\mathbb{P}^n))$ in $\mathbb{P}^{N}$ with ${N=\binom{n+d}{d}-1}$, the $k$-secant variety of $d$-uple Veronese embedding of projective $n$-space, of…

代数几何 · 数学 2024-10-02 Katsuhisa Furukawa , Kangjin Han

We study ideals generated by $n+1$ powers of general linear forms in $R= k[x_1,\dots,x_n]$. By generalizing the ideas in a recent paper of Diethorn et al., we determine the Betti numbers of such ideals when at least one generator is a…

交换代数 · 数学 2026-02-24 Eric Dannetun

The minimum rank problem for a (simple) graph $G$ is to determine the smallest possible rank over all real symmetric matrices whose $ij$th entry (for $i\neq j$) is nonzero whenever $\{i,j\}$ is an edge in $G$ and is zero otherwise. This…

组合数学 · 数学 2014-10-09 Shaun Fallat , Leslie Hogben

Let $R$ be a finite commutative ring with identity, and let $P$ be a proper prime ideal of $R$. The prime ideal graph $\Gamma_P(R)$ has vertex set of $R\setminus\{0\}$, where two distinct vertices $x$ and $y$ are adjacent if and only if…

交换代数 · 数学 2026-05-14 Tabinda Rasheed , Wang Yao

Let R be a commutative ring. If P is a maximal ideal of R whose a power is finitely generated then we prove that P is finitely generated if R is either locally coherent or arithmetical or a polynomial ring over a ring of global dimension…

环与代数 · 数学 2017-04-19 Francois Couchot

Let $R$ be a polynomial ring over a field and $I \subset R$ be a Gorenstein ideal of height three that is minimally generated by homogeneous polynomials of the same degree. We compute the multiplicity of the saturated special fiber ring of…

交换代数 · 数学 2020-07-09 Yairon Cid-Ruiz , Vivek Mukundan

Statistical evaluation aims to estimate the generalization performance of a model using held-out i.i.d.\ test data sampled from the ground-truth distribution. In supervised learning settings such as classification, performance metrics such…

机器学习 · 计算机科学 2026-04-08 Shashaank Aiyer , Yishay Mansour , Shay Moran , Han Shao

The profile-based matching problem is the problem of finding a matching that optimizes profile from an instance $(G, r, \langle u_1, \dots, u_r \rangle)$, where $G$ is a bipartite graph $(A \cup B, E)$, $r$ is the number of utility…

离散数学 · 计算机科学 2025-07-02 Seongbeom Park

Given an epimorphism between topological groups $f:G\to H$, when can a generating set of $H$ be lifted to a generating set of $G$? We show that for connected Lie groups the problem is fundamentally abelian: generators can be lifted if and…

群论 · 数学 2025-10-20 Tal Cohen , Itamar Vigdorovich

Denote by $m(G)$ the largest size of a minimal generating set of a finite group $G$. We estimate $m(G)$ in terms of $\sum_{p\in \pi(G)}d_p(G),$ where we are denoting by $d_p(G)$ the minimal number of generators of a Sylow $p$-subgroup of…

群论 · 数学 2019-08-06 Andrea Lucchini , Mariapia Moscatiello , Pablo Spiga

The main goal of this paper is to prove, in positive characteristic $p$, stability behavior for the graded Betti numbers in the periodic tails of the minimal resolutions of Frobenius powers of the homogeneous maximal ideals for very general…

交换代数 · 数学 2023-03-23 Claudia Miller , Hamidreza Rahmati , Rebecca R. G

Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of…

交换代数 · 数学 2015-01-12 Jorge Neves , Maria Vaz Pinto , Rafael H. Villarreal

A homogeneous ideal $I$ of a polynomial ring $S$ is said to have the Rees property if, for any homogeneous ideal $J \subset S $ which contains $I$, the number of generators of $J$ is smaller than or equal to that of $I$. A homogeneous ideal…

交换代数 · 数学 2013-05-14 Juan Migliore , Rosa M. Miró-Roig , Satoshi Murai , Uwe Nagel , Junzo Watanabe