Related papers: Maximal admissible faces and asymptotic bounds for…
Using a two-dimensional version of the delta method, we establish an asymptotic formula for the number of rational points of bounded height on non-singular complete intersections of cubic and quadric hypersurfaces of dimension at least $23$…
Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of…
This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. Some simple polytopes with known H-representations and…
We consider a finite field model of the X-ray transform that integrates functions along lines in dimension 3, within the context of finite fields. The admissibility problem asks for minimal sets of lines for which the restricted transform…
We study the number of facets of the convex hull of n independent standard Gaussian points in d-dimensional Euclidean space. In particular, we are interested in the expected number of facets when the dimension is allowed to grow with the…
We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
To determine the relative position of any two surfaces in a system, one approach is to useoperations (Minkowski sum and intersection) on sets of constraints. These constraints aremade compliant with half-spaces of R^n where each set of…
We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…
In this paper we investigate the asymptotic growth of the number of irreducible and connected components of the moduli space of surfaces of general type corresponding to certain families of surfaces isogenous to a higher product. We obtain…
We give a general criterion for the Dirichlet problem at infinity (DPI) on a Cartan-Hadamard surface to be solvable, which we primarily use to give the best possible upper radial radial curvature bound for solvability of the DPI, but which…
Numerically locating the critical points of non-convex surfaces is a long-standing problem central to many fields. Recently, the loss surfaces of deep neural networks have been explored to gain insight into outstanding questions in…
This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric…
Symmetric edge polytopes, a.k.a. PV-type adjacency polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In…
We introduce the problem of asymptotic subspace consensus, which requires the outputs of processes to converge onto a common subspace while remaining inside the convex hull of initial vectors.This is a relaxation of asymptotic consensus in…
If M is a manifold with compressible boundary, we analyze essential disks in M, as well as incompressible, but not necessarily boundary incompressible, surfaces in M. We are most interested in the case where M is a handlebody or compression…
In tolerancing analysis, geometrical or contact specifications can be represented by polytopes. Due to the degrees of invariance of surfaces and that of freedom of joints, these operand polytopes are originally unbounded in most of the…
In (equi-)affine differential geometry, the most important algebraic invariants are the affine (Blaschke) metric h, the affine shape operator S and the difference tensor K. A hypersurface is said to admit a pointwise symmetry if at every…
Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…
In this paper, we use normal surface theory to study Dehn filling on a knot-manifold. First, it is shown that there is a finite computable set of slopes on the boundary of a knot-manifold that bound normal and almost normal surfaces in a…