Related papers: On the k-Systems of a Simple Polytope

Recently, Choi and Park introduced an invariant of a finite simple graph, called signed a-number, arising from computing certain topological invariants of some specific kinds of real toric manifolds. They also found the signed a-numbers of…

Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from…

Let $k$ be a field of positive characteristic. Building on the work of the second named author, we define a new class of $k$-algebras, called diagonally $F$-regular algebras, for which the so-called Uniform Symbolic Topology Property (USTP)…

A k-dimensional box is the Cartesian product R_1 x R_2 x ... x R_k where each R_i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G) is the minimum integer k such that G is the intersection graph of a…

Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…

A unique sink orientation (USO) is an orientation of the edges of a polytope in which every face contains a unique sink. For a product of simplices $\Delta_{m-1} \times \Delta_{n-1}$, Felsner, G\"artner and Tschirschnitz (2005) characterize…

Let G be a graph and let N_1, ..., N_k be k independent sets in G. The graph G is a k-probe cograph if G can be embedded into a cograph by adding edges between vertices that are contained in the same independent set. We show that there…

The polynomial automorphisms of the affine plane over a field K form a group which has the structure of an amalgamated free product. This well-known algebraic structure can be used to determine some key results about the symmetry and…

Let $G$ be a discrete group generated by reflections in hyperbolic or Euclidean space, and $H\subset G$ be a finite index subgroup generated by reflections. Suppose that the fundamental chamber of $G$ is a finite volume polytope with $k$…

In this paper, we provide a simple proof for the fact that two simplicial complexes are isomorphic if and only if their associated Stanley-Reisner rings, or their associated facet rings are isomorphic as $K$-algebras. As a consequence, we…

A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…

The boxicity of a graph G, denoted as box(G) is defined as the minimum integer t such that G is an intersection graph of axis-parallel t-dimensional boxes. A graph G is a k-leaf power if there exists a tree T such that the leaves of the…

A k-valuation is a special type of edge k-colouring of a medial graph. Various graph polynomials, such as the Tutte, Penrose, Bollob\'as-Riordan, and transition polynomials, admit combinatorial interpretations and evaluations as weighted…

We prove that if $K$ is a compact subset of an affine variety O = P^n - D (where D is a projective hypersuface), and if K is a compact subset of a closed analytic subvariety V \subset O, then the projective hull K^ of K has the property…

A graph $G$ is a $k$-leaf power if there exists a tree $T$ whose leaf set is $V(G)$, and such that $uv \in E(G)$ if and only if the distance between $u$ and $v$ in $T$ is at most $k$. The graph classes of $k$-leaf powers have several…

Let $P$ be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope ${\mathcal O}(P)$ is equal to that of the chain polytope ${\mathcal C}(P)$. Furthermore, it will be shown that the degree…

A subset of vertices of a graph $G$ is a general position set if no triple of vertices from the set lie on a common shortest path in $G$. In this paper we introduce the general position polynomial as $\sum_{i \geq 0} a_i x^i$, where $a_i$…

We show that a closed orientable 3--dimensional manifold admits a round fold map into the plane, i.e. a fold map whose critical value set consists of disjoint simple closed curves isotopic to concentric circles, if and only if it is a graph…

If $K$ is a simplicial complex on $m$ vertices the flagification of $K$ is the minimal flag complex $K^f$ on the same vertex set that contains $K$. Letting $L$ be the set of vertices, there is a sequence of simplicial inclusions $L\to K\to…

The simplex algorithm using the random edge pivot-rule on any realization of a dual cyclic 4-polytope with n facets does not take more than O(n) pivot-steps. This even holds for general abstract objective functions (AOF) / acyclic unique…