相关论文: On the separation profile of infinite graphs
Geometrical structures intrinsic to non-expanding, weakly isolated and isolated horizons are analyzed and compared with structures which arise in other contexts within general relativity, e.g., at null infinity. In particular, we address in…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
Two method for computation of the spectra of certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on the spectral theory of Jacobi matrices. The second…
A study of triangulations of cycles in the Cayley diagrams of finitely generated groups leads to a new geometric characterization of hyperbolic groups.
In this paper we collect the main properties of free curves in the complex projective plane and a lot of conjectures and open problems, both old and new. In the quest to understand the mystery of free curves, many tools were developed and…
We determine the maximum number of maximal independent sets of arbitrary graphs in terms of their covering numbers and we completely characterize the extremal graphs. As an application, we give a similar result for K\"onig-Egerv\'ary graphs…
In this paper, rough approximations of Cayley graphs are studied and rough edge Cayley graphs are introduced. Furthermore, a new algebraic definition called pseudo-Cayley graphs containing Cayley graphs is proposed. Rough approximation is…
We discuss our work on pointwise inequalities for the gradient which are connected with the isoperimetric profile associated to a given geometry. We show how they can be used to unify certain aspects of the theory of Sobolev inequalities.…
It was studied the growth of Temperley-Lieb type algebras with orthogonal and commutative relations associated with 2-colored edges graphs. Depending on the structure of the graphs they can be finite-dimensional or to have linear or…
We consider a model for chaotic diffusion with amplification on graphs associated with piecewise-linear maps of the interval [S. Lepri, Chaos Solitons & Fractals, 139,110003 (2020)]. We determine the conditions for having fat-tailed…
The paper continues the author's research in the problem of quantitative investigation of basic curvelinear quasiinvariants of quasiconformal curves. It concerns polygons with infinite number of vertices and provides various distortion…
We offer a new perspective on the closed graph theorem and the open mapping theorem for separated barrelled spaces and fully complete spaces.
In this paper, we develop the mathematical tools needed to explore isotopy classes of tilings on hyperbolic surfaces of finite genus, possibly nonorientable, with boundary, and punctured. More specifically, we generalize results on…
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
We use a combinatorial approximation of the hyperbolic plane to investigate properties of hyperbolic geometry such as exponential growth of perimeter and area of disks, and the linear isoperimetric inequality. This calculations give a…
We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.
In the recent years we have witnessed a rapid development of new algorithmic techniques for parameterized algorithms for graph separation problems. We present experimental evaluation of two cornerstone theoretical results in this area:…