Related papers: Sharkovsky's Theorem and one-dimensional combinato…
It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…
The interaction between combinatorics and algebraic and differential geometry is very strong. While researching a problem of Hessian topology, we came across a series of identities of binomial coefficients, which are useful for proving a…
We discuss the observability of a one-dimensional Schr\"odinger equation on certain time dependent domain. In linear moving case, we give the exact boundary and pointwise internal observability for arbitrary time. For the general moving, we…
There is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial "refinement" algorithms seem to be very efficient in practice. Some philosophical justification is provided by a classical theorem of…
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
This is a simple mathematical introduction into Feynman diagram technique, which is a standard physical tool to write perturbative expansions of path integrals near a critical point of the action. I start from a rigorous treatment of a…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
We prove Sklar's theorem in infinite dimensions via a topological argument and the notion of inverse systems.
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
In this article, we give an elementary combinatorial proof of a conjecture about the determination of automorphism group of the power graph of finite cyclic groups, proposed by Doostabadi, Erfanian and Jafarzadeh in 2013.
The theory of iterated monodromy groups was developed by Nekrashevych. It is a wonderful example of application of group theory in dynamical systems and, in particular, in holomorphic dynamics. Iterated monodromy groups encode in a…
In this paper we introduce the concept of polynomial diagrams and its area for special polynomials.We study the properties of polynomial area diagrams. The formula for the area of an arbitrary polynomial diagram.
This is a lightning introduction to some modern techniques used in the study of the statistical properties of hyperbolic dynamical systems. The emphasis is not in presenting a comprehensive theory but rather in fleshing out the main ideas…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
The dynamics of one dimensional iterative maps in the regime of fully developed chaos is studied in detail. Motivated by the observation of dynamical structures around the unstable fixed point we introduce the geometrical concept of a…
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…
In the first part of the paper the natural scheme for proving noncommutative individual ergodic theorems for multiple sequences is described and applied to obtain results on unrestricted convergence of multiaverages. In the second part…
A modern elementary introduction to special relativity for advanced school children or first-year university students, in Russian. I try to demonstrate that relativity does not contradict common sense; on the contrary, it follows from…
The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…