English
Related papers

Related papers: On topological lower bounds for algebraic computat…

200 papers

If $M$ is the complement of a hyperplane arrangement, and $A=H^*(M,\k)$ is the cohomology ring of $M$ over a field of characteristic 0, then the ranks, $\phi_k$, of the lower central series quotients of $\pi_1(M)$ can be computed from the…

Algebraic Geometry · Mathematics 2010-10-26 Henry K. Schenck , Alexander I. Suciu

We use stratified Morse theory for a manifold with corners to give a new bound for the sum of the Betti numbers of a hypersurface in R^n_> defined by a polynomial with n+l+1 terms.

Algebraic Geometry · Mathematics 2009-02-03 Frederic Bihan , Frank Sottile

Let $T$ be a perfect binary tree and $I$ be its edge ideal in the polynomial ring $S$. We determine the vertex cover number, independent number, and establish the recursive formula to compute the number of minimal vertex covers. As a…

Commutative Algebra · Mathematics 2025-09-25 Nguyen Thu Hang , Tran Duc Dung , Do Van Kien

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…

Optimization and Control · Mathematics 2008-09-09 Jiawang Nie , Kristian Ranestad , Bernd Sturmfels

Here we prove some special cases of the following conjecture: that the sum of the Betti numbers of a 1-connected elliptic space is greater than the total rank of its homotopy groups. Our main tool is Sullivan's minimal model.

Algebraic Topology · Mathematics 2008-03-28 Mohamed Rachid Hilali , My Ismail Mamouni

A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…

Symbolic Computation · Computer Science 2026-02-11 Jean-Guillaume Dumas , Stefano Lia , John Sheekey

The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-04-01 Fabian Kuhn , Thomas Moscibroda , Roger Wattenhofer

The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemer{\'e}di regularity lemma in graph theory. It shows that for any abelian group $G$ and any bounded function $f:G \to [0,1]$, there exists a subgroup…

Combinatorics · Mathematics 2016-08-03 Kaave Hosseini , Shachar Lovett , Guy Moshkovitz , Asaf Shapira

For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…

Number Theory · Mathematics 2008-10-17 Iwan M. Duursma , Seungkook Park

In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Euler-Poincar\'e characteristic, were…

Algebraic Geometry · Mathematics 2007-05-23 Saugata Basu , Richard Pollack , Marie-Francoise Roy

In this paper we prove parts of a conjecture of Herzog giving lower bounds on the rank of the free modules appearing in the linear strand of a graded $k$-th syzygy module over the polynomial ring. If in addition the module is…

Commutative Algebra · Mathematics 2021-05-18 Tim Roemer

Topological data analysis has emerged as a powerful tool for analyzing large-scale data. An abstract simplicial complex, in principle, can be built from data points, and by using tools from homology, topological features could be…

Quantum Physics · Physics 2025-12-24 Nhat A. Nghiem , Xianfeng David Gu , Tzu-Chieh Wei

The border rank of the matrix multiplication operator for n by n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n^2-n. Our bounds…

Computational Complexity · Computer Science 2013-06-04 J. M. Landsberg , Giorgio Ottaviani

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Number Theory · Mathematics 2022-10-11 Jean Kieffer

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…

Combinatorics · Mathematics 2014-12-24 Moritz Christmann , Timo de Wolff

We study two long-standing conjectures concerning lower bounds for the Betti numbers of a graded module over a polynomial ring. We prove new cases of these conjectures in codimensions five and six by reframing the conjectures as arithmetic…

Commutative Algebra · Mathematics 2026-01-01 Adam Boocher , Noah Huang , Harrison Wolf

We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of closed semialgebraic sets given by Boolean formulas without negations over lax polynomial inequalities. The algorithm works in weak…

Computational Geometry · Computer Science 2020-12-22 Peter Bürgisser , Felipe Cucker , Josué Tonelli-Cueto

We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…

Algebraic Geometry · Mathematics 2014-11-04 Rainer Sinn

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…

Algebraic Geometry · Mathematics 2020-06-09 Alain Couvreur , Philippe Lebacque , Marc Perret

We compute an explicit closed formula for the Hilbert polynomial of the Jacobian algebra $M(f)$ of a reduced surface $X:f=0$ in $\mathbb P^3$ in terms of the graded Betti numbers of the algebra $M(f)$. When $X$ has only isolated…

Algebraic Geometry · Mathematics 2026-04-28 Alexandru Dimca , Gabriel Sticlaru