Related papers: A lower bound for essential covers of the cube
A facet of an hyperplane arrangement is called external if it belongs to exactly one bounded cell. The set of all external facets forms the envelope of the arrangement. The number of external facets of a simple arrangement defined by $n$…
For closed odd-dimensional manifolds with sectional curvature less or equal than -1, we define the minimal surface entropy that counts the number of surface subgroups. It attains the minimum if and only if the metric is hyperbolic.…
Let $H_n$ be the minimal number such that any $n$-dimensional convex body can be covered by $H_n$ translates of interior of that body. Similarly $H_n^s$ is the corresponding quantity for symmetric bodies. It is possible to define $H_n$ and…
A celebrated conjecture of Tuza states that in any finite graph the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint triangles. For an $r$-uniform hypergraph ($r$-graph) $G$, let…
A general framework for determining fundamental bounds in nanophotonics is introduced in this paper. The theory is based on convex optimization of dual problems constructed from operators generated by electromagnetic integral equations. The…
A completely entangled subspace of a tensor product of Hilbert spaces is a subspace with no non-trivial product vector. K. R. Parthasarathy determined the maximum dimension possible for such a subspace. Here we present a simple explicit…
In this paper, we study extremal subsets in Alexandrov spaces with dimension $n$, curvature $\ge\kappa$, and diameter $\le D$. We show that the following three quantities are uniformly bounded above in terms of $n$, $\kappa$, and $D$: (1)…
In 1914 Lebesgue defined a "universal covering" to be a convex subset of the plane that contains an isometric copy of any subset of diameter 1. His challenge of finding a universal covering with the least possible area has been addressed by…
Consider the classical Bin Packing problem with $d$ different item sizes $s_i$ and amounts of items $a_i.$ The support of a Bin Packing solution is the number of differently filled bins. In this work, we show that the lower bound on the…
We prove the macroscopic cousins of three conjectures: 1) a conjectural bound of the simplicial volume of a Riemannian manifold in the presence of a lower scalar curvature bound, 2) the conjecture that rationally essential manifolds do not…
We use the fixed point method and toroidal compactifications to establish general lower bounds for the essential dimension of congruence covers $\Gamma' \backslash \mathcal{X}^0 \rightarrow \Gamma \backslash \mathcal{X}^0$ of mixed Shimura…
We establish a new bridge between propositional logic and elementary number theory. The main objects are "minimally unsatisfiable clause-sets", short "MUs", unsatisfiable conjunctive normal forms rendered satisfiable by elimination of any…
A cover of a finite non-cyclic group $G$ is a family $\mathcal{H}$ of proper subgroups of $G$ whose union equals $G$. A cover of $G$ is called minimal if it has minimal size, and irredundant if it does not properly contain any other cover.…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
We study the non-linear minimization problem on $H^1_0(\Omega)\subset L^q$ with $q=\frac{2n}{n-2}$, $\alpha>0$ and $n\geq4$~: \[\inf_{\substack{u\in H^1_0(\Omega) \|u\|_{L^q}=1}}\int_\Omega a(x,u)|\nabla u|^2 - \lambda \int_{\Omega}…
This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…
We develop a regularity and compactness theory for stable capillary minimal hypersurfaces in the half-space $\mathbb{H}^{n+1}$ with contact angle $\theta \in (0,\pi)$ and dimension $n \geq 2$. As a consequence, we obtain the generalized…
Hadwiger's conjecture in convex geometry, formulated in 1957, states that every convex body in $\mathbb{R}^n$ can be covered by $2^n$ translations of its interior. Despite significant efforts, the best known bound related to this problem…
The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…
We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…