中文
相关论文

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

200 篇论文

Given a graded ideal $I$ in a polynomial ring over a field $K$ it is well known, that the number of distinct generic initial ideals of $I$ is finite. While it is known that for a given $d\in\N$ there is a global upper bound for the number…

交换代数 · 数学 2013-03-15 Joke Frels , Kirsten Schmitz

Let M in k[x,y] be a monomial ideal M=(m_1,m_2,...,m_r), where the m_i are a minimal generating set of M. We construct an explicit free resolution of k over S=k[x,y]/M for all monomial ideals M, and provide recursive formulas for the Betti…

交换代数 · 数学 2013-08-13 Gwyneth R. Whieldon

Given a semisimple group over a local field of residual characteristic p, its topological group of rational points admits maximal pro-p-subgroups. Quasi-split simply-connected semisimple groups can be described in the combinatorial terms of…

群论 · 数学 2017-02-21 Benoit Loisel

In this paper, we deal with the problem of uniqueness of minimal system of binomial generators of a semigroup ideal. Concretely, we give different necessary and/or sufficient conditions for uniqueness of such minimal system of generators.…

交换代数 · 数学 2010-09-02 Ignacio Ojeda , Alberto Vigneron-Tenorio

We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex. The ideal generated by the minors…

交换代数 · 数学 2015-10-09 Viviana Ene , Juergen Herzog , Takayuki Hibi , Fatemeh Mohammadi

Let $m \ge n$, $\phi_{n,m}: \mathbb P^n \to \mathbb P^m$, $\phi_{n,m}(a_1, \ldots, a_n)=(a_1, \ldots, a_n, 0, \ldots, 0)$, be the embedding, $Z=m_1P_1+\cdots+m_sP_s$ be fat points in $\mathbb P^n$ and…

代数几何 · 数学 2024-05-21 Phan Van Thien

The purpose of this note is to show a new series of examples of homogeneous ideals $I$ in ${\mathbb K}[x,y,z,w]$ for which the containment $I^{(3)}\subset I^2$ fails. These ideals are supported on certain arrangements of lines in ${\mathbb…

代数几何 · 数学 2018-03-20 Grzegorz Malara , Justyna Szpond

Real networks exhibit nontrivial topological features such as heavy-tailed degree distribution, high clustering, and small-worldness. Researchers have developed several generative models for synthesizing artificial networks that are…

社会与信息网络 · 计算机科学 2014-02-04 Sadegh Motallebi , Sadegh Aliakbary , Jafar Habibi

We prove that monomial ideals with at most five generators and their Artinian reductions have minimal generalized Barile-Macchia resolutions. As a corollary, these ideals have minimal cellular resolutions, extending a result by Faridi, D.G,…

交换代数 · 数学 2025-08-20 Trung Chau

Two minimal generating sets of the first syzygies of a monomial ideal are produced, given the minimal generating set of the ideal.

交换代数 · 数学 2007-05-23 John A. Eagon

Let $I$ be a monomial ideal in two variables generated by three monomials and let $\mathcal{R}(I)$ be its Rees ideal. We describe an algorithm to compute the minimal generating set of $\mathcal{R}(I)$. Based on the data obtained by this…

Deriving optimal designs for nonlinear models is in general challenging. One crucial step is to determine the number of support points needed. Current tools handle this on a case-by-case basis. Each combination of model, optimality…

统计方法学 · 统计学 2009-12-22 Min Yang

Let R be a local ring with maximal ideal m admitting a non-zero element a\in\fm for which the ideal (0:a) is isomorphic to R/aR. We study minimal free resolutions of finitely generated R-modules M, with particular attention to the case when…

交换代数 · 数学 2014-02-26 Inês B. Henriques , Liana M. Şega

The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform…

组合数学 · 数学 2025-10-23 Jie Han , Jingwen Zhao

$ $Abert, Gelander and Nikolov [AGN17] conjectured that the number of generators $d(\Gamma)$ of a lattice $\Gamma$ in a high rank simple Lie group $H$ grows sub-linearly with $v = \mu(H / \Gamma)$, the co-volume of $\Gamma$ in $H$. We prove…

群论 · 数学 2021-01-19 Alexander Lubotzky , Raz Slutsky

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…

离散数学 · 计算机科学 2008-09-18 Bidu Prakash Das , Soubhik Chakraborty

This paper is concerned with finding bounds on betti numbers and describing combinatorially and topologically (minimal) free resolutions of powers of ideals generated by a fixed number $q$ of square-free monomials. Among such ideals, we…

交换代数 · 数学 2023-09-07 Sabine El Khoury , Sara Faridi , Liana Sega , Sandra Spiroff

This paper investigates the maximal subgroups of a free projection-generated regular $*$-semigroup $PG(P)$ over a projection algebra $P$, and their relationship to the maximal subgroups of the free idempotent-generated semigroup $IG(E)$…

群论 · 数学 2025-07-10 James East , Robert D. Gray , P. A. Azeef Muhammed , Nik Ruskuc

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

逻辑 · 数学 2023-07-25 Annalisa Conversano

This paper is concerned with the sample efficiency of reinforcement learning, assuming access to a generative model (or simulator). We first consider $\gamma$-discounted infinite-horizon Markov decision processes (MDPs) with state space…

机器学习 · 计算机科学 2025-03-18 Gen Li , Yuting Wei , Yuejie Chi , Yuxin Chen
‹ 上一页 1 8 9 10 下一页 ›