Related papers: Compatibility fans for graphical nested complexes
In this paper we continue the study of good re-embeddings of affine K-algebras started in [KLR]. The idea is to use special linear projections to find isomorphisms between a given affine K-algebra K[X]/I, where X=(x_1,...,x_n), and…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
Graphical condensation is a technique used to prove combinatorial identities among numbers of perfect matchings of plane graphs. Propp and Kuo first applied this technique to prove identities for bipartite graphs. Yan, Yeh, and Zhang later…
A new class of full fans in an euclidean space - tight fans - is introduced. Such fans are defined using a property of local symmetry in a face of a tiling. Tight fans are related to the theory of parallelotopes in an euclidean space. A…
A graph is \emph{fan-crossing free} if it has a drawing in the plane so that each edge is crossed by independent edges, that is the crossing edges have distinct vertices. On the other hand, it is \emph{fan-crossing} if the crossing edges…
In a finite-dimensional real vector space furnished with a rational structure with respect to a subfield of the field of real numbers, every (simplicial) rational semifan is contained in a complete (simplicial) rational semifan. In this…
Normal complexes are orthogonal truncations of polyhedral fans. In this paper, we develop the study of mixed volumes for normal complexes. Our main result is a sufficiency condition that ensures when the mixed volumes of normal complexes…
We propose new definitions of integral, reduced, and normal superrings and superschemes to properly establish the notion of a supervariety. We generalize several results about classical reduced rings and varieties to the supergeometric…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
We derive a general formula for the quadratic embedding constant of a graph join $\bar{K}_m+G$, where $\bar{K}_m$ is the empty graph on $m\ge1$ vertices and $G$ is an arbitrary graph. Applying our formula to a fan graph $K_1+P_n$, where…
For $r\geq 1$, the $r$-matching complex of a graph $G$, denoted $M_r(G)$, is a simplicial complex whose faces are the subsets $H \subseteq E(G)$ of the edge set of $G$ such that the degree of any vertex in the induced subgraph $G[H]$ is at…
Graph matching refers to finding node correspondence between graphs, such that the corresponding node and edge's affinity can be maximized. In addition with its NP-completeness nature, another important challenge is effective modeling of…
For a positive integer $d$, a connected graph $\Gamma$ is a symmetrical 2-extension of the $d$-dimensional grid $\Lambda^d$ if there exists a vertex-tran\-sitive group $G$ of automorphisms of $\Gamma$ and its imprimitivity system $\sigma$…
The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$ is the graph whose vertices correspond to the $i(G)$-sets, and where two…
The purpose of this article is to study the role of Artin fans in tropical and non-Archimedean geometry. Artin fans are logarithmic algebraic stacks that can be described completely in terms of combinatorial objects, so called Kato stacks,…
A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximum cardinality is a well-solved problem, it is NP-hard to…
In this paper, we study fan-planar drawings that use $h$ layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testing the existence of such drawings is fixed-parameter…
Given a closed subvariety of an algebraic torus, the associated tropical variety is a polyhedral fan in the space of 1-parameter subgroups of the torus which describes the behaviour of the subvariety at infinity. We show that the link of…
We introduce a graded homology theory for graded \'etale groupoids. For $\mathbb Z$-graded groupoids, we establish an exact sequence relating the graded zeroth-homology to non-graded one. Specialising to the arbitrary graph groupoids, we…
A finite abstract simplicial complex G defines the Barycentric refinement graph phi(G) = (G,{ (a,b), a subset b or b subset a }) and the connection graph psi(G) = (G,{ (a,b), a intersected with b not empty }). We note here that both…