English
Related papers

Related papers: Min-Max Polarization for Certain Classes of Sharp …

200 papers

Relative entropy is an essential tool in quantum information theory. There are so many problems which are related to relative entropy. In this article, the optimal values which are defined by $\displaystyle\max_{U\in{U(\cX_{d})}}…

Information Theory · Computer Science 2013-04-02 Fan Wang , Jun Zhu , Lin Zhang

This is an investigation into the exact forms of images of point charges in 2D conducting ellipses and 3D prolate spheroids. For an ellipse with exterior point source, we compare two previous expressions for the analytic continuation inside…

Classical Physics · Physics 2021-12-02 Matt Majic

We show that, for a fixed order $\gamma\geq 1$, each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to stationarity of order $1$),…

Optimization and Control · Mathematics 2023-02-10 Matúš Benko , Patrick Mehlitz

We show that the energy levels predicted by a 1/N-expansion method for an N-dimensional Hydrogen atom in a spherical potential are always lower than the exact energy levels but monotonically converge towards their exact eigenstates for…

Mesoscale and Nanoscale Physics · Physics 2013-04-01 Amit K Chattopadhyay

Given independent standard Gaussian points $v_1, \ldots, v_n$ in dimension $d$, for what values of $(n, d)$ does there exist with high probability an origin-symmetric ellipsoid that simultaneously passes through all of the points? This…

Data Structures and Algorithms · Computer Science 2023-06-02 Aaron Potechin , Paxton Turner , Prayaag Venkat , Alexander S. Wein

The \textsc{Capacitated $d$-Hitting Set} problem involves a universe $U$ with a capacity function $\mathsf{cap}: U \rightarrow \mathbb{N}$ and a collection $\mathcal{A}$ of subsets of $U$, each of size at most $d$. The goal is to find a…

Data Structures and Algorithms · Computer Science 2024-10-29 Daniel Lokshtanov , Abhishek Sahu , Saket Saurabh , Vaishali Surianarayanan , Jie Xue

We prove that among all doubly connected domains of R^n (n>=2) bounded by two spheres of given radii, the Dirichlet heat content at any fixed time achieves its minimum when the spheres are concentric. This is shown to be a special case of a…

Spectral Theory · Mathematics 2021-06-24 Liangpan Li

It is shown that the spectral points (bound states and resonances) generated by a central potential of a single-channel problem, can be found using rational parametrization of the S-matrix. To achieve this, one only needs values of the…

Nuclear Theory · Physics 2015-05-30 S. A. Rakityansky , S. A. Sofianos , N. Elander

We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…

Computational Geometry · Computer Science 2007-05-23 Rina Panigrahy

The spectrum of a Schr\"odinger operator with periodic potential generally consists of bands and gaps. In this paper, for fixed m, we consider the problem of maximizing the gap-to-midgap ratio for the m-th spectral gap over the class of…

Optimization and Control · Mathematics 2018-05-14 Chiu-Yen Kao , Braxton Osting

For a distribution function $F$ on $\mathbb{R}^d$ and a point $q\in \mathbb{R}^d$, the \emph{spherical depth} $\SphD(q;F)$ is defined to be the probability that a point $q$ is contained inside a random closed hyper-ball obtained from a pair…

Computational Geometry · Computer Science 2017-02-27 David Bremner , Rasoul Shahsavarifar

In this paper we determine the maximum number of points in $\mathbb{R}^d$ which form exactly $t$ distinct triangles, where we restrict ourselves to the case of $t = 1$. We denote this quantity by $F_d(t)$. It was known from the work of…

We study functions $f : [0, 1]^d \rightarrow [0, 1]^d$ that are both monotone and contracting, and we consider the problem of finding an $\varepsilon$-approximate fixed point of $f$. We show that the problem lies in the complexity class…

Computational Complexity · Computer Science 2025-03-28 Eleni Batziou , John Fearnley , Spencer Gordon , Ruta Mehta , Rahul Savani

In the subspace approximation problem, we seek a k-dimensional subspace F of R^d that minimizes the sum of p-th powers of Euclidean distances to a given set of n points a_1, ..., a_n in R^d, for p >= 1. More generally than minimizing sum_i…

Data Structures and Algorithms · Computer Science 2015-10-22 Kenneth L. Clarkson , David P. Woodruff

In this paper, we focus on the following general shape optimization problem: $$ \min\{J(\Om), \Om convex, \Om\in\mathcal S_{ad}\}, $$ where $\mathcal S_{ad}$ is a set of 2-dimensional admissible shapes and $J:\mathcal{S}_{ad}\to\R$ is a…

Optimization and Control · Mathematics 2009-02-19 Jimmy Lamboley , Arian Novruzi

For $ E\subset \mathbb{F}_q^d$, let $\Delta(E)$ denote the distance set determined by pairs of points in $E$. By using additive energies of sets on a paraboloid, Koh, Pham, Shen, and Vinh (2020) proved that if $E,F\subset \mathbb{F}_q^d $…

Number Theory · Mathematics 2020-08-20 Daewoong Cheong , Doowon Koh , Thang Pham

We generalize the maximal diameter sphere theorem due to Toponogov by means of the radial curvature. As a corollary to our main theorem, we prove that for a complete connected Riemannian $n$-manifold $M$ having radial sectional curvature at…

Differential Geometry · Mathematics 2013-11-20 Nathaphon Boonnam

Consider an optimization problem with $n$ binary variables and $d+1$ linear objective functions. Each valid solution $x \in \{0,1\}^n$ gives rise to an objective vector in $\R^{d+1}$, and one often wants to enumerate the Pareto optima among…

Data Structures and Algorithms · Computer Science 2010-11-11 Ankur Moitra , Ryan O'Donnell

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…

Metric Geometry · Mathematics 2015-06-12 Andreas Alpers , David G. Larman

For a full shift with Np+1 symbols and for a non-positive potential, locally proportional to the distance to one of N disjoint full shifts with p symbols, we prove that the equilibrium state converges as the temperature goes to 0. The main…

Dynamical Systems · Mathematics 2015-06-03 Renaud Leplaideur