Related papers: Local extrema for hypercube sections
Independent set is a fundamental problem in combinatorial optimization. While in general graphs the problem is essentially inapproximable, for many important graph classes there are approximation algorithms known in the offline setting.…
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…
The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…
For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…
We consider constellations of disks which are unions of disjoint hyperbolic disks in the unit disk with fixed radii and unfixed centers. We study the problem of maximizing the conformal capacity of a constellation with a fixed number of…
The volume cut off by a hyperplane from a bounded body with smooth boundary in $R^{2k}$ never is an algebraic function on the space of hyperplanes: for k=1 it is the famous lemma XXVIII from Newton's Principia. Following an analogy of these…
We study an ergodic problem associated to a non-local Hamilton-Jacobi equation defined on the whole space $\lambda-\mathcal{L}[u](x)+|Du(x)|^m=f(x)$ and determine whether (unbounded) solutions exist or not. We prove that there is a…
In this paper we look for the domains minimizing the h-th eigenvalue of the Dirichlet-Laplacian $\lambda$ h with a constraint on the diameter. Existence of an optimal domain is easily obtained, and is attained at a constant width body. In…
In this article, we set up a variational problem to arrive at the equation of the maximal hypersurface in the interior of a spherically symmetric evolving trapped region. In the first part of the article, we present the Lagrangian and the…
Higher-order numerical methods are used to find accurate numerical solutions to hyperbolic partial differential equations and equations of transport type. Limiting is required to either converge to the correct type of solution or to adhere…
It is shown that a locally finite ultrametric space $(X, d)$ is generated by labeled tree if and only if, for every open ball $B \subseteq X$, there is a point $c \in B$ such that $d(x, c) = \operatorname{diam} B$ whenever $x \in B$ and $x…
The maximal hyperplane section of the $l_\infty^n$-ball, i.e. of the $n$-cube, is the one perpendicular to 1/sqrt 2 (1,1,0, ... ,0), as shown by Ball. Eskenazis, Nayar and Tkocz extended this result to the $l_p^n$-balls for very large $p…
In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. It is reasoned that under some conditions, the optimum occurs at the corners of…
In this talk we show that any spherically symmetric spacetime admits locally a maximal spacelike slicing. The above condition is reduced to solve a decoupled system of first order quasi-linear partial differential equations. The solution…
We study some approximation problems on a strict subset of the circle by analytic functions of the Hardy space H2 of the unit disk (in C), whose modulus satisfy a pointwise constraint on the complentary part of the circle. Existence and…
Let $\partial \,\mathcal{C}$ be the boundary of a compact convex body $\mathcal{C}$ in $\mathbb{R}^n,\, n\geq 2$, and $O$ be an interior point of $\mathcal C$. Every straight line $l$ containing $O$ cuts from $\mathcal{C}$ a segment $[AB]$…
We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions,…
Using the notion of a strongly regular hyperbolic automorphism of a locally finite Euclidean building, we prove that any (not necessarily discrete) closed, co-compact subgroup of the type-preserving automorphisms group of a locally finite…
Bounding the number of rational points of height at most $H$ on irreducible algebraic plane curves of degree $d$ has been an intense topic of investigation since the work by Bombieri and Pila. In this paper we establish optimal dependence…