Related papers: Hunting for reduced polytopes
In the paper we provide a new method of proving the existence of a hypersurface of degree $d$ in $\mathbb{P}^n$, with a general point of multiplicity $m$ and vanishing at a given set of points $Z$, by looking at weak combinatorics of a set…
In the moduli space of degree d polynomials, the special subvarieties are those cut out by critical orbit relations, and then the special points are the post-critically finite polynomials. It was conjectured that in the moduli space of…
Coupled-mode systems are used in physical literature to simplify the nonlinear Maxwell and Gross-Pitaevskii equations with a small periodic potential and to approximate localized solutions called gap solitons by analytical expressions…
Harmonic superspaces for spacetimes of dimension $d\leq 3$ are constructed. Some applications are given.
In this short note we use the polynomial partitioning lemma to strengthen a recent result of Dvir and Gopi about the number of rich lines in high dimensional Euclidean spaces. Our result shows that if there are sufficiently many rich lines…
I consider compact metric spaces which admit intrinsic isometries to Euclidean d-space. The main result roughly states that the class of these spaces coincides with class of inverse limits of Euclidean d-polyhedra.
We construct examples of embedded flexible cross-polytopes in the spheres of all dimensions. These examples are interesting from two points of view. First, in dimensions 4 and higher, they are the first examples of embedded flexible…
We consider any cover $\mathscr{C}$ of $\mathbb{R}^3$ by balls of radius bigger or equal $1$ satisfying two conditions: (i) any ball intersects at most $\sigma>0$ other balls, and (ii) intersecting balls have comparable sizes. We consider a…
Consider a mechanical system with a real analytic potential. We prove that in dimension three, there is an open and dense subset of the set of non strict local minimums of the potential such that every one of its points is a Lyapunov…
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…
This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number.
The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with $d+2$ vertices in Euclidean, spherical and hyperbolic $d$-space. In particular, we find the minimal volume $d$-dimensional hyperbolic simplices…
We derive various bounds for the $L_p$ distance of polynomials on the hypercube from Walsh tail spaces, extending some of Oleszkiewicz's results (2017) for Rademacher sums.
This paper deals with the global well-posedness of the 3D axisymmetric Euler equations for initial data lying in some critical Besov spaces
Some soliton equation in 2+1 dimensions and their 1+1 and/or dimensional integrable reductions are considered.
A new intrinsic volume metric is introduced for the class of convex bodies in $\mathbb{R}^n$. As an application, an inequality is proved for the asymptotic best approximation of the Euclidean unit ball by arbitrarily positioned polytopes…
The Lasserre's reconstruction algorithm is extended to the D-polytopes with the construction of their shape space. Thus, the areas of d-skeletons $(1\leq d\leq D)$ can be expressed as functions of the areas and normal bi-vectors of the…
We study the global existence of solutions to semilinear damped wave equations in the scattering case with derivative power-type nonlinearity on (1+3) dimensional nontrapping asymptotically Euclidean manifolds. The main idea is to exploit…
Studying the isotropy orbits of compact symmetric spaces Reiswich introduced a family of explicit polynomials in one variable in order to describe the unique minimal isotropy orbit of compact symmetric spaces with Dynkin diagram of type…
In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every…