相关论文: Inside-Out Polytopes

Unlabeled multigraphs have diverse applications across scientific fields, from transportation and social networks to polymer physics. In particular, multigraphs are essential for studying the relationship between the spatial organization…

This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…

The concept of cutting is first explicitly introduced. By the concept, a convex expansion for finite distributive lattices is considered. Thus, a more general method for drawing the Hasse diagram is given, and the rank generating function…

A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex $v$ and every color $\alpha$, there are at most as many edges incident to $v$ colored with $\alpha$ as with all other colors.…

Reflexive polytopes form one of the distinguished classes of lattice polytopes. Especially reflexive polytopes which possess the integer decomposition property are of interest. In the present paper, by virtue of the algebraic technique on…

One of the main questions in the theory of normal surface singularities is to understand the relations between their geometry and topology. The lattice cohomology is an important tool in the study of topological properties of a plumbed…

In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We give asymptotically tight results and lower bounds for maximal…

In this paper we consider the following three coloring concepts for digraphs. First of all, the generalized coloring concept, in which the same colored vertices of a digraph induce a subdigraph that satisfies a given digraph property.…

In this paper we consider Lipschitz graphs of functions which are stationary points of strictly polyconvex energies. Such graphs can be thought as integral currents, resp. varifolds, which are stationary for some elliptic integrands. The…

In this paper, author uses set theory to construct a logic model of abstract figure from binary relation. Based on the uniform quantified structure, author gives two logic system for graph traversal and graph coloring respectively, moreover…

A lattice polytope is called spanning if its lattice points affinely span the ambient lattice. We show as a corollary to a general result in the Ehrhart theory of lattice polytopes that the $h^*$-vector of a spanning lattice polytope has no…

In this paper, we introduce a generalization of graphlets to heterogeneous networks called typed graphlets. Informally, typed graphlets are small typed induced subgraphs. Typed graphlets generalize graphlets to rich heterogeneous networks…

We provide a condition-based analysis of two interior-point methods for unconstrained geometric programs, a class of convex programs that arise naturally in applications including matrix scaling, matrix balancing, and entropy maximization.…

As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are…

We propose a new type of approximate counting algorithms for the problems of enumerating the number of independent sets and proper colorings in low degree graphs with large girth. Our algorithms are not based on a commonly used Markov chain…

A D-polyhedron is a polyhedron $P$ such that if $x,y$ are in $P$ then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full…

Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…

Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…

Solutions to a linear Diophantine system, or lattice points in a rational convex polytope, are important concepts in algebraic combinatorics and computational geometry. The enumeration problem is fundamental and has been well studied,…

We extend the Barvinok-Woods algorithm for enumerating projections of integer points in polytopes to unbounded polyhedra. For this, we obtain a new structural result on projections of semilinear subsets of the integer lattice. We extend the…