Related papers: On the connected blocks polytope

We investigate the Hilbert scheme of points on a smooth threefold. We introduce a notion of broken Gorenstein structure for finite schemes, and show that its existence guarantees smoothness on the Hilbert scheme. Moreover, we conjecture…

It is shown that the Hilbert metric on the interior of a convex polytope is bilipschitz to a normed vector space of the same dimension.

We study totally acyclic complexes of projective modules over triangular matrix rings and then use it to classify Gorenstein projective modules over such rings. We also use this classification to obtain some information concerning…

The face ring of a homology manifold (without boundary) modulo a generic system of parameters is studied. Its socle is computed and it is verified that a particular quotient of this ring is Gorenstein. This fact is used to prove that the…

A subgroup H of a reductive group G is horospherical if it contains a maximal unipotent subgroup. We describe the Grothendieck semigroup of invariant subspaces of regular functions on G/H as a semigroup of convex polytopes. From this we…

In the early 1990's, Billera and Sturmfels introduced the monotone path polytope (MPP), a special case of the general theory of fiber polytopes that associates a polytope to a pair $(P,\varphi)$ of a polytope $P$ and linear functional…

A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…

For a Riemannian polyhedra, we study the geometry of the unit ball for the unidimensional stable norm (stable ball). In the case of a unidimensional Riemannian polyhedra (graph), we show that the stable ball is a polytope whose vertices are…

In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…

The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch…

A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…

We study a certain polytope depending on a graph $G$ and a parameter $\beta\in(0,1)$ which arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process. Eshragh \emph{et al.} conjectured a lower bound on the…

We compute the Hochschild cohomology algebras of Ringel-self-dual blocks of polynomial representations of $\GL_2$ over an algebraically closed field of characteristic $p>2$, that is, of any block whose number of simple modules is a power of…

It is well known that \textit{every} Eulerian orientation of an Eulerian $2k$-edge connected (undirected) graph is strongly $k$-edge connected. An important goal in the area is to obtain analogous results for other types of connectivity,…

We introduce a special subset of the graph of a homogeneous coupled cell network, called a projection block, and show that the network obtained from identifying this block to a single point can be used to understand the generic bifurcations…

Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…

We characterize Gorenstein modules over those local rings that admit a finite contracting endomorphism.

Let $X$ be a complex manifold and let $g$ be a polyhedral metric on it inducing its topology. We say that $g$ is a polyhedral K\"ahler (PK) metric on $X$ if it is K\"ahler outside its singular set. The local geometry of PK metrics is…

We give a description of the connected graded algebras which are finitely generated and presented of global dimension 2 or 3 and which are Gorenstein. These algebras are constructed from multilinear forms. We generalize the construction by…

Let G be a connected bipartite graph with color classes E and V and root polytope Q. Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is…