Related papers: Observations on the Perturbed Wedge
We consider non-perturbative effects in theories with extra dimensions and the deconstructed versions of these theories. We establish the rules for instanton calculations in 5D theories on the circle, and use them for an explicit…
Let $X$ be a cubic fourfold in $P^5_{C}$. We prove that, assuming the Hodge conjecture for the product $S \times S$, where $S$ is a complex surface, and the finite dimensionality of the Chow motive $h(S)$, there are at most a countable…
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch…
Let $R$ be the field of real Puiseux series. It is a real closed field. We construct the first examples of smooth intersections of two quadrics in $\mathbb{P}_R^5$ and smooth cubic hypersurfaces in $\mathbb{P}_R^4$ which are not stably…
Blind Descent uses constrained but, guided approach to learn the weights. The probability density function is non-zero in the infinite space of the dimension (case in point: Gaussians and normal probability distribution functions). In Blind…
A computer search through the oriented matroid programs with dimension 5 and 10 facets shows that the maximum strictly monotone diameter is 5. Thus $\Delta_{sm}(5,10)=5$. This enumeration is analogous to that of Bremner and Schewe for the…
In this paper, we present a minimal counterexample to a conjecture of Perles that answers a question of Haase and Ziegler. The example is a simple 4-polytope that has an induced 3-connected 3-regular subgraph, whose graph complement is…
We develop a recursive formula for counting the number of rectangulations of a square, i.e the number of combinatorially distinct tilings of a square by rectangles. Our formula specializes to give a formula counting generic rectangulations,…
We construct the first examples of hypersurfaces in any contact manifold of dimension 5 and larger that cannot be $C^2$-approximated by convex hypersurfaces, contrasting sharply with the foundational results of Giroux in dimension $3$ and…
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
For each odd $n \geq 3$, we construct a closed convex hypersurface of $\mathbb{R}^{n+1}$ that contains a non-degenerate closed geodesic with Morse index zero. A classical theorem of J. L. Synge would forbid such constructions for even $n$,…
We construct the most general single-mode superstrata in 5 dimensions with ambipolar, two centered Gibbons Hawking bases, via dimensional reduction of superstrata in 6 dimensions. Previously, asymptotically $\text{AdS}_{3}\times…
A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…
The Wythoff construction takes a $d$-dimensional polytope $P$, a subset $S$ of $\{0,..., d\}$ and returns another $d$-dimensional polytope $P(S)$. If $P$ is a regular polytope, then $P(S)$ is vertex-transitive. This construction builds a…
The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets cannot have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the…
In this paper we study an overdetermined problem which is directly related to the well known torsion problem studied by J. Serrin. A perturbed version of the latter is tackled by using asymptotic series as well as tools borrowed from the…
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means of attempting to prove polynomial upper bounds on the diameter of the facet-ridge graph of a simplicial polytope. Recently, De Loera and Klee…
Recently, Greenfeld and Tao disprove the conjecture that translational tilings of a single tile can always be periodic [Ann. Math. 200(2024), 301-363]. In another paper [to appear in J. Eur. Math. Soc.], they also show that if the dimension…
The goal of this paper is to present a general and novel approach for the reconstruction of any convex d-dimensional polytope P, from knowledge of its moments. In particular, we show that the vertices of an N-vertex polytope in R^d can be…
In this letter a generic counterexample to the strong cosmic censor conjecture is exhibited. More precisely---taking into account that the conjecture lacks any precise formulation yet---first we make sense of what one would mean by a…