Related papers: Sharkovsky's Theorem and one-dimensional combinato…

Establishing the existence of periodic orbits is one of the crucial and most intricate topics in the study of dynamical systems, and over the years, many methods have been developed to this end. On the other hand, finding closed orbits in…

This book collects the lectures about graph theory and its applications which were given to students of mathematical departments of Moscow State University and Peking University. Graph theory is a very wide field with a lot of applications…

In this article we are introducing combinatorial spectra of graphs, this is a generalization of $H$-Hamiltonian spectra. The main motivation was to made from $H$-Hamiltonian spectra an operation and develop some algebra in this field. An…

We prove that the Gauss map of a surface of constant mean curvature embedded in Minkowski space is harmonic. This fact will then be used to study 2+1 gravity for surfaces of genus higher than one. By considering the energy of the Gauss map,…

In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…

This note contains a new combinatorial proof of Cramer's rule based on the Gessel-Viennot-Lindstrom Lemma.

The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…

Mirsky proved that, for the existence of a complex matrix with given eigenvalues and diagonal entries, the obvious necessary condition is also sufficient. We generalize this theorem to matrices over any field and provide a short proof.…

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

The preference graph is a combinatorial representation of the structure of a normal-form game. Its nodes are the strategy profiles, with an arc between profiles if they differ in the strategy of a single player, where the orientation…

We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…

In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…

This book objective is to develop an algebraization of graph grammars. Equivalently, we study graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely…

We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as…

In earlier papers we introduced a representation of isotopy classes of compact surfaces embedded in the three-sphere by so called rectangular diagrams. The formalism proved useful for comparing Legendrian knots. The aim of this paper is to…

In this letter we present a theorem on the dynamics of the generalized Hubbard models. This theorem shows that the symmetry of the single particle Hamiltonian can protect a kind of dynamical symmetry driven by the interactions. Here the…

In a recent paper, Chernikov and Starchenko prove that graphs defined in distal theories have strong regularity properties, generalizing previous results about graphs defined by semi-algebraic relations. We give a shorter, purely…

The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…