相关论文: Adjacency method for extreme Delaunay polytopes

This work introduces a novel dissimilarity measure between two convex cones, based on the max-min angle between them. We demonstrate that this measure is closely related to the Pompeiu-Hausdorff distance, a well-established metric for…

The values of the determinant of Vandermonde matrices with real elements are analyzed both visually and analytically over the unit sphere in various dimensions. For three dimensions some generalized Vandermonde matrices are analyzed…

The (delta-) normal cone to an arbitrary intersection of sublevel sets of proper, lower semicontinuous, and convex functions is characterized, using either epsilon-subdifferentials at the nominal point or exact subdifferentials at nearby…

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…

Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…

We consider the lowest--degree nonconforming finite element methods for the approximation of elliptic problems in high dimensions. The $P_1$--nonconforming polyhedral finite element is introduced for any high dimension. Our finite element…

We present a new and simple randomized algorithm for constructing the Delaunay triangulation using nearest neighbor graphs for point location. Under suitable assumptions, it runs in linear expected time for points in the plane with…

We study cyclic sieving phenomena (CSP) on combinatorial objects from an abstract point of view by considering a rational polyhedral cone determined by the linear equations that define such phenomena. Each lattice point in the cone…

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

We interpret the property of having an infinitesimal symmetry as a variational property in certain geometric structures. This is achieved by establishing a one-to-one correspondence between a class of cone structures with an infinitesimal…

This article establishes the existence of Lyapunov functions for analyzing the stability of a class of state-constrained systems, and it describes algorithms for their numerical computation. The system model consists of a differential…

Pedigree polytopes are extensions of the classical Symmetric Traveling Salesman Problem polytopes whose graphs (1-skeletons) contain the TSP polytope graphs as spanning subgraphs. While deciding adjacency of vertices in TSP polytopes is…

In this paper we extend the notion of a Lorentz cone. We call a closed convex set isotone projection set with respect to a pointed closed convex cone if the projection onto the set is isotone (i.e., monotone) with respect to the order…

This paper is devoted to the general problem of projection onto a polyhedral convex cone generated by a finite set of generators.This problem is reformulated into projection onto the polytope obtained by simple truncation of the original…

By a classical theorem of Gallot (1979), a Riemannian cone over a complete Riemannian manifold is either flat or has irreducible holonomy. We consider metric cones with reducible holonomy over pseudo-Riemannian manifolds. First we describe…

A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

We aim to give a strict proof of the existence and uniqueness of the weighted Voronoi decomposition and the dual weighted Delaunay triangulation on Euclidean and hyperbolic polyhedral surface as well as hyperbolic surface with geodesic…

Within classical optics, one may add microscopic "roughness" to a macroscopically flat mirror so that parallel rays of a given angle are reflected at different outgoing angles. Taking the limit (as the roughness becomes increasingly…

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…