Related papers: Vertex Structure of Master Corner Polyhedra

A vertex subset $W\subseteq V$ of the graph $G = (V,E)$ is an independent dominating set if every vertex in $V\setminus W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. We enumerate independent…

Let G be a Lie goup, let M and N be smooth connected G-manifolds, let f be a smooth G-map from M to N, and let P denote the fiber of f. Given a closed and equivariantly closed relative 2-form for f with integral periods, we construct the…

The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…

Let $G$ be a finite group and let $\pi(G)=\{p_1, p_2, \ldots, p_k\}$ be the set of prime divisors of $|G|$ for which $p_1<p_2<\cdots<p_k$. The Gruenberg-Kegel graph of $G$, denoted ${\rm GK}(G)$, is defined as follows: its vertex set is…

This paper deals with triangulations of the 2-torus with the vertex labeled general octahedral graph $O_4$ which is isomorphic to the complete four-partite graph $K_{2,2,2,2}$; it is known that there exist precisely twelve such…

Given a graph $G=(V,E)$ and a weight function on the edges $w:E\mapsto\RR$, we consider the polyhedron $P(G,w)$ of negative-weight flows on $G$, and get a complete characterization of the vertices and extreme directions of $P(G,w)$. As a…

The problem of modifying a given graph to satisfy certain properties has been one of the central topics in parameterized tractability study. In this paper, we study the cycle contraction problem, which makes a graph into a cycle by edge…

To any graph $G$ one can associate a toric variety $X(\mathcal{P}G)$, obtained as a blowup of projective space along coordinate subspaces corresponding to connected subgraphs of $G$. The polytope of this toric variety is the graph…

We introduce a theory of geometry for nonnoetherian commutative algebras with finite Krull dimension. In particular, we establish new notions of normalization and height: depiction (a special noetherian overring) and geometric codimension.…

We study in detail certain natural continuous representations of G = GL(n,K) in locally convex vector spaces over a locally compact, non-archimedean field K of characteristic zero. We construct boundary value maps, or integral transforms,…

In the spirit of the geometric approach to two-dimensional conformal field theory, we explicitly associate to every holomorphic vertex operator algebra a section of a power of Hodge line bundle on the moduli space of curves of arbitrary…

Given a polyhedron (planar, $3$-connected graph) $G$, we investigate its common neighbourhood graph con($G$). For cubic ($3$-regular) polyhedra, we show that the planarity of con($G$) depends on the number of odd faces of $G$, and on their…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…

We study the specializations $\mathcal{L}_{g,n}^\epsilon$ at roots of unity $\epsilon$ of odd order of the graph algebras, associated to a simply-connected complex semi-simple algebraic group $G$ and a compact oriented surface…

This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…

Geometric algebra is an optimal frame work for calculating with vectors. The geometric algebra of a space includes elements that represent all the its subspaces (lines, planes, volumes, ...). Conformal geometric algebra expands this…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…