Related papers: A complete $g$-vector for convex polytopes
It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.
Let G be a complex reductive algebraic group. We study complete intersections in a spherical homogeneous space G/H defined by a generic collection of sections from G-invariant linear systems. Whenever nonempty, all such complete…
In the previous paper, we describe the intersection complexes of a toric variety as a finite complex of graded exterior modules on the associated fan. In this second part, we rewrite it explicitly by the barycentric subdivision of the fan.…
In this paper we use toric geometry to investigate the topology of the totally non-negative part of the Grassmannian (Gr_{kn})_{\geq 0}. This is a cell complex whose cells Delta_G can be parameterized in terms of the combinatorics of…
Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…
A vector bundle E on a projective variety X is called finite if it satisfies a nontrivial polynomial equation with integral coefficients. A theorem of Nori implies that E is finite if and only if the pullback of E to some finite etale…
The $f$-vector of a polytope consists of the numbers of its $i$-dimensional faces. An open field of study is the characterization of all possible $f$-vectors. It has been solved in three dimensions by Steinitz in the early 19th century. We…
The perfectly matchable subgraph polytope of a graph is a (0,1)-polytope associated with the vertex sets of matchings in the graph. In this paper, we study algebraic properties (compressedness, Gorensteinness) of the toric rings of…
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…
Let $k$ be a positive integer and let $G$ be a graph with $n$ vertices. A connected $k$-subpartition of $G$ is a collection of $k$ pairwise disjoint sets (a.k.a. classes) of vertices in $G$ such that each set induces a connected subgraph.…
Let Y and X denote C^k vector fields on a possibly noncompact surface with empty boundary, k >0. Say that Y tracks X if the dynamical system it generates locally permutes integral curves of X. Let K be a locally maximal compact set of…
We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…
A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…
We show that for a complete complex algebraic variety the pure component of homology coincides with the image of intersection homology. Therefore pure homology is topologically invariant. To obtain slightly more general results we introduce…
Let $V$ be a set of cardinality $v$ (possibly infinite). Two graphs $G$ and $G'$ with vertex set $V$ are {\it isomorphic up to complementation} if $G'$ is isomorphic to $G$ or to the complement $\bar G$ of $G$. Let $k$ be a non-negative…
Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The…
In Finsler geometry the complete lift vector fields have distinguished geometric significance. For example a vector field on a Finsler manifold is said to be conformal if its complete lift is conformal in usual sense. In this work we define…
In this work, under a mild assumption, we give the classification of the complete polynomial vector fields in two variables up to algebraic automorphisms of $\C^2$. The general problem is also reduced to the study of the combinatorics of…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
Let (V,0) be a germ of a complete intersection variety in \CC^{n+k}, n>0, having an isolated singularity at 0 and X be the germ of a holomorphic vector field on \CC^{n+k} tangent to V and having on V an isolated zero at 0. We show that in…