English
Related papers

Related papers: On polynomial solutions to the minimal surface equ…

200 papers

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

Number Theory · Mathematics 2018-01-04 Anish Ghosh , Alexander Gorodnik , Amos Nevo

Given a convex $n$-gon $P$ and a positive integer $m$ such that $3\le m\le n-1$, let $Q$ denote the largest area convex $m$-gon contained in $P$. We are interested in the minimum value of $\Delta(Q)/\Delta(P)$, the ratio of the areas of…

Combinatorics · Mathematics 2021-04-27 Dan Ismailescu , Min Jung Kim , Eric Wang

In this paper, we study the transcendental meromorphic solutions for the nonlinear differential equations: $f^{n}+P(f)=R(z)e^{\alpha(z)}$ and $f^{n}+P_{*}(f)=p_{1}(z)e^{\alpha_{1}(z)}+p_{2}(z)e^{\alpha_{2}(z)}$ in the complex plane, where…

Complex Variables · Mathematics 2020-02-04 Nan Li , Lianzhong Yang

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Combinatorics · Mathematics 2021-04-22 Eugene Kogan

Let $n=2,3,4,5$ and let $X$ be a smooth complex projective hypersurface of $\mathbb P^{n+1}$. In this paper we find an effective lower bound for the degree of $X$, such that every holomorphic entire curve in $X$ must satisfy an algebraic…

Algebraic Geometry · Mathematics 2017-04-04 Simone Diverio

We address the following generalization $P$ of the Lowner-John ellipsoid problem. Given a (non necessarily convex) compact set $K\subset R^n$ and an even integer $d$, find an homogeneous polynomial $g$ of degree $d$ such that $K\subset…

Optimization and Control · Mathematics 2014-12-24 Jean-Bernard Lasserre

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…

We show that any differential operator of the form $L(y)=\sum_{k=0}^{k=N} a_{k}(x) y^{(k)}$, where $a_k$ is a real polynomial of degree $\leq k$, has all real eigenvalues in the space of polynomials of degree at most n, for all n. The…

Classical Analysis and ODEs · Mathematics 2010-02-28 H. Azad , M. T. Mustafa

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

Combinatorics · Mathematics 2024-01-30 Joshua Hinman

We consider positive solutions to parametrized systems of generalized polynomial equations (with real exponents and positive parameters). By a fundamental result obtained in parallel work, polynomial systems are determined by geometric…

Algebraic Geometry · Mathematics 2024-10-07 Stefan Müller , Georg Regensburger

In this paper, we investigate an upper bound of the polar derivative of a polynomial of degree $n$ $$p(z)=(z-z_m)^{t_m} (z-z_{m-1})^{t_{m-1}}\cdots (z-z_0)^{t_0}(a_0+\sum\limits_{\nu=\mu} ^{n-(t_m+\cdots+t_0)} a_{\nu}z^\nu)$$ where zeros…

Complex Variables · Mathematics 2018-04-30 Nuttapong Arunrat , Keaitsuda Maneeruk Nakprasit

In this work, we analyze the finite element method with arbitrary but fixed polynomial degree for the nonlinear Helmholtz equation with impedance boundary conditions. We show well-posedness and error estimates of the finite element solution…

Numerical Analysis · Mathematics 2023-02-07 Barbara Verfürth

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the…

Computational Complexity · Computer Science 2014-11-25 James R. Lee , Prasad Raghavendra , David Steurer

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…

Metric Geometry · Mathematics 2007-05-23 Hartwig Bosse , Martin Groetschel , Martin Henk

We consider algebraic ordinary differential equations (AODEs) and study their polynomial and rational solutions. A sufficient condition for an AODE to have a degree bound for its polynomial solutions is presented. An AODE satisfying this…

Symbolic Computation · Computer Science 2018-04-24 Thieu N. Vo , Yi Zhang

This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called…

Number Theory · Mathematics 2008-02-01 Iskander Aliev , Chris Smyth

We analyze the polynomial solutions of the linear differential equation $p_2(x)y''+p_1(x)y'+p_0(x)y=0$ where $p_j(x)$ is a $j^{\rm th}$-degree polynomial. We discuss all the possible polynomial solutions and their dependence on the…

Mathematical Physics · Physics 2013-11-04 Nasser Saad , Richard L. Hall , Victoria A. Trenton

In this paper, we prove super-polynomial lower bounds for the model of \emph{sum of ordered set-multilinear algebraic branching programs}, each with a possibly different ordering ($\sum \mathsf{smABP}$). Specifically, we give an explicit…

Computational Complexity · Computer Science 2024-02-20 Prerona Chatterjee , Deepanshu Kush , Shubhangi Saraf , Amir Shpilka

Given a squarefree monomial ideal $I$ of a polynomial ring $Q$, we show that if the minimal free resolution $\mathbb{F}$ of $Q/I$ admits the structure of a differential graded (dg) algebra, then so does any ``pruning" of $\mathbb{F}$. In…

Commutative Algebra · Mathematics 2026-05-07 Hugh Geller , Desiree Martin , Henry Potts-Rubin
‹ Prev 1 3 4 5 6 7 10 Next ›