Related papers: Upper bounds for Betti numbers from constraints on…
This note further addresses the global optimization problem for max-plus linear systems considered in [Automatica 119 (2020) 109104]. Firstly, the operations between infinity elemens and real numbers involved in the formulas of solving…
We extend a result of Caviglia and Sbarra to a polynomial ring with base field of any characteristic. Given a homogeneous ideal containing both a piecewise lex ideal and an ideal generated by powers of the variables, we find a lex ideal…
In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…
We compute the Betti numbers of the resolution of a special class of square-free monomial ideals, the ideals of mixed products. Moreover when these ideals are Cohen-Macaulay we calculate their type.
We develop a formalism for constructing stochastic upper bounds on the expected full sample risk for supervised classification tasks via the Hilbert coresets approach within a transductive framework. We explicitly compute tight and…
Practical model building processes are often time-consuming because many different models must be trained and validated. In this paper, we introduce a novel algorithm that can be used for computing the lower and the upper bounds of model…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…
We show that if a group G is finitely presented and nilpotent-by-abelian-by-finite, then there is an upper bound on the first betti number of M as M runs through all subgroups of finite index in G.
Bounds for the Castelnuovo-Mumford regularity and Hilbert coefficients are given in terms of the arithmetic degree (if the ring is reduced) or in terms of the defining degrees. From this it follows that there exists only a finite number of…
We show upper bounds on the maximal dimension $d$ of Hilbert cubes $H=a_0+\{0,a_1\}+\cdots + \{0, a_d\}\subset S \cap [1, N]$ in several sets $S$ of arithmetic interest such as the squares, powerful numbers and pure powers.
We asymptotically estimate from above the expected Betti numbers of random real hypersurfaces in smooth real projective manifolds. Our upper bounds grow as the square root of the degree of the hypersurfaces as the latter grows to infinity,…
The problem of computing the optimum of a function on a finite set is an important problem in mathematics and computer science. Many combinatorial problems such as MAX-SAT and MAXCUT can be recognized as optimization problems on the…
We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by…
The MultiplicitySequence package for Macaulay2 computes the multiplicity sequence of a graded ideal in a standard graded ring over a field, as well as several invariants of monomial ideals related to integral dependence. We discuss two…
Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…
We present a new algorithm for computing upper bounds on the number of executions of each program instruction during any single program run. The upper bounds are expressed as functions of program input values. The algorithm is primarily…
In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…
We prove that the height of any algebraic computation tree for deciding membership in a semialgebraic set is bounded from below (up to a multiplicative constant) by the logarithm of m-th Betti number (with respect to singular homology) of…
We compute one of the distinguished extremal Betti number of the binomial edge ideal of a block graph, and classify all block graphs admitting precisely one extremal Betti number.