Related papers: Surjective polymorphisms of reflexive cycles
We study diffeomorphisms $f$ with heterodimensional cycles, that is, heteroclinic cycles associated to saddles $p$ and $q$ with different indices. Such a cycle is called fragile if there is no diffeomorphism close to $f$ with a robust cycle…
A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize…
A classification of discrete polymatroids whose independence polytopes are reflexive will be presented.
Two cycles on a projective variety over an algebraically closed field are shown to be rationally equivalent if and only if their difference equals a difference of complete intersections of a certain kind. Some of Bloch's conjectures for…
Reflexive functors of modules naturally appear in Algebraic Geometry. In this paper we define a wide and elementary family of reflexive functors of modules, closed by tensor products and homomorphisms, in which Algebraic Geometry can be…
Let $G$ be a planar graph and let $C$ be a cycle in $G$. Inside of each finite face of $G$, we write down the number of edges of that face which belong to $C$. This is the signature of $C$ in $G$. The notion of a signature arises naturally…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
A signed graph is a graph whose edges are labelled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles.…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
Let $G$ be a graph of girth $g$ and circumference $c.$ A vertex $v$ of $G$ is called weakly pancyclic if $v$ lies on an $\ell$-cycle for every integer $\ell$ with $g\le \ell\le c.$ We prove that if $G$ is a nonbipartite graph of order $n\ge…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
A weighted digraph is a digraph such that every arc is assigned a nonnegative number, called the weight of the arc. The weighted outdegree of a vertex $v$ in a weighted digraph $D$ is the sum of the weights of the arcs with $v$ as their…
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
Given a point S and any irreducible algebraic curve C in P^2 (with any type of singularities), we consider the caustic of reflection defined as the Zariski closure of the envelope of the reflected lines from the point S on the curve C. We…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
The classical Sturm-Hurwitz-Kellogg theorem asserts that a function, orthogonal to an n-dimensional Chebyshev system on a circle, has at least n+1 sign changes. We prove the converse: given an n-dimensional Chebyshev system on a circle and…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
We prove that a linear growth graph has finitely many horofunctions. This provides a short and simple proof that any finitely generated infinite group of linear growth is virtually cyclic.