相关论文: Convex polytopes and linear algebra

We prove that a Hilbert domain which is quasi-isometric to a normed vector space is actually a convex polytope.

Hex systems were recently introduced [A. P. Kels. Integrable systems on hexagonal lattices and consistency on polytopes with quadrilateral and hexagonal faces. 2022. arXiv:2205.02720 [math-ph]] as systems of equations defined on…

The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…

For every linear binary code $C$, we construct a geometric triangular configuration $\Delta$ so that the weight enumerator of $C$ is obtained by a simple formula from the weight enumerator of the cycle space of $\Delta$. The triangular…

For an integral convex polytope $\Pc \subset \RR^N$ of dimension $d$, we call $\delta(\Pc)=(\delta_0, \delta_1,..., \delta_d)$ the $\delta$-vector of $\Pc$ and $\vol(\Pc)=\sum_{i=0}^d\delta_i$ its normalized volume. In this paper, we will…

Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…

The set theory relations \in, \backslash, \Delta, \cap, and \cup have corollaries in subspace relations. Geometric Algebra is introduced as the ideal framework to explore these subspace operations. The relations \in, \backslash, and \Delta…

We introduce a cohomology theory of grading-restricted vertex algebras. To construct the {\it correct} cohomologies, we consider linear maps from tensor powers of a grading-restricted vertex algebra to "rational functions valued in the…

Holonomy groups and holonomy algebras for connections on locally free sheaves over supermanifolds are introduced. A one-to-one correspondence between parallel sections and holonomy-invariant vectors, and a one-to-one correspondence between…

A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…

Some basic notions of classical algebraic geometry can be defined in arbitrary varieties of algebras $\Theta.$ For every algebra $H$ in $\Theta$ one can consider algebraic geometry in $\Theta$ over $ H.$ Correspondingly, algebras in…

There is a very extensive literature dealing with convex polytopes from the standpoints of combinatorics and numerical analysis. By contrast, the current paper adopts an alternative viewpoint that regards a polytope as an autonomous space…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

Given an infinite field $\mathbb{k}$ and a simplicial complex $\Delta$, a common theme in studying the $f$- and $h$-vectors of $\Delta$ has been the consideration of the Hilbert series of the Stanley--Reisner ring $\mathbb{k}[\Delta]$…

This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of…

This is an introduction to geometric algebra, an alternative to traditional vector algebra that expands on it in two ways: 1. In addition to scalars and vectors, it defines new objects representing subspaces of any dimension. 2. It defines…

Let $G$ be a simple graph, $A(G)$ its adjacency matrix, and $D(G)$ its diagonal degree matrix. In 2022, \citeauthor{Wang2020} (\cite{Wang2020}) defined the family of matrices $L_\alpha$ as the convex linear combination: \[ L_\alpha(G) =…

A convex geometry is a closure space satisfying the anti-exchange axiom. For several types of algebraic convex geometries we describe when the collection of closed sets is order scattered, in terms of obstructions to the semilattice of…