Related papers: Large dilates of hypercube graphs in the plane
Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…
We give a characterization of distance--preserving subgraphs of Johnson graphs, i.e. of graphs which are isometrically embeddable into Johnson graphs (the Johnson graph $J(m,\Lambda)$ has the subsets of cardinality $m$ of a set $\Lambda$ as…
For a vertex set $S\subseteq V(G)$ in a graph $G$, the {\em distance multiset}, $D(S)$, is the multiset of pairwise distances between vertices of $S$ in $G$. Two vertex sets are called {\em homometric} if their distance multisets are…
Metric graphs are special types of metric spaces used to model and represent simple, ubiquitous, geometric relations in data such as biological networks, social networks, and road networks. We are interested in giving a qualitative…
We discuss a 1+2 dimensional model with unconventional supersymmetry at the boundary of an AdS${}_4$, \,$\mathcal{N}$-extended supergravity. The resulting features of the supersymmetric boundary open the possibility of describing the…
We provide a framework for proofs of structural theorems about sets with positive Banach logarithmic density. For example, we prove that if $A\subseteq \mathbb{N}$ has positive Banach logarithmic density, then $A$ contains an approximate…
In this note we study the endomorphisms of certain Banach algebras of infinitely differentiable functions on compact plane sets, associated with weight sequences M. These algebras were originally studied by Dales, Davie and McClure. In a…
This paper makes a deep study of regular two-distance sets. A set of unit vectors $X$ in Euclidean space $\RR^n$ is said to be regular two-distance set if the inner product of any pair of its vectors is either $\alpha$ or $\beta$, and the…
Let $\G$ be any cocompact, discrete subgroup of $\pslr$. In this paper we find estimates for the predual and the uniform Banach space norms in the von Neumann algebras associated with the Berezin' s quantization of a compact Riemann surface…
Distance-hereditary graphs form an important class of graphs, from the theoretical point of view, due to the fact that they are the totally decomposable graphs for the split-decomposition. The previous best enumerative result for these…
We show that the classes of separable reflexive Banach spaces and of spaces with separable dual are strongly bounded. This gives a new proof of a recent result of E. Odell and Th. Schlumprecht, asserting that there exists a separable…
For every positive integer $n$, we find a complete classification for planar graphs according to the collection of numbers of common neighbours for every $n$-tuple of distinct vertices. Our results expand the literature on planar graphical…
In the Metric Dimension problem, one asks for a minimum-size set $R$ of vertices such that for any pair of vertices of the graph, there is a vertex from $R$ whose two distances to the vertices of the pair are distinct. This problem has…
We show that every Banach space containing isomorphic copies of $c_0$ can be equivalently renormed so that every nonempty relatively weakly open subset of its unit ball has diameter 2 and, however, its unit ball still contains convex…
We prove that a graph on up to 9 vertices is a unit-distance graph if and only if it does not contain one of 74 so-called minimal forbidden graphs. This extends the work of Chilakamarri and Mahoney (1995), who provide a similar…
Graph embeddings have emerged as a powerful tool for representing complex network structures in a low-dimensional space, enabling the use of efficient methods that employ the metric structure in the embedding space as a proxy for the…
These draft notes are from a graduate course given by the author in Berkeley during the spring semester of 2005. They cover the basic ideas of a new, geometric approach to geometric measure theory. They begin with a new theory of exterior…
We prove that for every complete multipartite graph $F$ there exist very dense graphs $G_n$ on $n$ vertices, namely with as many as ${n\choose 2}-cn$ edges for all $n$, for some constant $c=c(F)$, such that $G_n$ can be decomposed into…
We consider an extension of the triangular-distance Delaunay graphs (TD-Delaunay) on a set $P$ of points in the plane. In TD-Delaunay, the convex distance is defined by a fixed-oriented equilateral triangle $\triangledown$, and there is an…
This paper is concerned with the characterization of $\alpha$-modulation spaces by Banach frames, i.e., stable and redundant non-orthogonal expansions, constituted of functions obtained by a suitable combination of translation, modulation…