Related papers: Stable components and layers
Cooperative dynamics are common in ecology and population dynamics. However, their commonly high degree of complexity with a large number of coupled degrees of freedom renders them difficult to analyse. Here we present a graph-theoretical…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
Vietoris-Rips and degree Rips complexes are represented as homotopy types by their underlying posets of simplices, and basic homotopy stability theorems are recast in these terms. These homotopy types are viewed as systems (or functors),…
We study stationary stable processes related to periodic and cyclic flows in the sense of Rosinski [Ann. Probab. 23 (1995) 1163-1187]. These processes are not ergodic. We provide their canonical representations, consider examples and show…
A graph pair $(\Gamma, \Sigma)$ is called stable if $\aut(\Gamma)\times\aut(\Sigma)$ is isomorphic to $\aut(\Gamma\times\Sigma)$ and unstable otherwise, where $\Gamma\times\Sigma$ is the direct product of $\Gamma$ and $\Sigma$. A graph is…
For $x\in End(K^n)$ satisfying $x^2 = 0$ let $F_x$ be the variety of full flags stable under the action of $x$ (Springer fiber over $x$). The full classification of the components of $F_x$ according to their smoothness was provided in a…
We define a version of stable maps into the classifying stack $B\mathrm{GL}_N$, and develop a corresponding notion of $K$-theoretic Gromov-Witten invariants. In this setting, the evaluation morphisms are not of finite type; the definition…
The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size, and its roots are called {\em independence roots}. We investigate the stability of such polynomials, that is, conditions…
A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in…
We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…
The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…
In the first half this paper, we generalize the theory of layer points for Lesnick- (or degree-Rips-) complexes to the more general context of $\vec{v}$-hierarchical clusterings. Layer points provide a compressed description of a…
The non-Gorenstein locus of stable set rings of finite simple perfect graphs is studied. We describe combinatorially those perfect graphs whose stable set rings are Gorenstein on the punctured spectrum. In addition, we show that, in…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
Divisorial gonality and stable divisorial gonality are graph parameters, which have an origin in algebraic geometry. Divisorial gonality of a connected graph $G$ can be defined with help of a chip firing game on $G$. The stable divisorial…
A retract of a graph $\Gamma$ is an induced subgraph $\Psi$ of $\Gamma$ such that there exists a homomorphism from $\Gamma$ to $\Psi$ whose restriction to $\Psi$ is the identity map. A graph is a core if it has no nontrivial retracts. In…
Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…
In this paper, nonzero component graphs and nonzero component union graphs of finite dimensional vector space are studied using the zero-divisor graph of specially constructed 0-1-distributive lattice and the zero-divisor graph of rings.…