Related papers: Homogeneous Subsets of a Lipschitz Graph and the C…

We prove an alternate Toeplitz corona theorem for the algebras of pointwise kernel multipliers of Besov-Sobolev spaces on the unit ball in $\mathbb{C}^{n}$, and for the algebra of bounded analytic functions on certain strictly pseudoconvex…

For a vertex $x$ of a graph $G$, let $N_G[x]$ be the set of $x$ with all of its neighbors in $G$. A set $C$ of vertices is an {\em identifying code} of $G$ if the sets $N_G[x]\cap C$ are nonempty and distinct for all vertices $x$. If $G$…

The corona problem was motivated by the question of the density of the open unit disc in the maximal ideal space of the algebra of bounded holomorphic functions on the unit disc. The corona problem connects operator theory, function theory,…

We expand upon a graph theoretic set of uncertainty principles with tight bounds for difference estimators acting simultaneously in the graph domain and the frequency domain. We show that the eigenfunctions of a modified graph Laplacian and…

The eigenvectors for graph $1$-Laplacian possess some sort of localization property: On one hand, any nodal domain of an eigenvector is again an eigenvector with the same eigenvalue; on the other hand, one can pack up an eigenvector for a…

We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and…

The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…

Given a graph G equals (V,E), a subset S subset of V is a dominating set if every vertex in V minus S is adjacent to some vertex in S. The dominating set with the least cardinality, gamma, is called a gamma-set which is commonly known as a…

We construct a corona of a relatively hyperbolic group by blowing-up all parabolic points of its Bowditch boundary. We relate the $K$-homology of the corona with the $K$-theory of the Roe algebra, via the coarse assembly map. We also…

We prove that the boundary of an almost minimizer of the intrinsic perimeter in a plentiful group can be approximated by intrinsic Lipschitz graphs. Plentiful groups are Carnot groups of step~$2$ whose center of the Lie algebra is generated…

Let $\alpha(G)$ denote the cardinality of a maximum independent set and $\mu(G)$ be the size of a maximum matching of a graph $G=\left( V,E\right) $. If $\alpha(G)+\mu(G)=\left\vert V\right\vert $, then $G$ is a K\"{o}nig-Egerv\'{a}ry…

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse…

Extending a previous result of the first two authors, we prove a local limit theorem for the joint distribution of subgraph counts in the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$. This limit can be described as a nonlinear transformation…

We give short expositions of both Leighton's proof and the Bass-Kulkarni proof of Leighton's graph covering theorem, in the context of colored graphs. We discuss a further generalization, needed elsewhere, to "symmetry-restricted graphs."…

We introduce a class of "Lipschitz horizontal" vector fields in homogeneous groups, for which we show equivalent descriptions, e.g. in terms of suitable derivations. We then investigate the associated Cauchy problem, providing a uniqueness…

A bounded domain in several complex variables with connected Lipschitz boundary is pseudoconvex if and only if the bottom of the (essential) spectrum of the Kohn Laplacian is positive on all (0, q)-forms with square-integrable coefficients.

We prove that if a parabolic Lipschitz (i.e., Lip(1,1/2)) graph domain has the property that its caloric measure is a parabolic $A_\infty$ weight with respect to surface measure (which in turn is equivalent to $L^p$ solvability of the…

It is shown that the ultimate version of the nonlinear Pietsch Domination Theorem remains true, even in a stronger presentation, if one of its hypotheses is removed. More precisely, we show that no trace of (sub)-homogeneity assumption is…

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…

The initial part of this paper is devoted to the notion of pseudo-seminorm on a vector space $E$. We prove that the topology of every topological vector space is defined by a family of pseudo-seminorms (and so, as it is known, it is…