English
Related papers

Related papers: On Poincar\'{e} cone property

200 papers

The Diederich--Forn\ae ss index has been introduced since 1977 to classify bounded pseudoconvex domains. In this article, we derive several intrinsic, geometric conditions on boundary of domains for arbitrary indexes. Many results, in the…

Complex Variables · Mathematics 2017-01-03 Bingyuan Liu

We introduce the notion of domain of finite type $\mathscr{D}\subset\mathbb{R}^n$ generalizing an earlier work of Bodin, Popescu-Pampu and Sorea. Then, we prove that every finite graph admitting a good orientation whose vertices have degree…

Algebraic Geometry · Mathematics 2026-02-24 Enrico Savi

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

Optimization and Control · Mathematics 2024-06-17 Martin Plávala , Laurens T. Ligthart , David Gross

The goal of this paper is to push forward the study of those properties of log-concave measures that help to estimate their Poincar{\'e} constant. First we revisit E. Milman's result [40] on the link between weak (Poincar{\'e} or…

Probability · Mathematics 2018-10-22 Patrick Cattiaux , Arnaud Guillin

In this paper we study a general class of nonlinear elliptic problems in divergence form. First, we prove that the solutions to these problems satisfy a convexity property when the given domain is strictly convex. Then, making use of this…

Analysis of PDEs · Mathematics 2026-03-16 Cristian Enache , Rafael Lopez

A set $S\subseteq \re^n$ is called to be {\it Semidefinite (SDP)} representable if $S$ equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). The contributions of this paper…

Optimization and Control · Mathematics 2008-12-08 J. William Helton , Jiawang Nie

Given a set $P$ of $n$ points in the plane, we study the computation of the probability distribution function of both the area and perimeter of the convex hull of a random subset $S$ of $P$. The random subset $S$ is formed by drawing each…

Computational Geometry · Computer Science 2015-09-10 Pablo Pérez-Lantero

Let ${\mathbf P}^2$ denote the projective plane over a finite field ${\mathbb F}_q$. A pair of nonsingular conics $({\mathcal A}, {\mathcal B})$ in the plane is said to satisfy the Poncelet triangle condition if, considered as conics in…

Algebraic Geometry · Mathematics 2016-04-05 Jaydeep Chipalkatti

We investigate new properties of the fractional Dirichlet Laplacian on smooth bounded domains and establish fractional product estimates and nonlinear Poincar\'e inequalities. We also use these tools to study the long-time dynamics of the…

Analysis of PDEs · Mathematics 2024-09-10 Elie Abdo , Quyuan Lin

We present an algorithm which takes as input a closed semi-algebraic set, $S \subset \R^k$, defined by \[ P_1 \leq 0, ..., P_\ell \leq 0, P_i \in \R[X_1,...,X_k], \deg(P_i) \leq 2, \] and computes the Euler-Poincar\'e characteristic of $S$.…

Symbolic Computation · Computer Science 2007-05-23 Saugata Basu

The variance conjecture in Asymptotic Convex Geometry stipulates that the Euclidean norm of a random vector uniformly distributed in a (properly normalised) high-dimensional convex body $K\subset {\mathbb R}^n$ satisfies a Poincar\'e-type…

Functional Analysis · Mathematics 2018-05-09 Beatrice-Helen Vritsiou

The Dirichlet forms methods, in order to represent errors and their propagation, are particularly powerful in infinite dimensional problems such as models involving stochastic analysis encountered in finance or physics, cf. [5]. Now, coming…

Probability · Mathematics 2016-11-04 Nicolas Bouleau

With direct and simple proofs, we establish Poincar\'{e} type inequalities (including Poincar\'{e} inequalities, weak Poincar\'{e} inequalities and super Poincar\'{e} inequalities), entropy inequalities and Beckner-type inequalities for…

Probability · Mathematics 2013-07-10 Jian Wang

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

Algebraic Geometry · Mathematics 2017-09-19 Claus Scheiderer

We prove a fractional version of Poincar\'e inequalities in the context of $\R^n$ endowed with a fairly general measure. Namely we prove a control of an $L^2$ norm by a non local quantity, which plays the role of the gradient in the…

Analysis of PDEs · Mathematics 2010-06-30 Clément Mouhot , Emmanuel Russ , Yannick Sire

This paper is a continuation of the paper F. A. Arias and M. Malakhaltsev "A generalization of the Gauss-Bonnet and Hopf-Poincar\'e theorems", ArXiv:1510.01395 [MathDG] 5 Oct 2015. Let $\pi : E \to M$ be a locally trivial fiber bundle over…

Differential Geometry · Mathematics 2016-10-11 F. A. Arias , M. Malakhaltsev

This paper presents a simple, self-contained account of Garding's theory of hyperbolic polynomials, including a recent convexity result of Bauschke-Guler-Lewis-Sendov and an inequality of Gurvits. This account also contains new results,…

Analysis of PDEs · Mathematics 2010-03-22 F. Reese Harvey , H. Blaine Lawson

We give an affirmative answer to the resistance conjecture on characterization of parabolic Harnack inequalities in terms of volume doubling, upper capacity bounds and a Poincar\'e inequalities. The key step is to show that these three…

Probability · Mathematics 2026-04-01 Sylvester Eriksson-Bique

In this paper we give a geometric condition which ensures that $(q,p)$-Poincar\'e-Sobolev inequalities are implied from generalized $(1,1)$-Poincar\'e inequalities related to $L^1$ norms in the context of product spaces. The concept of…

Classical Analysis and ODEs · Mathematics 2022-05-11 Maria Eugenia Cejas , Carolina Mosquera , Carlos Pérez , Ezequiel Rela

We present a simple sublinear time algorithm for testing the following geometric property. Let $P_1, ..., P_n$ be $n$ convex sets in $\mathbb{R}^d$ ($n \gg d$), such as polytopes, balls, etc. We assume that the complexity of each set…

Data Structures and Algorithms · Computer Science 2016-12-13 Israela Solomon