相关论文: The edge-isorperimetric problem on Sierpinski grap…

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions,…

Martin-L\"of's identity types provide a generic (albeit opaque) notion of identification or "equality" between any two elements of the same type, embodied in a canonical reflexive graph structure $(=_A, \mathbf{refl})$ on any type $A$. The…

In this paper we discuss off-shell representations of N-extended supersymmetry in one dimension, ie, N-extended supersymmetric quantum mechanics, and following earlier work on the subject codify them in terms of certain graphs, called…

In the present paper, we apply Alexandrov geometry methods to study geometric analysis aspects of infinite semiplanar graphs with nonnegative combinatorial curvature in the sense of Higuchi. We obtain the metric classification of these…

We prove existence of a measurable Riemannian structure on higher-dimensional harmonic Sierpinski gasket fractals and deduce Gaussian heat kernel bounds in the geodesic metric. Our proof differs from that given by Kigami for the usual…

In this paper, we study discrete Lyapunov models, which consist of steady-state distributions of first-order vector autoregressive models. The parameter matrix of such a model encodes a directed graph whose vertices correspond to the…

We prove several rigidity properties for random quotients of mapping class groups of surfaces, namely whose kernel is normally generated by the n-th steps of finitely many independent random walks. Firstly, we generalise a celebrated…

Combining the the results of A.R. Meyer and L.J. Stockmeyer "The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space", and K.S. Booth "Isomorphism testing for graphs, semigroups, and finite automata are…

We use numerical continuation and bifurcation techniques in a boundary value setting to follow Lyapunov families of periodic orbits. These arise from the polygonal system of $n$ bodies in a rotating frame of reference. When the frequency of…

The paper investigates connections between abstract polytopes and properly edge colored graphs. Given any finite n-edge-colored n-regular graph G, we associate to G a simple abstract polytope P_G of rank n, called the colorful polytope of…

We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…

Motivated by recent results in graph C*-algebras concerning an equivariant pushout structure of the Vaksman-Soibelman quantum odd spheres, we introduce a class of graphs called trimmable. Then we show that the Leavitt path algebra of a…

This paper extends the Hodge-de Rham theory of Aaron \textit{et al.} [Commun. Pure Appl. Anal. {\bf 13} (2014)] to higher-dimensional level-$l$ Sierpinski gaskets $SG_{\ell}^{n},$ providing a framework for analyzing differential forms and…

Daisy graphs of a rooted graph $G$ with the root $r$ were recently introduced as a generalization of daisy cubes, a class of isometric subgraphs of hypercubes. In this paper we first solve the problem posed in \cite{Taranenko2020} and…

Let $E$ be the Sierpinski gasket, i.e., the self-similar set generated by the IFS $\left \{f_a(x)=\frac{x+a}{q}: a\in \{(0,0), (0,1), (1,0)\}\right \}$. In paper, we provide a description of the following set for $2<q<3$ \begin{equation*}…

Given a measurable set $A\subset \mathbb R^d$ we consider the "large-distance graph" $\mathcal{G}_A$, on the ground set $A$, in which each pair of points from $A$ whose distance is bigger than 2 forms an edge. We consider the problems of…

The fine curve graph was introduced to study homeomorphism group of surfaces. In this paper we study the topology of the Gromov boundary of this graph for closed surfaces with higher genus. We first prove a bounded geodesic image theorem…

We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…