Related papers: The Perimeter of Proper Polycubes
In this paper we investigate the metric properties of quadrics and cones of the $n$-dimensional Euclidean space. As applications of our formulas we give a more detailed description of the construction of Chasles and the wire model of…
We use floor decompositions of tropical curves to prove that any enumerative problem concerning conics passing through projective-linear subspaces in $\RP^n$ is maximal. That is, there exist generic configurations of real linear spaces such…
We prove that a subset of the hypercube $(0,1)^d$ with volume sufficiently close to $\frac12$ has (relative) perimeter greater than or equal to $1$. This settles a conjecture by Brezis and Bruckstein. We also prove that, in contrast with…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and…
In this paper, we prove restriction estimates for hyperbolic paraboloids in dimensions $n>=5$ by the polynomial partitioning method.
We construct new examples of cubic polynomials with a parabolic fixed point that cannot be approximated by Misiurewicz polynomials. In particular, such parameters admit maximal bifurcations, but do not belong to the support of the…
We count orientable small covers over cubes. We also get estimates for $O_n/R_n$, where $O_n$ is the number of orientable small covers and $R_n$ is the number of all small covers over an $n$-cube up to the Davis-Januszkiewicz equivalence.
We show that any total preorder on a set with $\binom{n}{2}$ elements coincides with the order on pairwise distances of some point collection of size $n$ in $\mathbb{R}^{n-1}$. For linear orders, a collection of $n$ points in…
We prove a bound for the geodesic diameter of a subset of the unit ball in $\mathbb{R}^n$ described by a fixed number of quadratic equations and inequalities, which is polynomial in $n$, whereas the known bound for general degree is…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved…
By solving a problem regarding polynomials in a quotient ring, we obtain the relative hull and the Hermitian hull of projective Reed-Muller codes over the projective plane. The dimension of the hull determines the minimum number of…
Let $R$ be a polynomial ring over a field and $I$ an ideal generated by three forms of degree three. Motivated by Stillman's question, Engheta proved that the projective dimension $\mathrm{pd}(R/I)$ of $R/I$ is at most 36, although the…
We present Monte Carlo estimates for site and bond percolation thresholds in simple hypercubic lattices with 4 to 13 dimensions. For d<6 they are preliminary, for d >= 6 they are between 20 to 10^4 times more precise than the best previous…
We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…
We describe all special curves in the parameter space of complex cubic polynomials, that is all algebraic irreducible curves containing infinitely many post-critically finite polynomials. This solves in a strong form a conjecture by Baker…
We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in $\mathbb{R}^d$. They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of…
On the perimeter length determination of the eight-centered oval. Several studies have shown that an eight-centered oval coincides almost perfectly with the ellipse constructed on the same axes and can be considered as a representation of…
A lattice Delaunay polytope is known as perfect if the only ellipsoid, that can be circumscribed about it, is its Delaunay sphere. Perfect Delaunay polytopes are in one-to-one correspondence with arithmetic equivalence classes of positive…
A simple $n$-gon is a polygon with $n$ edges with each vertex belonging to exactly two edges and every other point belonging to at most one edge. Brass asked the following question: For $n \geq 5$ odd, what is the maximum perimeter of a…