Related papers: A complete $g$-vector for convex polytopes

Let G be a finite simple graph. In this paper we will show that the binomial edge ideal of G, JG is toric if and only if each connected component of G is complete and in this case it is the sum of toric ideal associated to bipartite…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Inspired by graceful labelings and total labelings of graphs, we introduce the idea of total difference labelings. A $k$-total labeling of a graph $G$ is an assignment of $k$ distinct labels to the edges and vertices of a graph so that…

Let $M$ be a non-compact connected manifold with a cocompact and properly discontinuous action of a discrete group $G$. We establish a Poincar\'{e}-Hopf theorem for a bounded vector field on $M$ satisfying a mild condition on zeros. As an…

This paper deals with the model companion of an endomorphism acting on a vector space, possibly with extra structure. Given a theory $T$ that $\varnothing$-defines an infinite $K$-vector space $\mathbb{V}$ in every model, we set $T_\theta…

We give a proof to the following theorem, which is well-known among experts: A connected subcomplex $W$ of a finite dimensional CAT(0) cubed complex $X$ is convex if and only if Lk$(v, W)$ is a full subcomplex of Lk$(v, X)$ for every vertex…

A unit vector field on a Riemannian manifold $M$ is called geodesic if all of its integral curves are geodesics. We show, in the case of $M$ being a flat 3-manifold not equal to $\mathbb{E}^3$, that every such vector field is tangent to a…

Given a set $\mathcal A = \{a_1,\ldots,a_n\} \subset \mathbb{N}^m$ of nonzero vectors defining a simplicial toric ideal $I_{\mathcal A} \subset k[x_1,...,x_n]$, where $k$ is an arbitrary field, we provide an algorithm for checking whether…

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

Let $G/H$ be a homogeneous variety, and let $X$ be a $G$-equivariant embedding of $G/H$such that the number of $G$-orbits in $X$ is finite. We show that the equivariant Borel-Moore homology of $X$ has a filtration with associated graded…

We introduce a notion of equivariant vector bundles on schemes over semirings. We do this by considering the functor of points of a locally free sheaf. We prove that every toric vector bundle on a toric scheme $X$ over an idempotent…

Using the language of T-varieties, we study torus invariant curves on a complete normal variety $X$ with an effective codimension-one torus action. In the same way that the $T$-invariant Weil divisors on $X$ are sums of "vertical" divisors…

The Complex Axis theorem states that any endomorphism of a finite-dimensional complex vector space affords an eigen-vector (or "invariant axis"). A geometric proof of this geometric result was given by A. de Medeiros, transforming the…

The F-index of a graph $G$ is the sum of the cubes of the degrees of the vertices of $G$. In this paper, explicit expressions for the F-index of different transformation graphs of type ${{G}^{xyz}}$ with $x, y, z\in \{-, + \}$ are obtained.…

Generalizing F-nilpotent completion for a ring spectrum F we first define the notion of completion with respect to a thick subcategory in a monogenic stable homotopy category. Specializing this to the thick subcategory generated by…

Let X be a smooth complete complex toric variety such that the boundary is a simple normal crossing divisor, and let E be a holomorphic vector bundle on X. We prove that E admits an equivariant structure if and only if E admits a…

We characterize the canonical algebras such that for all dimension vectors of homogeneous modules the corresponding module varieties are complete intersections (respectively, normal). We also investigate the sets of common zeros of…

An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while mu(G) is the cardinality of a maximum matching.…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…