English
Related papers

Related papers: Local extrema for hypercube sections

200 papers

For compact subsets $E$ of the unit disk $ \mathbb{D}$ we study the capacity of the condenser ${\rm cap}( \mathbb{D},E)$ by means of set functionals defined in terms of hyperbolic geometry. In particular, we study experimentally the case of…

Complex Variables · Mathematics 2021-02-15 Mohamed M. S. Nasser , Matti Vuorinen

In this paper we address the problem of locating a new facility on a $d$-dimensional space when the distance measure ($\ell_p$- or polyhedral-norms) is different at each one of the sides of a given hyperplane $\mathcal{H}$. We relate this…

Optimization and Control · Mathematics 2014-04-14 Victor Blanco , Justo Puerto , Diego Ponce

In this paper, we present a significant improvement of Quick Hypervolume algorithm, one of the state-of-the-art algorithms for calculating exact hypervolume of the space dominated by a set of d-dimensional points. This value is often used…

Neural and Evolutionary Computing · Computer Science 2017-08-14 Andrzej Jaszkiewicz

Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of…

Computational Geometry · Computer Science 2018-03-05 Karl Bringmann , Sergio Cabello , Michael T. M. Emmerich

In this paper convex optimization techniques are employed for convex optimization problems in infinite dimensional Hilbert spaces. A first order optimality condition is given. Let $f : \mathbb{R}^{n}\rightarrow \mathbb{R}$ and let $x\in…

Functional Analysis · Mathematics 2019-03-26 Benard Okelo

We show that in random $K$-uniform hypergraphs of constant average degree, for even $K \geq 4$, local algorithms defined as factors of i.i.d. can not find nearly maximal cuts, when the average degree is sufficiently large. These algorithms…

Probability · Mathematics 2019-11-05 Wei-Kuo Chen , David Gamarnik , Dmitry Panchenko , Mustazee Rahman

A subset of the finite dimensional hypercube is said to be equilateral if the distance of any two distinct points equals a fixed value. The equilateral dimension of the hypercube is defined as the maximal size of its equilateral subsets. We…

Discrete Mathematics · Computer Science 2016-03-03 Lorenz Minder , Thomas Sauerwald , Sven-Ake Wegner

We show that necessary and sufficient conditions of optimality in periodic optimization problems can be stated in terms of a solution of the corresponding HJB inequality, the latter being equivalent to a max-min type variational problem…

Optimization and Control · Mathematics 2013-09-10 Vladimir Gaitsgory , Ludmila Manic

The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…

Combinatorics · Mathematics 2013-12-17 Adrian Dumitrescu , Micha Sharir , Csaba D. Toth

Let f be a function meromorphic in a neighborhood of infinity. The central problem in the present investigation is to find the largest domain D \subset C to which the function f can be extended in a meromorphic and singlevalued manner.…

Classical Analysis and ODEs · Mathematics 2012-05-18 Herbert R Stahl

An abstract framework guaranteeing the continuous differentiability of local value functions on $H^1(\Omega)$ associated with optimal stabilization problems subject to abstract semilinear parabolic equations in the presence of norm…

Optimization and Control · Mathematics 2023-11-28 Karl Kunisch , Buddhika Priyasad

Dependencies of the optimal constants in strong and weak type bounds will be studied between maximal functions corresponding to the Hardy--Littlewood averaging operators over convex symmetric bodies acting on $\mathbb R^d$ and $\mathbb…

Classical Analysis and ODEs · Mathematics 2021-08-31 Dariusz Kosz , Mariusz Mirek , Paweł Plewa , Błazej Wróbel

Let V be a finite set of points in Euclidean d-space (d >= 2). The intersection of all unit balls B(v,1) centered at v, where v ranges over V, henceforth denoted by B(V) is the ball polytope associated with V. Note that B(V) is non-empty…

Metric Geometry · Mathematics 2009-05-12 Yaakov S. Kupitz , Horst Martini , Micha A. Perles

Strongly convex sets in Hilbert spaces are characterized by local properties. One quantity which is used for this purpose is a generalization of the modulus of convexity \delta_\Omega of a set \Omega. We also show that \lim_{\epsilon \to 0}…

Metric Geometry · Mathematics 2013-04-08 Alexander Weber , Gunther Reißig

Let $d \geq 1$ and $s \leq 2^d$ be nonnegative integers. For a subset $A$ of vertices of the hypercube $Q_n$ and $n\geq d$, let $\lambda(n,d,s,A)$ denote the fraction of subcubes $Q_d$ of $Q_n$ that contain exactly $s$ vertices of $A$. Let…

Combinatorics · Mathematics 2024-10-29 Noga Alon , Maria Axenovich , John Goldwasser

In this paper we partially resolve Hall's conjecture about the distribution of random triangles. We consider the probability that three points chosen uniformly at random, in a bounded convex region of the plane, form an acute triangle.…

Probability · Mathematics 2019-06-21 Gabriel Khan

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

Computational Geometry · Computer Science 2015-02-18 Panos Giannopoulos , Christian Knauer , Gunter Rote , Daniel Werner

For a hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. The minimum width…

Metric Geometry · Mathematics 2024-06-07 Marek Lassak

We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…

Combinatorics · Mathematics 2020-06-24 Debsoumya Chakraborti , Po-Shen Loh

Given a bounded open set $\Omega\subseteq{\mathbb{R}}^n$, we consider the eigenvalue problem of a nonlinear mixed local/nonlocal operator with vanishing conditions in the complement of $\Omega$. We prove that the second eigenvalue…

Analysis of PDEs · Mathematics 2021-10-15 Stefano Biagi , Serena Dipierro , Enrico Valdinoci , Eugenio Vecchi
‹ Prev 1 4 5 6 7 8 10 Next ›