相关论文: On the classification of lattice polytopes via aff…

In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. Since then, this problem and its analogues have been studied by many authors, including $\mathrm{B\acute{a}r\acute{a}ny}$, Lagarias, Pach,…

In 1980, V.I. Arnold studied the classification problem for convex lattice polygons of given area. Since then this problem and its analogues have been studied by B'ar'any, Pach, Vershik, Liu, Zong and others. Upper bounds for the numbers of…

Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…

In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…

Given an affine variety X and a finite dimensional vector space of regular functions L on X, we associate a convex body to (X, L) such that its volume is responsible for the number of solutions of a generic system of functions from L. This…

We introduce and study the equiaffine symmetric {\bf hyperspheres}. For the first step we consider the locally strongly convex ones. In fact, by the idea used by Naitoh, we provide in this paper a direct proof of the complete classification…

Recent work by Forsg{\aa}rd indicates that not every convex lattice polygon arises as the characteristic polygon of an affine dimer or, equivalently, an admissible oriented line arrangement on the torus in general position. We begin the…

An affine version of the linear subspace concentration inequality as proposed by Wu is established for centered convex bodies. This generalizes results from Wu and Freyer, Henk, Kipp on polytopes to convex bodies.

In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…

In this paper for any dimension n we give a complete list of lattice convex polytopes in R^n that are regular with respect to the group of affine transformations preserving the lattice.

The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…

We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

Recently, K.-Y. Wu introduced affine subspace concentration conditions for the cone volumes of polytopes and proved that the cone volumes of centered, reflexive, smooth lattice polytopes satisfy these conditions. We extend the result to…

The existing object classification techniques based on descriptive features rely on object alignment to compute the similarity of objects for classification. This paper replaces the necessity of object alignment through sorting of feature.…

In this paper, we study a second order variational problem for locally convex hypersurfaces, which is the affine invariant analogue of the classical Plateau problem for minimal surfaces. We prove existence, regularity and uniqueness results…

The study of the topology of polynomial maps originates from classical questions in affine geometry, such as the Jacobian Conjecture, as well as from works of Whitney, Thom, and Mather in the 1950-70s on diffeomorphism types of smooth maps.…

Convex geometry has recently attracted great attention as a framework to formulate general probabilistic theories. In this framework, convex sets and affine maps represent the state spaces of physical systems and the possible dynamics,…