Related papers: Zygmund graphs are thin for doubling measures
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
We study random integer-valued Lipschitz functions on regular trees. It was shown by Peled, Samotij and Yehudayoff that such functions are localized, however, finer questions about the structure of Gibbs measures remain unanswered. Our main…
Fractal Lipschitz-Killing curvature measures C^f_k(F,.), k = 0, ..., d, are determined for a large class of self-similar sets F in R^d. They arise as weak limits of the appropriately rescaled classical Lipschitz-Killing curvature measures…
We consider two operations on an edge of an embedded graph (or equivalently a ribbon graph): giving a half-twist to the edge and taking the partial dual with respect to the edge. These two operations give rise to an action of S_3^{|E(G)|},…
Let $({\mathcal X},d,\mu)$ be a metric measure space satisfying both the upper doubling and the geometrically doubling conditions. In this paper, the authors establish some equivalent characterizations for the boundedness of fractional…
Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…
It is known that the bi-Lipschitz right classification of function germs admit moduli. In this article we introduce a notion called the Lipschitz simple function germs and present a full classification in the complex case. A surprising…
The d-measurement set of a graph is its set of possible squared edge lengths over all d-dimensional embeddings. In this note, we define a new notion of graph isomorphism called d-measurement isomorphism. Two graphs are d-measurement…
Let X_1 ,..., X_n be a collection of binary valued random variables and let f : {0,1}^n -> R be a Lipschitz function. Under a negative dependence hypothesis known as the {\em strong Rayleigh} condition, we show that f - E f satisfies a…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…
A homomorphism height function on the $d$-dimensional torus $\mathbb{Z}_n^d$ is a function taking integer values on the vertices of the torus with consecutive integers assigned to adjacent vertices. A Lipschitz height function is defined…
The Hausdorff dimension of the graphs of the functions in H\"older and Besov spaces (in this case with integrability p \geq 1) on fractal d-sets is studied. Denoting by s \in (0,1] the smoothness parameter, the sharp upper bound…
This paper deals with spectral inequalities for one-dimensional Schr\"odinger operators with potentials bounded between two increasing functions (weights). The spectral inequality allows one to estimate the norm of a function with bounded…
The \emph{thinness} of a graph is a width parameter that generalizes some properties of interval graphs, which are exactly the graphs of thinness one. Graphs with thinness at most two include, for example, bipartite convex graphs. Many…
Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA '14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, $K_t$-free unit…
In finite graphs, finite-order tangles offer an abstract description of highly connected substructures. In infinite graphs, infinite-order tangles compactify the graphs in the same way the ends compactify connected locally finite graphs.…
Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…
In this paper we enumerate the necessary and sufficient conditions for the weak modular product of two simple graphs to be perfect. The weak modular product differs from the direct product by also encoding non-adjacencies of the factor…
The structure of a Nuttall partition into sheets of some class of four-sheeted Riemann surfaces is studied. The corresponding class of multivalued analytic functions is a special class of algebraic functions of fourth order generated by the…
We obtain estimates exact in order for deviations of Zygmund sums in metrics of spaces $L_{q}$, $1<q<\infty$, on classes of $2\pi$-periodic functions, that admit the representation in the form of convolution of functions that belong to unit…