English
Related papers

Related papers: On the Convexity of log det (I + K X^{-1})

200 papers

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…

Number Theory · Mathematics 2020-08-28 Andreas Decker , Pieter Moree

Proving that a finitely generated convex cone is closed is often considered the most difficult part of geometric proofs of Farkas' lemma. We provide a short simple proof of this fact and (for completeness) derive Farkas' lemma from it using…

Optimization and Control · Mathematics 2023-12-25 Wouter Kager

Let $(X,\Delta)$ be a smooth complex projective simple normal crossing pair of dimension $n\geq 3$ endowed with an everywhere nondegenerate logarithmic conformal tensor. If $K_X+\Delta$ is not nef, then precisely one of the following…

Algebraic Geometry · Mathematics 2026-04-20 Maurício Corrêa , Alex Massarenti

This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…

Optimization and Control · Mathematics 2025-04-28 Kazuo Murota , Akihisa Tamura

Consider the closed convex hull $K$ of a monomial curve given parametrically as $(t^{m_1},\ldots,t^{m_n})$, with the parameter $t$ varying in an interval $I$. We show, using constructive arguments, that $K$ admits a lifted semidefinite…

Optimization and Control · Mathematics 2023-03-08 Gennadiy Averkov , Claus Scheiderer

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

Functional Analysis · Mathematics 2007-05-23 Ravi Montenegro

In this article, we prove that convex functions and log-convex functions obey certain general refinements that lead to several refinements and reverses of well known inequalities for matrices, including Young's inequality, Heinz inequality,…

Functional Analysis · Mathematics 2016-06-28 Mohammad Sababheh

We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…

Operator Algebras · Mathematics 2022-11-17 Mark Girard , Seung-Hyeok Kye , Erling Størmer

The positive semidefinite rank of a convex body $C$ is the size of its smallest positive semidefinite formulation. We show that the positive semidefinite rank of any convex body $C$ is at least $\sqrt{\log d}$ where $d$ is the smallest…

Optimization and Control · Mathematics 2017-12-06 Hamza Fawzi , Mohab Safey El Din

In the paper, we investigate the following fundamental question. For a set $\mathcal{K}$ in $\mathbb{L}^0(\mathbb{P})$, when does there exist an equivalent probability measure $\mathbb{Q}$ such that $\mathcal{K}$ is uniformly integrable in…

Probability · Mathematics 2019-08-20 Niushan Gao , Denny H. Leung , Foivos Xanthos

In this paper, we study power series with coefficients equal to a product of a generic sequence and an explicitly given function of a positive parameter expressible in terms of the Pochhammer symbols. Four types of such series are treated.…

Classical Analysis and ODEs · Mathematics 2023-12-12 Dmitrii Karp , Yi Zhang

Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and…

Combinatorics · Mathematics 2007-05-23 Tomislav Došlić , Darko Veljan

In this paper, we prove the converse of the dynamical Mordell--Lang conjecture in positive characteristic: For every subset $S \subseteq \mathbb{N}_0$ which is a union of finitely many arithmetic progressions along with finitely many…

Number Theory · Mathematics 2025-01-15 Jungin Lee , Gyeonghyeon Nam

We remark that an easy combination of two known results yields a positive answer, up to log(n) terms, to a duality conjecture that goes back to Pietsch. In particular, we show that for any two symmetric convex bodies K,T in R^n, denoting by…

Functional Analysis · Mathematics 2007-05-23 Emanuel Milman

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

Complex Variables · Mathematics 2019-09-11 Sushil Gorai

We expose here a short proof of Cramer's theorem in R based on convex duality.

Probability · Mathematics 2013-11-18 Raphael Cerf , Pierre Petit

We present a short proof of Klartag's central limit theorem for convex bodies, using only the most classical facts about log-concave functions. An appendix is included where we give the proof that thin shell implies CLT. The paper is…

Probability · Mathematics 2019-07-22 Daniel J. Fresen

In this paper, we obtain the best possible value of the absolute constant $C$ such that for every isotropic convex body $K \subseteq \mathbb{R}^n$ the following inequality (which was proved by Klartag and reduces the hyperplane conjecture…

Metric Geometry · Mathematics 2022-10-18 Javier Martín-Goñi

We present a much simplified proof of Dehn's theorem on the infinitesimal rigidity of convex polytopes. Our approach is based on the ideas of Trushkina and Schramm.

Metric Geometry · Mathematics 2007-05-23 Igor Pak

In this paper we describe the dynamics of certain rational maps of the form $k \cdot (x+x^{-1})$ over finite fields of odd characteristic.

Dynamical Systems · Mathematics 2014-05-30 Simone Ugolini
‹ Prev 1 3 4 5 6 7 10 Next ›