English
Related papers

Related papers: New Subexponential Fewnomial Hypersurface Bounds

200 papers

Let $A_1,\ldots,A_n$ be finite subsets of an additive abelian group $G$ with $|A_1|=\cdots=|A_n|\ge2$. Concerning the two new kinds of restricted sumsets $$L(A_1,\ldots,A_n)=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n,\ \text{and}\…

Number Theory · Mathematics 2022-10-24 Han Wang , Zhi-Wei Sun

We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…

Algebraic Geometry · Mathematics 2007-05-23 J. Maurice Rojas

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…

Combinatorics · Mathematics 2026-03-31 Tim Alderson , Simeon Ball

We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…

Commutative Algebra · Mathematics 2010-03-30 Apoloniusz Tyszka

We consider the following supercritical problem for the Lane-Emden system: \begin{equation}\label{eq00} \begin{cases} -\Delta u_1=|u_2|^{p-1}u_2\ &in\ D,\\ -\Delta u_2=|u_1|^{q-1}u_1 \ &in\ D,\\ u_1=u_2=0\ &on\ \partial D, \end{cases}…

Analysis of PDEs · Mathematics 2023-06-14 Qing Guo , Junyuan Liu , Shuangjie Peng

Given a finite point set $P \subset \mathbb{R}^d$, a $k$-ary semi-algebraic relation $E$ on $P$ is the set of $k$-tuples of points in $P$, which is determined by a finite number of polynomial equations and inequalities in $kd$ real…

Combinatorics · Mathematics 2015-10-20 Andrew Suk

Let $S$ be a connected surface possibly with boundary, $\mu$ a finite Borel measure which is positive on open sets and $f:S\to S$ a homeomorphism preserving $\mu$. We prove that if $K$ is a compact connected subset of $S$ and $L$ is a…

Dynamical Systems · Mathematics 2024-04-08 Fernando Oliveira , Gonzalo Contreras

In this paper we study the affine geometric structure of the graph of a polynomial $f \in \mathbb{R} [x,y]$. We provide certain criteria to determine when the parabolic curve is compact and when the unbounded component of its complement is…

Differential Geometry · Mathematics 2017-05-02 Miguel Angel Guadarrama-García , Adriana Ortiz-Rodríguez

Let $\mathrm{R}$ be a real closed field and $Q_1, \ldots, Q_{\ell} \in \mathrm{R}[X_1, \ldots,X_k]$ such that for each $i, 1 \leq i \leq \ell$, $\mathrm{deg} (Q_i) \leq d_i$. For $1 \leq i \leq \ell$, denote by $\mathcal{Q}_i = \{Q_1,…

Algebraic Geometry · Mathematics 2015-09-24 Sal Barone , Saugata Basu

Given $k, \ell \in {\bf N}^+$, let $x_{i,j}$ be, for $1 \le i \le k$ and $0 \le j \le \ell$, some fixed integers, and define, for every $n \in {\bf N}^+$, $s_n := \sum_{i=1}^k \prod_{j=0}^\ell x_{i,j}^{n^j}$. We prove that the following are…

Number Theory · Mathematics 2018-05-15 Paolo Leonetti , Salvatore Tringali

For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…

Combinatorics · Mathematics 2022-10-21 Peter Frankl , Jian Wang

Let f : X -> Y be a dominant polynomial mapping of affine varieties. For generic y in Y we have Sing(f^{-1}(y)) = f^{-1}(y) \cap Sing(X): As an application we show that symmetry defect hypersurfaces for two generic members of the…

Algebraic Geometry · Mathematics 2014-03-25 S. Janeczko , Z. Jelonek , M. A. S. Ruas

We give partial generalizations of the classical Descartes' rule of signs to multivariate polynomials (with real exponents), in the sense that we provide upper bounds on the number of connected components of the complement of a hypersurface…

Algebraic Geometry · Mathematics 2022-07-07 Elisenda Feliu , Máté L. Telek

Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d…

Combinatorics · Mathematics 2012-03-22 Daniel Kral , Lukas Mach , Jean-Sebastien Sereni

Motivated by the growing attention devoted to the Quantum Chromodynamics sector of the Standard Model, and the recent observations of non-standard hadronic states, a possible substructure of quarks $q_{f}\equiv C_{ij}|k_{i}k_{j}\rangle $ in…

High Energy Physics - Phenomenology · Physics 2025-02-10 Adil Belhaj , Salah Eddine Ennadifi

We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…

Combinatorics · Mathematics 2015-01-06 I. Shnurnikov

Let $F(x_1,...,x_n)$ be a form of degree $d\geq 2$, which produces a geometrically irreducible hypersurface in $\mathbb{P}^{n-1}$. This paper is concerned with the number of rational points on F=0 which have height at most $B$. Whenever…

Number Theory · Mathematics 2007-05-23 T. D. Browning , D. R. Heath-Brown

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Metric Geometry · Mathematics 2022-07-12 Han Huang , Boaz A. Slomka , Tomasz Tkocz , Beatrice-Helen Vritsiou

Let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-set $[n]=\{1,2,\ldots,n\}$. Let $n>2k$ and let $\mathcal{F}\subset \binom{[n]}{k}$ be an {\it intersecting} $k$-graph, i.e., $F\cap F'\neq \emptyset$ for all…

Combinatorics · Mathematics 2025-11-20 Peter Frankl , Jian Wang

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Computational Geometry · Computer Science 2020-03-17 M. Sharir , C. Ziv