English
Related papers

Related papers: On Pairs of $f$-divergences and their Joint Range

200 papers

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

Optimization and Control · Mathematics 2008-12-10 Didier Henrion

We use the theory of motivic integration for singular spaces to give a characterization of minimal log discrepencies in terms of the codimension of certain subsets of spaces of arcs. This is done for arbitrary pairs $(X,Y)$, with $X$ normal…

Algebraic Geometry · Mathematics 2009-11-07 Lawrence Ein , Mircea Mustata , Takehiko Yasuda

In this paper we study the geometric discrepancy of explicit constructions of uniformly distributed points on the two-dimensional unit sphere. We show that the spherical cap discrepancy of random point sets, of spherical digital nets and of…

Numerical Analysis · Mathematics 2014-02-17 Christoph Aistleitner , Johann Brauchart , Josef Dick

We define a class of divergences to measure differences between probability density functions in one-dimensional sample space. The construction is based on the convex function with the Jacobi operator of mapping function that pushforwards…

Statistics Theory · Mathematics 2025-04-24 Wuchen Li

We consider the scattering of linear waves in two dimensions by a rectangular region at the junction of four waveguides. A solution to the frequency domain problem is obtained by exploiting reflective symmetry to reduce the full problem to…

Mathematical Physics · Physics 2024-11-28 Afnan A. Aldosri , Michael H. Meylan , Ben Wilks

This paper studies the convex hull of $d$-dimensional samples i.i.d. generated from spherically symmetric distributions. Specifically, we derive a complete integration formula for the expected facet number of the convex hull. This formula…

Probability · Mathematics 2024-02-16 Feng Zhao , Xinyi Tong , Shao-Lun Huang

In this note we investigate the behavior of the volume that the convex hull of two congruent and intersecting simplices in Euclidean $n$-space can have. We prove some useful equalities and inequalities on this volume. For the regular…

Metric Geometry · Mathematics 2013-05-14 Ákos G. Horváth

We prove the convergence of moments of the number of directions of affine lattice vectors that fall into a small disc, under natural Diophantine conditions on the shift. Furthermore, we show that the pair correlation function is Poissonian…

Number Theory · Mathematics 2024-03-19 Wooyeon Kim , Jens Marklof

It is shown that the discrepancy function for point distributions on a torus is expressed by an explicit formula in terms of its mean values on sub-tori. As an application of this formula, a simple proof of a theorem of Lev on the…

Classical Analysis and ODEs · Mathematics 2023-09-06 M. M. Skriganov

We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing shape that generalizes the convex hull. Let $R$ and $B$ be…

Computational Geometry · Computer Science 2022-09-12 Carlos Alegría , David Orden , Carlos Seara , Jorge Urrutia

In this study, a geometric version of an NP-hard problem ("Almost $2-SAT$" problem) is introduced which has potential applications in clustering, separation axis, binary sensor networks, shape separation, image processing, etc. Furthermore,…

Computational Geometry · Computer Science 2025-03-14 Bahram Sadeghi Bigham

In this paper, we will consider the problem that how far from Hunt's hypothesis (H) to symmetrization for a general 1-dimensional diffusion. A characterization of (H) involving the classification of points for this diffusion will be first…

Probability · Mathematics 2021-07-26 Liping Li

Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…

Analysis of PDEs · Mathematics 2011-07-07 Alessio Figalli , Young-Heon Kim , Robert J. McCann

We present a framework to obtain valid inequalities for a reverse convex set: the set of points in a polyhedron that lie outside a given open convex set. Reverse convex sets arise in many models, including bilevel optimization and…

Optimization and Control · Mathematics 2020-12-02 Eli Towle , James Luedtke

The standard convex closed hull of a set is defined as the intersection of all images, under the action of a group of rigid motions, of a half-space containing the given set. In this paper we propose a generalisation of this classical…

Metric Geometry · Mathematics 2024-09-04 Zakhar Kabluchko , Alexander Marynych , Ilya Molchanov

$f$-divergences are a general class of divergences between probability measures which include as special cases many commonly used divergences in probability, mathematical statistics and information theory such as Kullback-Leibler…

Statistics Theory · Mathematics 2013-10-16 Adityanand Guntuboyina , Sujayam Saha , Geoffrey Schiebinger

We describe convex hulls of the simplest compact space curves, reducible quartics consisting of two circles. When the circles do not meet in complex projective space, their algebraic boundary contains an irrational ruled surface of degree…

Algebraic Geometry · Mathematics 2017-01-24 Evan D. Nash , Ata Firat Pir , Frank Sottile , Li Ying

We study graph-directed conjugate functional equations on the unit interval indexed by the complete digraph with self-loops on two vertices. We focus on the singularity and regularity of the solutions for compatible systems of weak…

Dynamical Systems · Mathematics 2026-03-25 Kazuki Okamura

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…

Optimization and Control · Mathematics 2023-07-26 Marius Costandin

Finding two disjoint simple paths on two given sets of points is a geometric problem introduced by Jeff Erickson. This problem has various applications in computational geometry, like robot motion planning, generating polygon etc. We will…

Computational Complexity · Computer Science 2017-12-29 Mohammadreza Razzazi , Abdolah Sepahvand