Related papers: Self-similar sets and Lipschitz graphs
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…
In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…
We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…
Let $(X,d)$ be a compact metric space, $f:X \mapsto X$ be a continuous map satisfying a property we call almost specification (which is slightly weaker than the $g$-almost product property of Pfister and Sullivan), and $\phi$ be a…
For the singularly perturbed system \[\Delta u_{i,\beta}=\beta u_{i,\beta}\sum_{j\neq i}u_{j,\beta}^2, \quad 1\leq i\leq N,\] we prove that flat interfaces are uniformly Lipschitz. As a byproduct of the proof we also obtain the optimal…
We consider isomorphism properties of infinite random geometric graphs defined over a variety of metrics. In previous work, it was shown that for $\mathbb{R}^n$ with the $L_{\infty}$-metric, the infinite random geometric graph is, with…
Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
The NP-complete problem Matching Cut is to decide if a graph has a matching that is also an edge cut of the graph. We prove new complexity results for Matching Cut restricted to $H$-free graphs, that is, graphs that do not contain some…
We study unit disk visibility graphs, where the visibility relation between a pair of geometric entities is defined by not only obstacles, but also the distance between them. That is, two entities are not mutually visible if they are too…
Given a pointed metric space $M$, we study when there exist $n$-dimensional linear subspaces of $\operatorname{Lip}_0(M)$ consisting of strongly norm-attaining Lipschitz functionals, for $n\in\mathbb{N}$. We show that this is always the…
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…
We isolate conditions on the relative size of sets of natural numbers $A,B$ that guarantee a nonempty intersection $\Delta(A)\cap\Delta(B)\ne\emptyset$ of the corresponding sets of distances. Such conditions apply to a large class of zero…
We give conditions for topological and bi-Lipschitz equivalences within a class of mixed singularities of Pham-Brieskorn type. As a consequence, we construct infinite families that are topologically trivial but have distinct bi-Lipschitz…
Given a connected finite graph $G$, an integer-valued function $f$ on $V(G)$ is called $M$-Lipschitz if the value of $f$ changes by at most $M$ along the edges of $G$. In 2013, Peled, Samotij, and Yehudayoff showed that random $M$-Lipschitz…
In this paper we propose a new model of random graph directed fractals that extends the current well-known model of random graph directed iterated function systems, $V$-variable attractors, and fractal and Mandelbrot percolation. We study…
In this paper, we study the dimension of planar self-affine sets, of which generating iterated function system (IFS) contains non-invertible affine mappings. We show that under a certain separation condition, the dimension equals to the…
A mixed graph is cospectral to its converse, with respect to the usual adjacency matrices. Hence, it is easy to see that a mixed graph whose eigenvalues occur uniquely, up to isomorphism, must be isomorphic to its converse. It is therefore…
We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some…
We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…