English
Related papers

Related papers: Betti Bounds of Polynomials

200 papers

Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m,$ and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…

Algebraic Geometry · Mathematics 2010-10-21 Saugata Basu , Dmitrii V. Pasechnik , Marie-Francoise Roy

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

Dynamical Systems · Mathematics 2025-10-20 Myong-Hi Kim , Scott Sutherland

We prove upper bounds for the graded Betti numbers of Stanley-Reisner rings of balanced simplicial complexes. Along the way we show bounds for Cohen-Macaulay graded rings $S/I$, where $S$ is a polynomial ring and $I\subseteq S$ is an…

Combinatorics · Mathematics 2018-11-12 Martina Juhnke-Kubitzke , Lorenzo Venturello

A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are…

Representation Theory · Mathematics 2007-05-23 Dean Alvis

We consider fiber products of complete, local, noetherian algebras over a fixed residue field. Some of these rings cannot be minimally resolved with a free resolution using the recent work of the second author. We develop techniques to…

Commutative Algebra · Mathematics 2023-07-13 Ela Celikbas , Hugh Geller , Tony Se

There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…

Geometric Topology · Mathematics 2021-04-16 Michael Dougherty , Jon McCammond

We construct examples of fibered three-manifolds with first Betti number at least 2 and with fibered faces all of whose monodromies extend to a handlebody.

Geometric Topology · Mathematics 2022-01-05 Sebastian Hensel , Dawid Kielak

We study face numbers of simplicial complexes that triangulate manifolds (or even normal pseudomanifolds) with boundary. Specifically, we establish a sharp lower bound on the number of interior edges of a simplicial normal pseudomanifold…

Combinatorics · Mathematics 2016-04-18 Satoshi Murai , Isabella Novik

We describe how to compute topological objects associated to a polynomial map of several complex variables with isolated singularities. These objects are: the affine critical values, the affine Milnor numbers for all irregular fibers, the…

Algebraic Geometry · Mathematics 2007-05-23 Arnaud Bodin

In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…

Classical Analysis and ODEs · Mathematics 2023-09-29 Jinzhi Lei , Lijun Yang

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

For a homogeneous polynomial of $n$ variables, we present a new method to compute the roots of Bernstein-Sato polynomial supported at the origin, assuming that general hyperplane sections of the associated projective hypersurface have at…

Algebraic Geometry · Mathematics 2019-07-16 Morihiko Saito

In this paper, we obtain a combinatorial formula for computing the Betti numbers in the linear strand of edge ideals of bipartite Kneser graphs. We deduce lower and upper bounds for regularity of powers of edge ideals of these graphs in…

Commutative Algebra · Mathematics 2021-05-14 Ajay Kumar , Pavinder Singh , Rohit Verma

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

Complex Variables · Mathematics 2025-02-11 Pratap Basak , Sanjay Mallick

We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…

Algebraic Geometry · Mathematics 2023-06-22 Gal Binyamini

We establish expansion properties for suitably generic polynomials of degree $d$ in $d+1$ variables over finite fields. In particular, we show that if $P\in\mathbb{F}_q[x_1,\ldots,x_{d+1}]$ is a polynomial of degree $d$ coming from an…

Combinatorics · Mathematics 2024-03-07 Nuno Arala , Sam Chow

Explicit formulas determining the dimension and the degree of the singular subscheme of hypersurfaces in ${\mathbb P}^n$ are given in terms of the graded Betti numbers of the minimal free resolution of the corresponding Jacobian algebra.…

Algebraic Geometry · Mathematics 2026-05-05 Alexandru Dimca , Gabriel Sticlaru

We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…

Probability · Mathematics 2024-12-12 Madhur Tulsiani , June Wu

Consider a polynomial $F$ in $m$ variables and a finite point ensemble $S=S_1 \times ... \times S_m$. When given the leading monomial of $F$ with respect to a lexicographic ordering we derive improved information on the possible number of…

Information Theory · Computer Science 2011-01-27 Olav Geil , Casper Thomsen