Related papers: The Ideal Generation Problem for Fat Points
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…
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…
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…
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.…
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…
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…
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…
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…
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,…
Two minimal generating sets of the first syzygies of a monomial ideal are produced, given the minimal generating set of the ideal.
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…
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…
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…
$ $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…
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…
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…
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)$…
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…
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…