Related papers: Bounds for the degree and Betti sequences along a …
Based on Bergman's Lemma on centralizers, we obtain a sharp lower degree bound for nonconstant elements in a subalgebra generated by two elements of a free associative algebra over an arbitrary field.
We consider a variant of the clustering problem for a complete weighted graph. The aim is to partition the nodes into clusters maximizing the sum of the edge weights within the clusters. This problem is known as the clique partitioning…
We prove a tight lower bound on the Betti numbers of tree and forest ideals and a tight upper bound on certain graded Betti numbers of squarefree monomial ideals.
Sharply o-minimal structures (denoted \so-minimal) are a strict subclass of the o-minimal structures, aimed at capturing some finer features of structures arising from algebraic geometry and Hodge theory. Sharp o-minimality associates to…
We use Boij-S\"oderberg theory to provide some order of magnitude bounds on algebraic Betti numbers.
We give a bound for the Betti numbers of the Stanley-Reisner ring of a stellar subdivision of a Gorenstein* simplicial complex by applying unprojection theory. From this we derive a bound for the Betti numbers of iterated stellar…
We establish doubly-exponential degree bounds for Gr\"obner bases in certain algebras of solvable type over a field (as introduced by Kandri-Rody and Weispfenning). The class of algebras considered here includes commutative polynomial…
We define the reduced horseshoe resolution and the notion of conjoined pairs of ideals in order to study the minimal graded free resolution of a class of p-Borel ideals and recover Pardue's regularity formula for them. It will follow from…
This PhD thesis is concerned with SDP bounds for codes: upper bounds for (non)-binary error correcting codes and lower bounds for (non)-binary covering codes. The methods are based on the method of Schrijver that uses triple distances in…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We produce a criterion for open sets in projective $n$-space over a separably closed field to have \'etale cohomological dimension bounded by $2n-3$. We use the criterion to exhibit a scheme for which \'etale cohomological dimension is…
We study the convergence behavior of Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) methods for solving large-scale algebraic systems arising from multi-patch Isogeometric Analysis. We focus on the Poisson problem on two…
This paper develops new semidefinite programming (SDP) relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs (MBQCQP) and analyzes their approximation performance. The first class of problem…
We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…
We provide lower error bounds for randomized algorithms that approximate integrals of functions depending on an unrestricted or even infinite number of variables. More precisely, we consider the infinite-dimensional integration problem on…
The graded Betti numbers of the minimal free resolution (and also therefore the Hilbert function) of the ideal of a fat point subscheme Z of P^2 are determined whenever Z is supported at any 6 or fewer distinct points. All results hold over…
We apply the theory of Groebner bases to the computation of free resolutions over a polynomial ring, the defining equations of a canonically embedded curve, and the unirationality of the moduli space of curves of a fixed genus.
The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
We study the problem of maximizing Betti numbers of simplicial complexes. We prove an upper bound of 1.32^n for the sum of Betti numbers of any n-vertex flag complex and 1.25^n for the independence complex of a triangle-free graph. These…